Skip to Main content Skip to Navigation
New interface
Conference papers

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.
Document type :
Conference papers
Complete list of metadata

Cited literature [39 references]  Display  Hide  Download
Contributor : Emmanuel Thomé Connect in order to contact the contributor
Submitted on : Wednesday, October 18, 2006 - 7:33:22 PM
Last modification on : Tuesday, January 5, 2021 - 4:57:41 PM
Long-term archiving on: : Tuesday, April 6, 2010 - 8:07:55 PM




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⟩



Record views


Files downloads