Discrete logarithm in GF($2^{809}$) with FFS - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

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


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.
Fichier principal
Vignette du fichier
ffs809.pdf (497.81 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00818124 , version 1 (26-04-2013)
hal-00818124 , version 2 (05-11-2013)
hal-00818124 , version 3 (09-11-2013)



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



Gmail Facebook X LinkedIn More