Discrete logarithm in GF($2^{809}$) with FFS - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2014

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

Résumé

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
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

Citer

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⟩
942 Consultations
686 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More