36 citations · 67 across the 8 of their papers we have counts for
8 papers · 1 filter
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…
Fibre Products of Supersingular Curves and the Enumeration of Irreducible Polynomials with Prescribed Coefficients
Omran Ahmadi, Faruk Gologlu, Robert Granger +2
For any positive integers we present formulae for the number of irreducible polynomials of degree over the finite field where the coeffici…
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…
Generalised Mersenne Numbers Revisited
Robert Granger, Andrew Moss
Generalised Mersenne Numbers (GMNs) were defined by Solinas in 1999 and feature in the NIST (FIPS 186-2) and SECG standards for use in elliptic curve cryptography. Their form is su…