Cryptology ePrint Archive: Report 2013/306

Solving a $6120$-bit DLP on a Desktop Computer

Faruk Göloğlu and Robert Granger and Gary McGuire and Jens Zumbrägel

Abstract: In this paper we show how some recent ideas regarding the discrete logarithm problem (DLP) in finite fields of small characteristic may be applied to compute logarithms in some very large fields extremely efficiently. In particular, we demonstrate a practical DLP break in the finite field of $2^{6120}$ elements, using just a single core-month.

Category / Keywords: public-key cryptography / Discrete logarithm problem, binary finite fields

Publication Info: Submitted for peer review on 17 May 2013

Date: received 21 May 2013, last revised 22 May 2013

Contact author: robbiegranger at gmail com

Available format(s): PDF | BibTeX Citation

Note: In the context of our earlier announcement of the solving of discrete logarithms in GF(2^6120) and Joux's announcement of the solving of discrete logarithms in GF(2^6168) - both on the NMBRTHRY list - we have decided to upload this manuscript in order to aid a comparison of the methods.

Version: 20130525:135547 (All versions of this report)

Short URL: ia.cr/2013/306

Discussion forum: Show discussion | Start new discussion