Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Discrete logarithm in GF(2^809) with FFS

Razvan Barbulescu 1 Cyril Bouvier 1 Jérémie Detrey 1 Pierrick Gaudry 1 Hamza Jeljeli 1 Emmanuel Thomé 1 Marion Videau 1 Paul Zimmermann 1
1 CARAMEL - Cryptology, Arithmetic: Hardware and Software
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
Abstract : The year 2013 has seen several major complexity advances for the discrete logarithm problem in multiplicative groups of small- characteristic finite fields. These outmatch, asymptotically, the Function Field Sieve (FFS) approach, which was so far the most efficient algorithm known for this task. Yet, on the practical side, it is not clear whether the new algorithms are uniformly better than FFS. This article presents the state of the art with regard to the FFS algorithm, and reports data from a record-sized discrete logarithm computation in a prime-degree extension field.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

https://hal.inria.fr/hal-00818124
Contributor : Pierrick Gaudry <>
Submitted on : Tuesday, November 5, 2013 - 4:43:17 PM
Last modification on : Friday, October 16, 2020 - 4:02:04 PM
Long-term archiving on: : Friday, April 7, 2017 - 9:48:36 PM

File

ffs809.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00818124, version 2

Citation

Razvan Barbulescu, Cyril Bouvier, Jérémie Detrey, Pierrick Gaudry, Hamza Jeljeli, et al.. Discrete logarithm in GF(2^809) with FFS. 2013. ⟨hal-00818124v2⟩

Share

Metrics

Record views

27

Files downloads

52