default search action
Robert Granger
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j9]Robert Granger:
Three proofs of an observation on irreducible polynomials over GF(2). Finite Fields Their Appl. 88: 102192 (2023) - 2021
- [j8]Robert Granger, Thorsten Kleinjung, Arjen K. Lenstra, Benjamin Wesolowski, Jens Zumbrägel:
Computation of a 30750-bit binary field discrete logarithm. Math. Comput. 90(332): 2997-3022 (2021) - [i24]Robert Granger, Antoine Joux:
Computing Discrete Logarithms. IACR Cryptol. ePrint Arch. 2021: 1140 (2021) - 2020
- [c16]Steven D. Galbraith, Robert Granger, Simon-Philipp Merz, Christophe Petit:
On Index Calculus Algorithms for Subfield Curves. SAC 2020: 115-138 - [i23]Robert Granger, Thorsten Kleinjung, Arjen K. Lenstra, Benjamin Wesolowski, Jens Zumbrägel:
Computation of a 30750-Bit Binary Field Discrete Logarithm. IACR Cryptol. ePrint Arch. 2020: 965 (2020) - [i22]Steven D. Galbraith, Robert Granger, Simon-Philipp Merz, Christophe Petit:
On Index Calculus Algorithms for Subfield Curves. IACR Cryptol. ePrint Arch. 2020: 1315 (2020)
2010 – 2019
- 2019
- [j7]Robert Granger:
On the enumeration of irreducible polynomials over GF(q) with prescribed coefficients. Finite Fields Their Appl. 57: 156-229 (2019) - 2018
- [j6]Robert Granger, Thorsten Kleinjung, Jens Zumbrägel:
Indiscreet logarithms in finite fields of small characteristic. Adv. Math. Commun. 12(2): 263-286 (2018) - 2016
- [j5]Omran Ahmadi, Faruk Göloglu, Robert Granger, Gary McGuire, Emrah Sercan Yilmaz:
Fibre products of supersingular curves and the enumeration of irreducible polynomials with prescribed coefficients. Finite Fields Their Appl. 42: 128-164 (2016) - [c15]Robert Granger, Philipp Jovanovic, Bart Mennink, Samuel Neves:
Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption. EUROCRYPT (1) 2016: 263-293 - 2015
- [c14]Robert Granger, Michael Scott:
Faster ECC over \mathbb F_2^521-1. Public Key Cryptography 2015: 539-553 - [i21]Robert Granger, Thorsten Kleinjung, Jens Zumbrägel:
On the discrete logarithm problem in finite fields of fixed characteristic. IACR Cryptol. ePrint Arch. 2015: 685 (2015) - [i20]Robert Granger, Philipp Jovanovic, Bart Mennink, Samuel Neves:
Improved Masking for Tweakable Blockciphers with Applications to Authenticated Encryption. IACR Cryptol. ePrint Arch. 2015: 999 (2015) - 2014
- [j4]Omran Ahmadi, Robert Granger:
An efficient deterministic test for Kloosterman sum zeros. Math. Comput. 83(285): 347-363 (2014) - [c13]Robert Granger, Thorsten Kleinjung, Jens Zumbrägel:
Breaking '128-bit Secure' Supersingular Binary Curves - (Or How to Solve Discrete Logarithms in F24 1223 and F212 367). CRYPTO (2) 2014: 126-145 - [i19]Robert Granger, Thorsten Kleinjung, Jens Zumbrägel:
Breaking '128-bit Secure' Supersingular Binary Curves (or how to solve discrete logarithms in 𝔽24·1223 and 𝔽212·367). CoRR abs/1402.3668 (2014) - [i18]Robert Granger, Thorsten Kleinjung, Jens Zumbrägel:
Breaking '128-bit Secure' Supersingular Binary Curves (or how to solve discrete logarithms in 𝔽24·1223 and 𝔽212·367). IACR Cryptol. ePrint Arch. 2014: 119 (2014) - [i17]Robert Granger, Thorsten Kleinjung, Jens Zumbrägel:
On the Powers of 2. IACR Cryptol. ePrint Arch. 2014: 300 (2014) - [i16]Robert Granger, Michael Scott:
Faster ECC over 픽2521-1. IACR Cryptol. ePrint Arch. 2014: 852 (2014) - 2013
- [j3]Robert Granger, Andrew Moss:
Generalised Mersenne numbers revisited. Math. Comput. 82(284): 2389-2420 (2013) - [c12]Faruk Göloglu, Robert Granger, Gary McGuire, Jens Zumbrägel:
On the Function Field Sieve and the Impact of Higher Splitting Probabilities - Application to Discrete Logarithms in and. CRYPTO (2) 2013: 109-128 - [c11]Faruk Göloglu, Robert Granger, Gary McGuire, Jens Zumbrägel:
Solving a 6120 -bit DLP on a Desktop Computer. Selected Areas in Cryptography 2013: 136-152 - [i15]Faruk Göloglu, Robert Granger, Gary McGuire, Jens Zumbrägel:
On the Function Field Sieve and the Impact of Higher Splitting Probabilities: Application to Discrete Logarithms in F21971. IACR Cryptol. ePrint Arch. 2013: 74 (2013) - [i14]Faruk Göloglu, Robert Granger, Gary McGuire, Jens Zumbrägel:
Solving a 6120-bit DLP on a Desktop Computer. IACR Cryptol. ePrint Arch. 2013: 306 (2013) - 2011
- [i13]Omran Ahmadi, Robert Granger:
On isogeny classes of Edwards curves over finite fields. CoRR abs/1103.3381 (2011) - [i12]Omran Ahmadi, Robert Granger:
An efficient deterministic test for Kloosterman sum zeros. CoRR abs/1104.3882 (2011) - [i11]Robert Granger, Andrew Moss:
Generalised Mersenne Numbers Revisited. CoRR abs/1108.3054 (2011) - [i10]Omran Ahmadi, Robert Granger:
On isogeny classes of Edwards curves over finite fields. IACR Cryptol. ePrint Arch. 2011: 135 (2011) - [i9]Omran Ahmadi, Robert Granger:
An efficient deterministic test for Kloosterman sum zeros. IACR Cryptol. ePrint Arch. 2011: 199 (2011) - [i8]Robert Granger, Andrew Moss:
Generalised Mersenne Numbers Revisited. IACR Cryptol. ePrint Arch. 2011: 444 (2011) - 2010
- [c10]Robert Granger:
On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields. ASIACRYPT 2010: 283-302 - [c9]Robert Granger, Michael Scott:
Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions. Public Key Cryptography 2010: 209-223 - [i7]Robert Granger:
On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields. IACR Cryptol. ePrint Arch. 2010: 177 (2010)
2000 – 2009
- 2009
- [c8]Brian Baldwin, William P. Marnane, Robert Granger:
Reconfigurable Hardware Implementation of Arithmetic Modulo Minimal Redundancy Cyclotomic Primes for ECC. ReConFig 2009: 255-260 - [i6]Robert Granger, Michael Scott:
Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions. IACR Cryptol. ePrint Arch. 2009: 565 (2009) - 2007
- [c7]Robert Granger, Florian Hess, Roger Oyono, Nicolas Thériault, Frederik Vercauteren:
Ate Pairing on Hyperelliptic Curves. EUROCRYPT 2007: 430-447 - 2006
- [j2]Robert Granger, Dan Page, Martijn Stam:
On Small Characteristic Algebraic Tori in Pairing-Based Cryptography. LMS J. Comput. Math. 9: 64-85 (2006) - [c6]Robert Granger, Dan Page, Nigel P. Smart:
High Security Pairing-Based Cryptography Revisited. ANTS 2006: 480-494 - [i5]Robert Granger, Dan Page, Nigel P. Smart:
High Security Pairing-Based Cryptography Revisited. IACR Cryptol. ePrint Arch. 2006: 59 (2006) - [i4]Robert Granger, Nigel P. Smart:
On Computing Products of Pairings. IACR Cryptol. ePrint Arch. 2006: 172 (2006) - 2005
- [b1]Robert Granger:
On small degree extension fields in cryptology. University of Bristol, UK, 2005 - [j1]Robert Granger, Dan Page, Martijn Stam:
Hardware and Software Normal Basis Arithmetic for Pairing-Based Cryptography in Characteristic Three. IEEE Trans. Computers 54(7): 852-860 (2005) - [c5]Robert Granger, Frederik Vercauteren:
On the Discrete Logarithm Problem on Algebraic Tori. CRYPTO 2005: 66-85 - [c4]Marten van Dijk, Robert Granger, Dan Page, Karl Rubin, Alice Silverberg, Martijn Stam, David P. Woodruff:
Practical Cryptography in High Dimensional Tori. EUROCRYPT 2005: 234-250 - 2004
- [c3]Robert Granger, Andrew J. Holt, Dan Page, Nigel P. Smart, Frederik Vercauteren:
Function Field Sieve in Characteristic Three. ANTS 2004: 223-234 - [c2]Robert Granger, Dan Page, Martijn Stam:
A Comparison of CEILIDH and XTR. ANTS 2004: 235-249 - [i3]Robert Granger, Dan Page, Martijn Stam:
On Small Characteristic Algebraic Tori in Pairing-Based Cryptography. IACR Cryptol. ePrint Arch. 2004: 132 (2004) - [i2]Robert Granger, Dan Page, Martijn Stam:
Hardware and Software Normal Basis Arithmetic for Pairing Based Cryptography in Characteristic Three. IACR Cryptol. ePrint Arch. 2004: 157 (2004) - [i1]Marten van Dijk, Robert Granger, Dan Page, Karl Rubin, Alice Silverberg, Martijn Stam, David P. Woodruff:
Practical Cryptography in High Dimensional Tori. IACR Cryptol. ePrint Arch. 2004: 352 (2004) - 2003
- [c1]Robert Granger:
Estimates for Discrete Logarithm Computations in Finite Fields of Small Characteristic. IMACC 2003: 190-206
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint