![]() | ![]() |
| 2012 | ||
|---|---|---|
| 64 | Steven D. Galbraith, Mark Holmes: A non-uniform birthday problem with applications to discrete logarithms. Discrete Applied Mathematics 160(10-11): 1547-1560 (2012) | |
| 2011 | ||
| 63 | Steven D. Galbraith, Anton Stolbunov: Improved Algorithm for the Isogeny Problem for Ordinary Elliptic Curves CoRR abs/1105.6331: (2011) | |
| 62 | 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) | |
| 61 | 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) | |
| 2010 | ||
| 60 | 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 | |
| 59 | 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) | |
| 58 | Steven D. Galbraith, Mark Holmes: A non-uniform birthday problem with applications to discrete logarithms. IACR Cryptology ePrint Archive 2010: 616 (2010) | |
| 57 | Steven D. Galbraith, John M. Pollard, Raminder S. Ruprai: Computing Discrete Logarithms in an Interval. IACR Cryptology ePrint Archive 2010: 617 (2010) | |
| 2009 | ||
| 56 | Steven D. Galbraith, Xibin Lin, Michael Scott: Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves. EUROCRYPT 2009: 518-535 | |
| 55 | Steven D. Galbraith, Raminder S. Ruprai: An Improvement to the Gaudry-Schost Algorithm for Multidimensional Discrete Logarithm Problems. IMA Int. Conf. 2009: 368-382 | |
| 54 | Steven D. Galbraith, Xibin Lin: Computing pairings using x -coordinates only. Des. Codes Cryptography 50(3): 305-324 (2009) | |
| 53 | P. N. J. Eagle, Steven D. Galbraith, John Ong: Point Compression for Koblitz Elliptic Curves. IACR Cryptology ePrint Archive 2009: 86 (2009) | |
| 2008 | ||
| 52 | Steven D. Galbraith, Kenneth G. Paterson: Pairing-Based Cryptography - Pairing 2008, Second International Conference, Egham, UK, September 1-3, 2008. Proceedings Springer 2008 | |
| 51 | Steven D. Galbraith, Michael Harrison, David J. Mireles Morales: Efficient Hyperelliptic Arithmetic Using Balanced Representation for Divisors. ANTS 2008: 342-356 | |
| 50 | Steven D. Galbraith, Michael Scott: Exponentiation in Pairing-Friendly Groups Using Homomorphisms. Pairing 2008: 211-224 | |
| 49 | Steven D. Galbraith, Xibin Lin, David J. Mireles Morales: Pairings on Hyperelliptic Curves with a Real Model. Pairing 2008: 265-281 | |
| 48 | Steven D. Galbraith, Eric R. Verheul: An Analysis of the Vector Decomposition Problem. Public Key Cryptography 2008: 308-327 | |
| 47 | Steven D. Galbraith, Kenneth G. Paterson, Nigel P. Smart: Pairings for cryptographers. Discrete Applied Mathematics 156(16): 3113-3121 (2008) | |
| 46 | Steven D. Galbraith, Michael Scott: Exponentiation in pairing-friendly groups using homomorphisms. IACR Cryptology ePrint Archive 2008: 117 (2008) | |
| 45 | Steven D. Galbraith, Xibin Lin: Computing Pairings Using x-Coordinates Only. IACR Cryptology ePrint Archive 2008: 19 (2008) | |
| 44 | 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) | |
| 43 | 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) | |
| 42 | Steven D. Galbraith, Xibin Lin, David J. Mireles Morales: Pairings on hyperelliptic curves with a real model. IACR Cryptology ePrint Archive 2008: 250 (2008) | |
| 41 | Steven D. Galbraith, Michael Harrison, David J. Mireles Morales: Efficient Hyperelliptic Arithmetic using Balanced Representation for Divisors. IACR Cryptology ePrint Archive 2008: 265 (2008) | |
| 40 | Steven D. Galbraith, Florian Hess, Frederik Vercauteren: Aspects of Pairing Inversion. IEEE Transactions on Information Theory 54(12): 5719-5728 (2008) | |
| 2007 | ||
| 39 | Steven D. Galbraith: Cryptography and Coding, 11th IMA International Conference, Cirencester, UK, December 18-20, 2007, Proceedings Springer 2007 | |
| 38 | Waldyr D. Benits Junior, Steven D. Galbraith: Constructing Pairing-Friendly Elliptic Curves Using Gröbner Basis Reduction. IMA Int. Conf. 2007: 336-345 | |
| 37 | Steven D. Galbraith, Florian Hess, Frederik Vercauteren: Hyperelliptic Pairings. Pairing 2007: 108-131 | |
| 36 | Waldyr D. Benits Junior, Steven D. Galbraith: The GPS Identification Scheme Using Frobenius Expansions. WEWoRC 2007: 13-27 | |
| 35 | 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) | |
| 34 | 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) | |
| 33 | Steven D. Galbraith, Florian Hess, Frederik Vercauteren: Aspects of Pairing Inversion. IACR Cryptology ePrint Archive 2007: 256 (2007) | |
| 2006 | ||
| 32 | Alexander W. Dent, Steven D. Galbraith: Hidden Pairings and Trapdoor DDH Groups. ANTS 2006: 436-451 | |
| 31 | Steven D. Galbraith, Kenneth G. Paterson, Nigel P. Smart: Pairings for Cryptographers. IACR Cryptology ePrint Archive 2006: 165 (2006) | |
| 30 | Steven D. Galbraith, Colm O'Eigeartaigh, Caroline Sheedy: Simplified pairing computation and security implications. IACR Cryptology ePrint Archive 2006: 169 (2006) | |
| 29 | Steven D. Galbraith: Disguising tori and elliptic curves. IACR Cryptology ePrint Archive 2006: 248 (2006) | |
| 28 | Steven D. Galbraith, B. A. Smith: Discrete Logarithms in Generalized Jacobians. IACR Cryptology ePrint Archive 2006: 333 (2006) | |
| 27 | Steven D. Galbraith, Jordi Pujolàs, Christophe Ritzenthaler, Benjamin Smith: Distortion maps for genus two curves. IACR Cryptology ePrint Archive 2006: 375 (2006) | |
| 2005 | ||
| 26 | Steven D. Galbraith, Chris Heneghan, James F. McKee: Tunable Balancing of RSA. ACISP 2005: 280-292 | |
| 25 | Steven D. Galbraith, James F. McKee: Pairings on Elliptic Curves over Finite Commutative Rings. IMA Int. Conf. 2005: 392-409 | |
| 24 | Steven D. Galbraith, Alfred Menezes: Algebraic curves and cryptography. Finite Fields and Their Applications 11(3): 544-577 (2005) | |
| 23 | Steven D. Galbraith: The Weil pairing on elliptic curves over C. IACR Cryptology ePrint Archive 2005: 323 (2005) | |
| 2004 | ||
| 22 | Steven D. Galbraith, Herbie J. Hopkins, Igor Shparlinski: Secure Bilinear Diffie-Hellman Bits. ACISP 2004: 370-378 | |
| 21 | Steven D. Galbraith, James F. McKee, P. C. Valença: Ordinary abelian varieties having small embedding degree. IACR Cryptology ePrint Archive 2004: 365 (2004) | |
| 20 | 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) | |
| 19 | Steven D. Galbraith, Victor Rotger: Easy decision-Diffie-Hellman groups. IACR Cryptology ePrint Archive 2004: 70 (2004) | |
| 2003 | ||
| 18 | Steven D. Galbraith, Wenbo Mao: Invisibility and Anonymity of Undeniable and Confirmer Signatures. CT-RSA 2003: 80-97 | |
| 17 | Steven D. Galbraith: Weil Descent of Jacobians. Discrete Applied Mathematics 128(1): 165-180 (2003) | |
| 16 | Simon R. Blackburn, Carlos Cid, Steven D. Galbraith: Cryptanalysis of a Cryptosystem based on Drinfeld modules. IACR Cryptology ePrint Archive 2003: 223 (2003) | |
| 2002 | ||
| 15 | Steven D. Galbraith, Keith Harrison, David Soldera: Implementing the Tate Pairing. ANTS 2002: 324-337 | |
| 14 | Steven D. Galbraith, Wenbo Mao, Kenneth G. Paterson: RSA-Based Undeniable Signatures for General Moduli. CT-RSA 2002: 200-217 | |
| 13 | Steven D. Galbraith, Florian Hess, Nigel P. Smart: Extending the GHS Weil Descent Attack. EUROCRYPT 2002: 29-44 | |
| 12 | Steven D. Galbraith, Herbie J. Hopkins, Igor Shparlinski: Secure Bilinear Diffie-Hellman Bits. IACR Cryptology ePrint Archive 2002: 155 (2002) | |
| 11 | 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) | |
| 10 | Steven D. Galbraith: Elliptic Curve Paillier Schemes. J. Cryptology 15(2): 129-138 (2002) | |
| 9 | Steven D. Galbraith, S. M. Paulus, Nigel P. Smart: Arithmetic on superelliptic curves. Math. Comput. 71(237): 393-405 (2002) | |
| 2001 | ||
| 8 | Steven D. Galbraith: Supersingular Curves in Cryptography. ASIACRYPT 2001: 495-513 | |
| 7 | Steven D. Galbraith: Weil Descent Of Jacobians. Electronic Notes in Discrete Mathematics 6: 459-468 (2001) | |
| 6 | Steven D. Galbraith: Cryptanalysis of some elliptic curve based cryptosystems of Paillier. IACR Cryptology ePrint Archive 2001: 25 (2001) | |
| 5 | Steven D. Galbraith: Elliptic curve Paillier schemes. IACR Cryptology ePrint Archive 2001: 50 (2001) | |
| 4 | Steven D. Galbraith, Florian Hess, Nigel P. Smart: Extending the GHS Weil Descent Attack. IACR Cryptology ePrint Archive 2001: 54 (2001) | |
| 1999 | ||
| 3 | Simon R. Blackburn, Steven D. Galbraith: Cryptanalysis of Two Cryptosystems Based on Group Actions. ASIACRYPT 1999: 52-61 | |
| 2 | Steven D. Galbraith, Nigel P. Smart: A Cryptographic Application of Weil Descent. IMA Int. Conf. 1999: 191-200 | |
| 1 | Simon R. Blackburn, Simon Blake-Wilson, Mike Burmester, Steven D. Galbraith: Weaknesses in Shared RSA Key Generation Protocols. IMA Int. Conf. 1999: 300-306 | |
Colors in the list of coauthors
Last update Wed May 30 22:34:44 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page