International Association for Cryptologic Research

International Association
for Cryptologic Research

IACR News item: 27 May 2013

Faruk G\\\"olo\\u{g}lu, Robert Granger, Gary McGuire, Jens Zumbr\\\"agel
ePrint Report ePrint Report
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.

Expand

Additional news items may be found on the IACR news page.