Robert Granger

activity

20112023

most citedOn the discrete logarithm problem in finite fields of fixed characteristic

36 citations · 67 across the 8 of their papers we have counts for

collaborators

Showing 2016Show all

3 papers · 1 filter

math.AG2016

On the Enumeration of Irreducible Polynomials over $GF (q)$ with Prescribed Coefficients

Robert Granger

We present an efficient deterministic algorithm which outputs exact expressions in terms of $n$ for the number of monic degree $n$ irreducible polynomials over $F_{q}$ of…

math.NT2016

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 $n \geq 3, r \geq 1$ we present formulae for the number of irreducible polynomials of degree $n$ over the finite field $F_{2^{r}}$ where the coeffici…

math.NT2016★ 7 cited

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 Enumeration of Irreducible Polynomials over GF(q) with Prescribed Coefficients

Fibre Products of Supersingular Curves and the Enumeration of Irreducible Polynomials with Prescribed Coefficients

Indiscreet logarithms in finite fields of small characteristic

On the Enumeration of Irreducible Polynomials over $GF (q)$ with Prescribed Coefficients