Computation of Discrete Logarithms in GF(2^607) - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2001

Computation of Discrete Logarithms in GF(2^607)

Abstract

We describe in this article how we have been able to extend the record for computations of discrete logarithms in characteristic 2 from the previous record over GF(2^503) to a newer mark of GF(2^607), using Coppersmith's algorithm. This has been made possible by several practical improvements to the algorithm. Although the computations have been carried out on fairly standard hardware, our opinion is that we are nearing the current limits of the manageable sizes for this algorithm, and that going substantially further will require deeper improvements to the method.
Fichier principal
Vignette du fichier
dlrecord.pdf (196.41 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00107488 , version 1 (18-10-2006)

Identifiers

Cite

Emmanuel Thomé. Computation of Discrete Logarithms in GF(2^607). Advances in Cryptology -- ASIACRYPT 2001, International Association for Cryptologic Research, Dec 2001, Gold Coast, Queensland, Australia. pp.107-124, ⟨10.1007/3-540-45682-1_7⟩. ⟨inria-00107488⟩
298 View
334 Download

Altmetric

Share

Gmail Facebook X LinkedIn More