On the computation of a 30750-bit binary field discrete logarithm

Add to your list(s) Download to your calendar using vCal

• Rob Granger (University of Surrey)
• Thursday 31 October 2019, 11:00-12:00
• Computer Science, The Sloman Lounge (UG).

If you have a question about this talk, please contact Isra Ahmed.

In this talk I will present some of the ideas behind, motivation for and details of the computation of a discrete logarithm in the finite field of 2^{30750 elements, which has broken by a large margin the previous record, set in January 2014 in the field of 2}9234 elements. The computation made essential use of the elimination step of the quasi-polynomial algorithm due to Granger, Kleinjung and Zumbragel, and is the first large-scale experiment to test its potential. If time permits I will also explain why a polynomial time algorithm should not be discounted and some recent important theoretical work in this area.

This is joint work with Thorsten Kleinjung, Arjen K. Lenstra, Benjamin Wesolowski and Jens Zumbragel.

This talk is part of the Computer Security Seminars series.

This talk is included in these lists:

• Computer Science Departmental Series
• Computer Science Distinguished Seminars
• Computer Science, The Sloman Lounge (UG)
• Computer Security Seminars
• computer sience

Note that ex-directory lists are not shown.