An $L (1/3 + \varepsilon)$ Algorithm for the Discrete Logarithm Problem for Low Degree Curves

Andreas Enge 1 Pierrick Gaudry 2
1 TANC - Algorithmic number theory for cryptology
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France, Polytechnique - X, CNRS - Centre National de la Recherche Scientifique : UMR7161
2 CACAO - Curves, Algebra, Computer Arithmetic, and so On
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : 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 degrees in $X$ and $Y$ are low with respect to the curve genus, and suitably unbalanced. The finite base fields are arbitrary, but their sizes should not grow too fast compared to the genus. For this family, the group structure can be computed in subexponential time of $L_{q^g}(1/3, O(1))$, and a discrete logarithm computation takes subexponential time of $L_{q^g}(1/3+\varepsilon, o(1))$ for any positive~$\varepsilon$. These runtime bounds rely on heuristics similar to the ones used in the number field sieve or the function field sieve algorithms.
Type de document :
Communication dans un congrès
Moni Naor. Eurocrypt 2007, May 2007, Barcelona, Spain. Springer, 4515, pp.379-393, 2007, Lecture Notes in Computer Science
Liste complète des métadonnées

Littérature citée [16 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00135324
Contributeur : Andreas Enge <>
Soumis le : mercredi 7 mars 2007 - 13:46:50
Dernière modification le : jeudi 11 janvier 2018 - 06:22:14
Document(s) archivé(s) le : mardi 6 avril 2010 - 23:18:37

Fichiers

l13.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Andreas Enge, Pierrick Gaudry. An $L (1/3 + \varepsilon)$ Algorithm for the Discrete Logarithm Problem for Low Degree Curves. Moni Naor. Eurocrypt 2007, May 2007, Barcelona, Spain. Springer, 4515, pp.379-393, 2007, Lecture Notes in Computer Science. 〈inria-00135324〉

Partager

Métriques

Consultations de la notice

485

Téléchargements de fichiers

188