Robert Granger

According to our database, Robert Granger authored at least 33 papers between 2003 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Three proofs of an observation on irreducible polynomials over GF(2).

Robert Granger

Finite Fields Their Appl., June, 2023

2021

Computation of a 30750-bit binary field discrete logarithm.

Robert Granger, Thorsten Kleinjung, Arjen K. Lenstra, Benjamin Wesolowski, Jens Zumbrägel

Math. Comput., 2021

Computing Discrete Logarithms.

Robert Granger, Antoine Joux

IACR Cryptol. ePrint Arch., 2021

2020

On Index Calculus Algorithms for Subfield Curves.

Steven D. Galbraith, Robert Granger, Simon-Philipp Merz, Christophe Petit

IACR Cryptol. ePrint Arch., 2020

2019

On the enumeration of irreducible polynomials over GF(<i>q</i>) with prescribed coefficients.

Robert Granger

Finite Fields Their Appl., 2019

2018

Indiscreet logarithms in finite fields of small characteristic.

Robert Granger, Thorsten Kleinjung, Jens Zumbrägel

Adv. Math. Commun., 2018

2016

Fibre products of supersingular curves and the enumeration of irreducible polynomials with prescribed coefficients.

Omran Ahmadi, Faruk Göloglu, Robert Granger, Gary McGuire, Emrah Sercan Yilmaz

Finite Fields Their Appl., 2016

2015

On the discrete logarithm problem in finite fields of fixed characteristic.

Robert Granger, Thorsten Kleinjung, Jens Zumbrägel

IACR Cryptol. ePrint Arch., 2015

Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption.

Robert Granger, Philipp Jovanovic, Bart Mennink, Samuel Neves

IACR Cryptol. ePrint Arch., 2015

Faster ECC over \mathbb F_2^521-1.

Robert Granger, Michael Scott

Proceedings of the Public-Key Cryptography - PKC 2015 - 18th IACR International Conference on Practice and Theory in Public-Key Cryptography, Gaithersburg, MD, USA, March 30, 2015

2014

An efficient deterministic test for Kloosterman sum zeros.

Omran Ahmadi, Robert Granger

Math. Comput., 2014

Faster ECC over 픽_2⁵²¹-1.

Robert Granger, Michael Scott

IACR Cryptol. ePrint Arch., 2014

On the Powers of 2.

Robert Granger, Thorsten Kleinjung, Jens Zumbrägel

IACR Cryptol. ePrint Arch., 2014

Breaking '128-bit Secure' Supersingular Binary Curves (or how to solve discrete logarithms in 𝔽_2^4·1223 and 𝔽_2^12·367).

Robert Granger, Thorsten Kleinjung, Jens Zumbrägel

IACR Cryptol. ePrint Arch., 2014

2013

Generalised Mersenne numbers revisited.

Robert Granger, Andrew Moss

Math. Comput., 2013

Solving a 6120-bit DLP on a Desktop Computer.

Faruk Göloglu, Robert Granger, Gary McGuire, Jens Zumbrägel

IACR Cryptol. ePrint Arch., 2013

On the Function Field Sieve and the Impact of Higher Splitting Probabilities: Application to Discrete Logarithms in F_2¹⁹⁷¹.

Faruk Göloglu, Robert Granger, Gary McGuire, Jens Zumbrägel

IACR Cryptol. ePrint Arch., 2013

On the Function Field Sieve and the Impact of Higher Splitting Probabilities - Application to Discrete Logarithms in and.

Faruk Göloglu, Robert Granger, Gary McGuire, Jens Zumbrägel

Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

2011

On isogeny classes of Edwards curves over finite fields.

Omran Ahmadi, Robert Granger

IACR Cryptol. ePrint Arch., 2011

2010

On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields.

Robert Granger

IACR Cryptol. ePrint Arch., 2010

2009

Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions.

Robert Granger, Michael Scott

IACR Cryptol. ePrint Arch., 2009

Reconfigurable Hardware Implementation of Arithmetic Modulo Minimal Redundancy Cyclotomic Primes for ECC.

Brian Baldwin, William P. Marnane, Robert Granger

Proceedings of the ReConFig'09: 2009 International Conference on Reconfigurable Computing and FPGAs, 2009

2007

Ate Pairing on Hyperelliptic Curves.

Robert Granger, Florian Hess, Roger Oyono, Nicolas Thériault, Frederik Vercauteren

Proceedings of the Advances in Cryptology, 2007

2006

On Small Characteristic Algebraic Tori in Pairing-Based Cryptography.

Robert Granger, Dan Page, Martijn Stam

LMS J. Comput. Math., 2006

On Computing Products of Pairings.

Robert Granger, Nigel P. Smart

IACR Cryptol. ePrint Arch., 2006

High Security Pairing-Based Cryptography Revisited.

Robert Granger, Dan Page, Nigel P. Smart

IACR Cryptol. ePrint Arch., 2006

2005

On small degree extension fields in cryptology.

Robert Granger

PhD thesis, 2005

Hardware and Software Normal Basis Arithmetic for Pairing-Based Cryptography in Characteristic Three.

Robert Granger, Dan Page, Martijn Stam

IEEE Trans. Computers, 2005

On the Discrete Logarithm Problem on Algebraic Tori.

Robert Granger, Frederik Vercauteren

Proceedings of the Advances in Cryptology, 2005

2004

Practical Cryptography in High Dimensional Tori.

Marten van Dijk, Robert Granger, Dan Page, Karl Rubin, Alice Silverberg, Martijn Stam, David P. Woodruff

IACR Cryptol. ePrint Arch., 2004

A Comparison of CEILIDH and XTR.

Robert Granger, Dan Page, Martijn Stam

Proceedings of the Algorithmic Number Theory, 6th International Symposium, 2004

Function Field Sieve in Characteristic Three.

Robert Granger, Andrew J. Holt, Dan Page, Nigel P. Smart, Frederik Vercauteren

Proceedings of the Algorithmic Number Theory, 6th International Symposium, 2004

2003

Estimates for Discrete Logarithm Computations in Finite Fields of Small Characteristic.

Robert Granger

Proceedings of the Cryptography and Coding, 2003