Cryptology ePrint Archive: Report 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.

Category / Keywords: public-key cryptography / discrete logarithm problem, number field sieve, function field sieve

Date: received 6 Apr 2013, last revised 5 Nov 2013

Contact author: Emmanuel Thome at gmail com

Available format(s): PDF | BibTeX Citation

Note: Version expanded from preliminary announcement draft.

Version: 20131105:211433 (All versions of this report)

Short URL: ia.cr/2013/197