Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Steven D. Galbraith
2010 – today
- 2013
[j19]Steven D. Galbraith, Anton Stolbunov: Improved algorithm for the isogeny problem for ordinary elliptic curves. Appl. Algebra Eng. Commun. Comput. 24(2): 107-131 (2013)- [j18]Steven D. Galbraith, John M. Pollard, Raminder S. Ruprai: Computing discrete logarithms in an interval. Math. Comput. 82(282) (2013)
- 2012
- [j17]Steven D. Galbraith, Mark Holmes: A non-uniform birthday problem with applications to discrete logarithms. Discrete Applied Mathematics 160(10-11): 1547-1560 (2012)
- [e3]Steven D. Galbraith, Mridul Nandi (Eds.): Progress in Cryptology - INDOCRYPT 2012, 13th International Conference on Cryptology in India, Kolkata, India, December 9-12, 2012. Proceedings. Lecture Notes in Computer Science 7668, Springer 2012, ISBN 978-3-642-34930-0
- [i27]Steven D. Galbraith, Chang-An Zhao: Self-pairings on Hyperelliptic Curves. IACR Cryptology ePrint Archive 2012: 267 (2012)
- 2011
- [j16]Roberto Avanzi, Waldyr D. Benits Junior, Steven D. Galbraith, James F. McKee: On the distribution of the coefficients of normal forms for Frobenius expansions. Des. Codes Cryptography 61(1): 71-89 (2011)
- [j15]Steven D. Galbraith, Xibin Lin, Michael Scott: Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves. J. Cryptology 24(3): 446-469 (2011)
- [i26]Steven D. Galbraith, Anton Stolbunov: Improved Algorithm for the Isogeny Problem for Ordinary Elliptic Curves. CoRR abs/1105.6331 (2011)
- 2010
- [c22]Steven D. Galbraith, Raminder S. Ruprai: Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval. Public Key Cryptography 2010: 368-383
- [i25]Steven D. Galbraith, Raminder S. Ruprai: Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval. IACR Cryptology ePrint Archive 2010: 615 (2010)
- [i24]Steven D. Galbraith, Mark Holmes: A non-uniform birthday problem with applications to discrete logarithms. IACR Cryptology ePrint Archive 2010: 616 (2010)
- [i23]Steven D. Galbraith, John M. Pollard, Raminder S. Ruprai: Computing Discrete Logarithms in an Interval. IACR Cryptology ePrint Archive 2010: 617 (2010)
2000 – 2009
- 2009
- [j14]Steven D. Galbraith, Xibin Lin: Computing pairings using x -coordinates only. Des. Codes Cryptography 50(3): 305-324 (2009)
- [j13]Steven D. Galbraith, Jordi Pujolàs, Christophe Ritzenthaler, Benjamin A. Smith: Distortion maps for supersingular genus two curves. J. Mathematical Cryptology 3(1): 1-18 (2009)
- [c21]Steven D. Galbraith, Xibin Lin, Michael Scott: Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves. EUROCRYPT 2009: 518-535
- [c20]Steven D. Galbraith, Raminder S. Ruprai: An Improvement to the Gaudry-Schost Algorithm for Multidimensional Discrete Logarithm Problems. IMA Int. Conf. 2009: 368-382
- [i22]P. N. J. Eagle, Steven D. Galbraith, John Ong: Point Compression for Koblitz Elliptic Curves. IACR Cryptology ePrint Archive 2009: 86 (2009)
- 2008
- [j12]Steven D. Galbraith, Kenneth G. Paterson, Nigel P. Smart: Pairings for cryptographers. Discrete Applied Mathematics 156(16): 3113-3121 (2008)
- [j11]Steven D. Galbraith, Florian Hess, Frederik Vercauteren: Aspects of Pairing Inversion. IEEE Transactions on Information Theory 54(12): 5719-5728 (2008)
- [c19]Steven D. Galbraith, Michael Harrison, David J. Mireles Morales: Efficient Hyperelliptic Arithmetic Using Balanced Representation for Divisors. ANTS 2008: 342-356
- [c18]Steven D. Galbraith, Michael Scott: Exponentiation in Pairing-Friendly Groups Using Homomorphisms. Pairing 2008: 211-224
- [c17]Steven D. Galbraith, Xibin Lin, David J. Mireles Morales: Pairings on Hyperelliptic Curves with a Real Model. Pairing 2008: 265-281
- [c16]Steven D. Galbraith, Eric R. Verheul: An Analysis of the Vector Decomposition Problem. Public Key Cryptography 2008: 308-327
- [e2]Steven D. Galbraith, Kenneth G. Paterson (Eds.): Pairing-Based Cryptography - Pairing 2008, Second International Conference, Egham, UK, September 1-3, 2008. Proceedings. Lecture Notes in Computer Science 5209, Springer 2008, ISBN 978-3-540-85503-3
- [i21]Steven D. Galbraith, Xibin Lin: Computing Pairings Using x-Coordinates Only. IACR Cryptology ePrint Archive 2008: 19 (2008)
- [i20]Steven D. Galbraith, Michael Scott: Exponentiation in pairing-friendly groups using homomorphisms. IACR Cryptology ePrint Archive 2008: 117 (2008)
- [i19]Steven D. Galbraith, Xibin Lin, Michael Scott: Endomorphisms for faster elliptic curve cryptography on a large class of curves. IACR Cryptology ePrint Archive 2008: 194 (2008)
- [i18]Wouter Castryck, Steven D. Galbraith, Reza Rezaeian Farashahi: Efficient arithmetic on elliptic curves using a mixed Edwards-Montgomery representation. IACR Cryptology ePrint Archive 2008: 218 (2008)
- [i17]Steven D. Galbraith, Xibin Lin, David J. Mireles Morales: Pairings on hyperelliptic curves with a real model. IACR Cryptology ePrint Archive 2008: 250 (2008)
- [i16]Steven D. Galbraith, Michael Harrison, David J. Mireles Morales: Efficient Hyperelliptic Arithmetic using Balanced Representation for Divisors. IACR Cryptology ePrint Archive 2008: 265 (2008)
- 2007
- [j10]Paulo S. L. M. Barreto, Steven D. Galbraith, Colm O'Eigeartaigh, Michael Scott: Efficient pairing computation on supersingular Abelian varieties. Des. Codes Cryptography 42(3): 239-271 (2007)
- [j9]Steven D. Galbraith, James F. McKee, P. C. Valença: Ordinary abelian varieties having small embedding degree. Finite Fields and Their Applications 13(4): 800-814 (2007)
- [j8]Steven D. Galbraith, Colm O. hEigeartaigh, Caroline Sheedy: Simplified pairing computation and security implications. J. Mathematical Cryptology 1(3): 267-281 (2007)
- [c15]Waldyr D. Benits Junior, Steven D. Galbraith: Constructing Pairing-Friendly Elliptic Curves Using Gröbner Basis Reduction. IMA Int. Conf. 2007: 336-345
- [c14]Steven D. Galbraith, Florian Hess, Frederik Vercauteren: Hyperelliptic Pairings. Pairing 2007: 108-131
- [c13]Waldyr D. Benits Junior, Steven D. Galbraith: The GPS Identification Scheme Using Frobenius Expansions. WEWoRC 2007: 13-27
- [e1]Steven D. Galbraith (Ed.): Cryptography and Coding, 11th IMA International Conference, Cirencester, UK, December 18-20, 2007, Proceedings. Lecture Notes in Computer Science 4887, Springer 2007, ISBN 978-3-540-77271-2
- [i15]Steven D. Galbraith, Florian Hess, Frederik Vercauteren: Aspects of Pairing Inversion. IACR Cryptology ePrint Archive 2007: 256 (2007)
- 2006
- [c12]
- [i14]Steven D. Galbraith, Kenneth G. Paterson, Nigel P. Smart: Pairings for Cryptographers. IACR Cryptology ePrint Archive 2006: 165 (2006)
- [i13]Steven D. Galbraith, Colm O'Eigeartaigh, Caroline Sheedy: Simplified pairing computation and security implications. IACR Cryptology ePrint Archive 2006: 169 (2006)
- [i12]Steven D. Galbraith: Disguising tori and elliptic curves. IACR Cryptology ePrint Archive 2006: 248 (2006)
- [i11]Steven D. Galbraith, Benjamin A. Smith: Discrete Logarithms in Generalized Jacobians. IACR Cryptology ePrint Archive 2006: 333 (2006)
- [i10]Steven D. Galbraith, Jordi Pujolàs, Christophe Ritzenthaler, Benjamin A. Smith: Distortion maps for genus two curves. IACR Cryptology ePrint Archive 2006: 375 (2006)
- 2005
- [j7]Steven D. Galbraith, Alfred Menezes: Algebraic curves and cryptography. Finite Fields and Their Applications 11(3): 544-577 (2005)
- [c11]
- [c10]Steven D. Galbraith, James F. McKee: Pairings on Elliptic Curves over Finite Commutative Rings. IMA Int. Conf. 2005: 392-409
- [i9]Steven D. Galbraith: The Weil pairing on elliptic curves over C. IACR Cryptology ePrint Archive 2005: 323 (2005)
- 2004
- [c9]Steven D. Galbraith, Herbie J. Hopkins, Igor Shparlinski: Secure Bilinear Diffie-Hellman Bits. ACISP 2004: 370-378
- [i8]Steven D. Galbraith, Victor Rotger: Easy decision-Diffie-Hellman groups. IACR Cryptology ePrint Archive 2004: 70 (2004)
- [i7]Steven D. Galbraith, James F. McKee, P. C. Valença: Ordinary abelian varieties having small embedding degree. IACR Cryptology ePrint Archive 2004: 365 (2004)
- [i6]Paulo S. L. M. Barreto, Steven D. Galbraith, Colm O. hEigeartaigh, Michael Scott: Efficient Pairing Computation on Supersingular Abelian Varieties. IACR Cryptology ePrint Archive 2004: 375 (2004)
- 2003
- [j6]
- [c8]Steven D. Galbraith, Wenbo Mao: Invisibility and Anonymity of Undeniable and Confirmer Signatures. CT-RSA 2003: 80-97
- [i5]Simon R. Blackburn, Carlos Cid, Steven D. Galbraith: Cryptanalysis of a Cryptosystem based on Drinfeld modules. IACR Cryptology ePrint Archive 2003: 223 (2003)
- 2002
- [j5]Steven D. Galbraith, John Malone-Lee, Nigel P. Smart: Public key signatures in the multi-user setting. Inf. Process. Lett. 83(5): 263-266 (2002)
- [j4]
- [j3]Steven D. Galbraith, S. M. Paulus, Nigel P. Smart: Arithmetic on superelliptic curves. Math. Comput. 71(237): 393-405 (2002)
- [c7]Steven D. Galbraith, Keith Harrison, David Soldera: Implementing the Tate Pairing. ANTS 2002: 324-337
- [c6]Steven D. Galbraith, Wenbo Mao, Kenneth G. Paterson: RSA-Based Undeniable Signatures for General Moduli. CT-RSA 2002: 200-217
- [c5]Steven D. Galbraith, Florian Hess, Nigel P. Smart: Extending the GHS Weil Descent Attack. EUROCRYPT 2002: 29-44
- [i4]Steven D. Galbraith, Herbie J. Hopkins, Igor Shparlinski: Secure Bilinear Diffie-Hellman Bits. IACR Cryptology ePrint Archive 2002: 155 (2002)
- 2001
- [j2]Steven D. Galbraith: Weil Descent Of Jacobians. Electronic Notes in Discrete Mathematics 6: 459-468 (2001)
- [c4]
- [i3]Steven D. Galbraith: Cryptanalysis of some elliptic curve based cryptosystems of Paillier. IACR Cryptology ePrint Archive 2001: 25 (2001)
- [i2]Steven D. Galbraith: Elliptic curve Paillier schemes. IACR Cryptology ePrint Archive 2001: 50 (2001)
- [i1]Steven D. Galbraith, Florian Hess, Nigel P. Smart: Extending the GHS Weil Descent Attack. IACR Cryptology ePrint Archive 2001: 54 (2001)
1990 – 1999
- 1999
- [j1]
- [c3]Simon R. Blackburn, Steven D. Galbraith: Cryptanalysis of Two Cryptosystems Based on Group Actions. ASIACRYPT 1999: 52-61
- [c2]Steven D. Galbraith, Nigel P. Smart: A Cryptographic Application of Weil Descent. IMA Int. Conf. 1999: 191-200
- [c1]Simon R. Blackburn, Simon Blake-Wilson, Mike Burmester, Steven D. Galbraith: Weaknesses in Shared RSA Key Generation Protocols. IMA Int. Conf. 1999: 300-306
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-11 21:39 CEST by the dblp team