36 citations · 67 across the 8 of their papers we have counts for
10 papers
Three Proofs of an Observation on Irreducible Polynomials over
Robert Granger
We present three proofs of an observation of Ahmadi on the number of irreducible polynomials over with certain traces and cotraces, the most interesting of which use…
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…
On the Enumeration of Irreducible Polynomials over with Prescribed Coefficients
Robert Granger
We present an efficient deterministic algorithm which outputs exact expressions in terms of for the number of monic degree irreducible polynomials over of…
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…