Discrete logarithm in GF(2^809) with FFS - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2013

Discrete logarithm in GF(2^809) with FFS

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.
Fichier principal
Vignette du fichier
ffs809.pdf (500.05 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)

Identifiers

  • HAL Id : hal-00818124 , version 2

Cite

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⟩
965 View
715 Download

Share

Gmail Mastodon Facebook X LinkedIn More