A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2013

A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic

Résumé

In the present work, we present a new discrete logarithm algorithm, in the same vein as in recent works by Joux, using an asymptotically more efficient descent approach. The main result gives a quasi-polynomial heuristic complexity for the discrete logarithm problem in finite field of small characteristic. By quasi-polynomial, we mean a complexity of type $n^{O(\log n)}$ where $n$ is the bit-size of the cardinality of the finite field. Such a complexity is smaller than any $L(\varepsilon)$ for $\epsilon>0$. It remains super-polynomial in the size of the input, but offers a major asymptotic improvement compared to $L(1/4+o(1))$.
Fichier principal
Vignette du fichier
quasi.pdf (144.47 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00835446 , version 1 (18-06-2013)
hal-00835446 , version 2 (25-11-2013)

Identifiants

Citer

Razvan Barbulescu, Pierrick Gaudry, Antoine Joux, Emmanuel Thomé. A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic. 2013. ⟨hal-00835446v1⟩

Collections

UVSQ
5338 Consultations
2759 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More