# Discrete logarithm in GF($2^{809}$) with FFS

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.

Cited literature [25 references]

https://hal.inria.fr/hal-00818124
Contributor : Pierrick Gaudry <>
Submitted on : Saturday, November 9, 2013 - 11:43:23 AM
Last modification on : Thursday, March 5, 2020 - 4:49:07 PM
Document(s) archivé(s) le : Friday, April 7, 2017 - 11:08:19 PM

### File

ffs809.pdf
Files produced by the author(s)

### Citation

Razvan Barbulescu, Cyril Bouvier, Jérémie Detrey, Pierrick Gaudry, Hamza Jeljeli, et al.. Discrete logarithm in GF($2^{809}$) with FFS. PKC 2014 - International Conference on Practice and Theory of Public-Key Cryptography, 2014, Buenos Aires, Argentina. ⟨10.1007/978-3-642-54631-0_13⟩. ⟨hal-00818124v3⟩

Record views