3 papers
math.NT2020
Computation of a 30750-Bit Binary Field Discrete Logarithm
Robert Granger, Thorsten Kleinjung, Arjen K. Lenstra +2
This paper reports on the computation of a discrete logarithm in the finite field , breaking by a large margin the previous record, which was set in January…
math.NT2019
Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic
Thorsten Kleinjung, Benjamin Wesolowski
We prove that the discrete logarithm problem can be solved in quasi-polynomial expected time in the multiplicative group of finite fields of fixed characteristic. More generally, w…
math.NT2018
A new perspective on the powers of two descent for discrete logarithms in finite fields
Thorsten Kleinjung, Benjamin Wesolowski
A new proof is given for the correctness of the powers of two descent method for computing discrete logarithms. The result is slightly stronger than the original work, but more imp…