EDBT 2026 Demo / reviewers in the wild / expert
Robert Granger
dblp:76/4468
· DBLP profile ↗
11ranked-venue papers
7as first author
0since 2021 · last 2020
0000-0002-7731-0758ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 10 · 6 first-authorSystems, architecture and hardware · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Network and information security
8 papers |
Cryptographic primitives and cryptanalysis · 96% Hardware security and side channels · 4% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Hardware accelerators and domain-specific architectures · 100% |
Topics — the 16 heaviest of 17, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Cryptographic primitives and cryptanalysis
block cipher |
0.2 | 1 | 2016 | Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption · EUROCRYPT (1) 2016 |
Cryptographic primitives and cryptanalysis › block cipher
tweakable block cipher |
0.2 | 1 | 2016 | Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption · EUROCRYPT (1) 2016 |
Cryptographic primitives and cryptanalysis
discrete logarithm problem |
0.2 | 2 | 2014 | Breaking '128-bit Secure' Supersingular Binary Curves - (Or How to Solve Discrete Logarithms in F24 1223 and F212 367) · CRYPTO (2) 2014 On the Discrete Logarithm Problem on Algebraic Tori · CRYPTO 2005 |
Cryptographic primitives and cryptanalysis
discrete logarithm |
0.2 | 1 | 2013 | On the Function Field Sieve and the Impact of Higher Splitting Probabilities - Application to Discrete Logarithms in and · CRYPTO (2) 2013 |
Cryptographic primitives and cryptanalysis › discrete logarithm
function field sieve |
0.2 | 1 | 2013 | On the Function Field Sieve and the Impact of Higher Splitting Probabilities - Application to Discrete Logarithms in and · CRYPTO (2) 2013 |
Cryptographic primitives and cryptanalysis
pairing-based cryptography |
0.1 | 2 | 2007 | Ate Pairing on Hyperelliptic Curves · EUROCRYPT 2007 Hardware and Software Normal Basis Arithmetic for Pairing-Based Cryptography in Characteristic Three · IEEE Trans. Computers 2005 |
Cryptographic primitives and cryptanalysis › cryptographic assumptions
diffie-hellman problem |
0.1 | 1 | 2010 | On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields · ASIACRYPT 2010 |
Cryptographic primitives and cryptanalysis
authenticated encryption |
0.1 | 1 | 2016 | Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption · EUROCRYPT (1) 2016 |
Hardware security and side channels › side-channel countermeasures
masking |
0.1 | 1 | 2016 | Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption · EUROCRYPT (1) 2016 |
Cryptographic primitives and cryptanalysis › pairing-based cryptography
ate pairing |
0.1 | 1 | 2007 | Ate Pairing on Hyperelliptic Curves · EUROCRYPT 2007 |
Cryptographic primitives and cryptanalysis
finite field arithmetic |
0.1 | 1 | 2005 | Hardware and Software Normal Basis Arithmetic for Pairing-Based Cryptography in Characteristic Three · IEEE Trans. Computers 2005 |
Cryptographic primitives and cryptanalysis
public-key cryptography |
0.1 | 1 | 2005 | Practical Cryptography in High Dimensional Tori · EUROCRYPT 2005 |
Cryptographic primitives and cryptanalysis › pairing-based cryptography
tate pairing |
0.1 | 1 | 2005 | Hardware and Software Normal Basis Arithmetic for Pairing-Based Cryptography in Characteristic Three · IEEE Trans. Computers 2005 |
Cryptographic primitives and cryptanalysis › public-key cryptography
elliptic curve cryptography |
0.1 | 2 | 2010 | On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields · ASIACRYPT 2010 Ate Pairing on Hyperelliptic Curves · EUROCRYPT 2007 |
Cryptographic primitives and cryptanalysis › public-key cryptography › elliptic curve cryptography
hyperelliptic curve |
0.0 | 1 | 2007 | Ate Pairing on Hyperelliptic Curves · EUROCRYPT 2007 |
Hardware accelerators and domain-specific architectures
cryptographic accelerator |
0.0 | 1 | 2005 | Hardware and Software Normal Basis Arithmetic for Pairing-Based Cryptography in Characteristic Three · IEEE Trans. Computers 2005 |
Methods — techniques the papers use, named apart from their topics
duursma-lee algorithm · 0.1high-dimensional tori · 0.1algebraic geometry · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2020 | On Index Calculus Algorithms for Subfield Curves
Steven D. Galbraith, Robert Granger, Simon-Philipp Merz, Christophe Petit 0001 |
SAC | 2 |
| 2016 | Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption
Robert Granger, Philipp Jovanovic, Bart Mennink, Samuel Neves |
EUROCRYPT (1) | 1 |
| 2014 | Breaking '128-bit Secure' Supersingular Binary Curves - (Or How to Solve Discrete Logarithms in F24 1223 and F212 367)
Robert Granger, Thorsten Kleinjung, Jens Zumbrägel |
CRYPTO (2) | 1 |
| 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 |
CRYPTO (2) | 2 |
| 2013 | Solving a 6120 -bit DLP on a Desktop Computer
Faruk Göloglu, Robert Granger, Gary McGuire, Jens Zumbrägel |
Selected Areas in Cryptography | 2 |
| 2010 | On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields
Robert Granger |
ASIACRYPT | 1 |
| 2007 | Ate Pairing on Hyperelliptic Curves
Robert Granger, Florian Hess, Roger Oyono, Nicolas Thériault, Frederik Vercauteren |
EUROCRYPT | 1 |
| 2005 | On the Discrete Logarithm Problem on Algebraic Tori
Robert Granger, Frederik Vercauteren |
CRYPTO | 1 |
| 2005 | Practical Cryptography in High Dimensional Tori
Marten van Dijk, Robert Granger, Dan Page, Karl Rubin, Alice Silverberg, Martijn Stam, David P. Woodruff |
EUROCRYPT | 2 |
| 2005 | Hardware and Software Normal Basis Arithmetic for Pairing-Based Cryptography in Characteristic ThreeabstractAlthough identity-based cryptography offers a number of functional advantages over conventional public key methods, the computational costs are significantly greater. The dominant part of this cost is the Tate pairing, which, in characteristic three, is best computed using the algorithm of Duursma and Lee. However, in hardware and constrained environments, this algorithm is unattractive since it requires online computation of cube roots or enough storage space to precompute required results. We examine the use of normal basis arithmetic in characteristic three in an attempt to get the best of both worlds: an efficient method for computing the Tate pairing that requires no precomputation and that may also be implemented in hardware to accelerate devices such as smart-cards. Robert Granger, Dan Page, Martijn Stam |
IEEE Trans. Computers | 1 |
| 2003 | Estimates for Discrete Logarithm Computations in Finite Fields of Small Characteristic
Robert Granger |
IMACC | 1 |