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.
Type de document :
Communication dans un congrès
C. Boyd and E. Dawson. ASIACRYPT 2001, Dec 2001, Gold Coast, Queensland, Australia. Springer--Verlag, 2248, pp.107-124, 2001, Lecture Notes in Computer Science. 〈10.1007/3-540-45682-1_7〉
Liste complète des métadonnées

Littérature citée [39 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00107488
Contributeur : Emmanuel Thomé <>
Soumis le : mercredi 18 octobre 2006 - 19:33:22
Dernière modification le : jeudi 10 mai 2018 - 02:06:52
Document(s) archivé(s) le : mardi 6 avril 2010 - 20:07:55

Fichier

Identifiants

Collections

Citation

Emmanuel Thomé. Computation of Discrete Logarithms in GF(2^607). C. Boyd and E. Dawson. ASIACRYPT 2001, Dec 2001, Gold Coast, Queensland, Australia. Springer--Verlag, 2248, pp.107-124, 2001, Lecture Notes in Computer Science. 〈10.1007/3-540-45682-1_7〉. 〈inria-00107488〉

Partager

Métriques

Consultations de la notice

260

Téléchargements de fichiers

201