English
Related papers

Related papers: Discrete logarithms in curves over finite fields

200 papers

In this note is we exhibit an elementary method to construct explicitly curves over finite fields with many points. Despite its elementary character the method is very efficient and can be regarded as a partial substitute for the use of…

alg-geom · Mathematics 2007-05-23 Gerard van der Geer , Marcel van der Vlugt

Solving the discrete logarithm problem in a finite prime field is an extremely important computing problem in modern cryptography. The hardness of solving the discrete logarithm problem in a finite prime field is the security foundation of…

Cryptography and Security · Computer Science 2026-05-28 Wen Huang

We address the problem of computing in the group of $\ell^k$-torsion rational points of the jacobian variety of algebraic curves over finite fields, with a view toward computing modular representations.

Number Theory · Mathematics 2012-05-07 Jean-Marc Couveignes

We introduce a new algorithm to compute the zeta function of a curve over a finite field. This method extends Kedlaya's algorithm to a very general class of curves using a map to the projective line. We develop all the necessary bounds,…

Number Theory · Mathematics 2014-09-11 Jan Tuitman

We present a discretization of the Jacobi last multiplier, with some applications to the computation of solutions of difference equations.

Mathematical Physics · Physics 2015-06-04 D. Levi , M. A. Rodriguez

This note concerns the theoretical algorithmic problem of counting rational points on curves over finite fields. It explicates how the algorithmic scheme introduced by Schoof and generalized by the author yields an algorithm whose running…

Number Theory · Mathematics 2007-05-23 Jonathan Pila

We show a direct calculation of Jacobian matrices in the old problems of rational curves on generic hypersurfaces.

Algebraic Geometry · Mathematics 2017-08-15 Bin Wang

We give a brief report on our computations of linear determinantal representations of smooth plane cubics over finite fields. After recalling a classical interpretation of linear determinantal representations as rational points on the…

Number Theory · Mathematics 2016-05-24 Yasuhiro Ishitsuka

This paper presents algorithmic approaches to study superspecial hyperelliptic curves. The algorithms proposed in this paper are: an algorithm to enumerate superspecial hyperelliptic curves of genus $g$ over finite fields $\mathbb{F}_q$,…

Algebraic Geometry · Mathematics 2019-07-02 Momonari Kudo , Shushi Harashita

We study two different actions on the moduli spaces of logarithmic connections over smooth complex projective curves. Firstly, we establish a dictionary between logarithmic orbifold connections and parabolic logarithmic connections over the…

Algebraic Geometry · Mathematics 2012-05-14 Indranil Biswas , Viktoria Heu

The proof of the theorem concerning to the inverse cyclotomic Discrete Fourier Transform algorithm over finite field is provided.

Information Theory · Computer Science 2019-12-24 Sergei V. Fedorenko

In this paper, a new algorithm to solve the discrete logarithm problem is presented which is similar to the usual baby-step giant-step algorithm. Our algorithm exploits the order of the discrete logarithm in the multiplicative group of a…

Cryptography and Security · Computer Science 2020-11-17 Prabhat Kushwaha , Ayan Mahalanobis

We analyse the complexity of solving the discrete logarithm problem and of testing the principality of ideals in a certain class of number fields. We achieve the subexponential complexity in $O(L(1/3,O(1)))$ when both the discriminant and…

Number Theory · Mathematics 2012-04-06 Jean-François Biasse

We investigate the Jacobian decomposition of some algebraic curves over finite fields with genus $4$, $5$ and $10$. As a corollary, explicit equations for curves that are either maximal or minimal over the finite field with $p^2$ elements…

Algebraic Geometry · Mathematics 2019-12-10 Daniele Bartoli , Massimo Giulietti , Mokoto Kawakita , Maria Montanucci

We describe efficient differentiation methods for computing Jacobians and gradients of a large class of matrix functions including the matrix logarithm $\log(A)$ and $p$-th roots $A^{\frac{1}{p}}$. We exploit contour integrals and conformal…

Computational Physics · Physics 2025-01-06 Tina Torabi , Timon S Gutleb , Christoph Ortner

Let p be an odd prime number and g $\ge$ 2 be an integer. We present an algorithm for computing explicit rational representations of isogenies between Jacobians of hyperelliptic curves of genus g over an extension K of the field of p-adic…

Algebraic Geometry · Mathematics 2020-09-28 Élie Eid

Gradient-based techniques are becoming increasingly critical in quantitative fields, notably in statistics and computer science. The utility of these techniques, however, ultimately depends on how efficiently we can evaluate the derivatives…

Computation · Statistics 2020-02-04 Michael Betancourt , Charles C. Margossian , Vianey Leos-Barajas

We provide a characterization for complex analytic curves among two-dimensional minimal graphs in $\mathbb{R}^{4}$ via the Jacobian

Differential Geometry · Mathematics 2014-02-26 Th. Hasanis , A. Savas-Halilaj , Th. Vlachos

We look at the decomposition of the compactified jacobian of a singular curve into components and discuss some examples.

alg-geom · Mathematics 2008-02-03 Jyotsna Gokhale

Linear forms in logarithms over connected commutative algebraic groups over the algebraic numbers field have been studied widely. However, the theory of linear forms in logarithms over noncommutative algebraic groups have not been developed…

Number Theory · Mathematics 2015-12-01 Mario Huicochea