相关论文: Index calculus with double large prime variation f…
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…
The discrete logarithm problem in Jacobians of curves of high genus $g$ over finite fields $\FF_q$ is known to be computable with subexponential complexity $L_{q^g}(1/2, O(1))$. We present an algorithm for a family of plane curves whose…
We discuss how to apply Gaudry's index calculus algorithm for abelian varieties to solve the discrete logarithm problem in the trace zero variety of an elliptic curve. We treat in particular the practically relevant cases of field…
We present an algorithm for solving the discrete logarithm problem in Jacobians of families of plane curves whose degrees in $X$ and $Y$ are low with respect to their genera. The finite base fields $\FF_q$ are arbitrary, but their sizes…
We introduce the notion of isolated genus two curves. As there is no known efficient algorithm to explicitly construct isogenies between two genus two curves with large conductor gap, the discrete log problem (DLP) cannot be efficiently…
This paper is concerned with difference equations on elliptic curves. We establish some general properties of the difference Galois groups of equations of order two, and give applications to the calculation of some difference Galois groups.…
We study the discrete logarithm problem for the multiplicative group and for elliptic curves over a finite field by using a lifting of the corresponding object to an algebraic number field and global duality. We introduce the…
We present an algorithm that, for every fixed genus $g$, will enumerate all hyperelliptic curves of genus $g$ over a finite field $k$ of odd characteristic in quasilinear time; that is, the time required for the algorithm is…
We discuss a class of binary cyclic codes and their dual codes. The minimum distance is determined using algebraic geometry, and an application of Weil's theorem. We relate the weights appearing in the dual codes to the number of rational…
Let $K$ be the fraction field of a complete discrete valuation ring, with algebraically closed residue field of characteristic $p > 0$. This paper studies the index of a smooth, proper $K$-variety $X$ with logarithmic good reduction. We…
The "defect" of a curve over a finite field is the difference between the number of rational points on the curve and the Weil-Serre bound for the curve. We present a construction for producing genus-4 double covers of genus-2 curves over…
We give practical algorithms for computing the divisor class group and the gonality of a curve over a finite field, achieving several orders of magnitude speedup over existing methods for sufficiently large genus or residue field. The…
We outline a general algorithm for computing an explicit model over a number field of any curve of genus 2 whose (unpolarized) Jacobian is isomorphic to the product of two elliptic curves with CM by the same order in an imaginary quadratic…
We find a closed formula for the number $\operatorname{hyp}(g)$ of hyperelliptic curves of genus $g$ over a finite field $k=\mathbb{F}_q$ of odd characteristic. These numbers $\operatorname{hyp}(g)$ are expressed as a polynomial in $q$ with…
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$,…
We study stable curves of arithmetic genus 2 which admit two morphisms of finite degree $p$, resp. $d$, onto smooth elliptic curves, with particular attention to the case $p$ prime.
We describe a provably quasi-polynomial algorithm to compute discrete logarithms in the multiplicative groups of finite fields of small characteristic, that is finite fields whose characteristic is logarithmic in the order. We partially…
We give a new approach to the elliptic curve discrete logarithm problem over cubic extension fields $\mathbb{F}_{q^3}$. It is based on a transfer: First an $\mathbb{F}_q$-rational $(\ell,\ell,\ell)$-isogeny from the Weil restriction of the…
For a non-CM elliptic curve $E$ defined over $\mathbb{Q}$, the Galois action on its torsion points gives rise to a Galois representation $\rho_E: Gal(\overline{\mathbb{Q}}/\mathbb{Q})\to GL_2(\widehat{\mathbb{Z}})$ that is unique up to…
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…