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

Razvan Barbulescu 1 Pierrick Gaudry 1 Antoine Joux 2, 3 Emmanuel Thomé 1
1 CARAMEL - Cryptology, Arithmetic: Hardware and Software
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
2 Chaire de cryptologie
UPMC - Université Pierre et Marie Curie - Paris 6
3 CryptoExperts
Abstract : 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))$.
Document type :
Conference papers
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download
https://hal.inria.fr/hal-00835446
Contributor : Emmanuel Thomé <>
Submitted on : Monday, November 25, 2013 - 9:36:59 PM
Last modification on : Tuesday, May 14, 2019 - 10:14:51 AM
Long-term archiving on: Wednesday, February 26, 2014 - 8:35:09 AM

Files

article.pdf
Files produced by the author(s)

Identifiers

Collections

CNRS | INRIA | INSMI | UPMC | UNIV-LORRAINE | LORIA-ALGO | LORIA | SORBONNE-UNIVERSITE | SU-SCIENCES

Citation

Razvan Barbulescu, Pierrick Gaudry, Antoine Joux, Emmanuel Thomé. A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic. Eurocrypt 2014, May 2014, Copenhagen, Denmark. pp.1-16, ⟨10.1007/978-3-642-55220-5_1⟩. ⟨hal-00835446v2⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

5001

Files downloads

1901

 

 

Contact

archive-ouverte@inria.fr