Skip to Main content Skip to Navigation
Journal articles

An $L (1/3)$ Discrete Logarithm Algorithm for Low Degree Curves

Andreas Enge 1, 2 Pierrick Gaudry 3 Emmanuel Thomé 3
1 LFANT - Lithe and fast algorithmic number theory
IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest
3 CARAMEL - Cryptology, Arithmetic: Hardware and Software
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
Abstract : 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 should not grow too fast compared to the genus. For such families, the group structure and discrete logarithms can be computed in subexponential time of $L_{q^g}(1/3, O(1))$. The runtime bounds rely on heuristics similar to the ones used in the number field sieve or the function field sieve.
Complete list of metadata
Contributor : Andreas Enge <>
Submitted on : Sunday, December 20, 2009 - 12:24:14 PM
Last modification on : Wednesday, October 14, 2020 - 3:54:03 PM
Long-term archiving on: : Thursday, September 23, 2010 - 10:58:09 AM


Files produced by the author(s)




Andreas Enge, Pierrick Gaudry, Emmanuel Thomé. An $L (1/3)$ Discrete Logarithm Algorithm for Low Degree Curves. Journal of Cryptology, Springer Verlag, 2011, 24, pp.24-41. ⟨10.1007/s00145-010-9057-y⟩. ⟨inria-00383941v2⟩



Record views


Files downloads