36 citations · 60 across the 6 of their papers we have counts for
7 papers
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…
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…
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…
Indiscreet logarithms in finite fields of small characteristic
Robert Granger, Thorsten Kleinjung, Jens Zumbrägel
Recently, several striking advances have taken place regarding the discrete logarithm problem (DLP) in finite fields of small characteristic, despite progress having remained essen…
On the discrete logarithm problem in finite fields of fixed characteristic
Robert Granger, Thorsten Kleinjung, Jens Zumbrägel
For a prime power, the discrete logarithm problem (DLP) in consists in finding, for any and , an integ…
Breaking `128-bit Secure' Supersingular Binary Curves (or how to solve discrete logarithms in and )
Robert Granger, Thorsten Kleinjung, Jens Zumbrägel
In late 2012 and early 2013 the discrete logarithm problem (DLP) in finite fields of small characteristic underwent a dramatic series of breakthroughs, culminating in a heuristic q…
Finding ECM-friendly curves through a study of Galois properties
Razvan Barbulescu, Joppe W. Bos, Cyril Bouvier +2
In this paper we prove some divisibility properties of the cardinality of elliptic curves modulo primes. These proofs explain the good behavior of certain parameters when using Mon…