You are looking at a specific version 20131105:211433 of this paper. See the latest version.

Paper 2013/197

Discrete logarithm in GF(2^809) with FFS

Razvan Barbulescu and Cyril Bouvier and Jérémie Detrey and Pierrick Gaudry and Hamza Jeljeli and Emmanuel Thomé and Marion Videau and Paul Zimmermann

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.

Note: Version expanded from preliminary announcement draft.

Metadata
Available format(s)
PDF
Category
Public-key cryptography
Publication info
Published elsewhere. Unknown status
Keywords
discrete logarithm problemnumber field sievefunction field sieve
Contact author(s)
Emmanuel Thome @ gmail com
History
2013-11-05: last of 2 revisions
2013-04-09: received
See all versions
Short URL
https://ia.cr/2013/197
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.