1. Simon R. Blackburn, Carlos Cid, and Steven D. Galbraith, Cryptanalysis of a cryptosystem based on Drinfeld modules, Cryptology ePrint Archive: Report 2003/223 (2003), 5 pages.
  2. Alexander W. Dent and Steven D. Galbraith, Hidden pairings and trapdoor DDH groups, Algorithmic Number Theory (Berlin, 2006), Lecture Notes in Comput. Sci., vol. 2369, Springer, Berlin, 2006, pp. pp.15.
  3. S. Galbraith, F. Hess, and F. Vercauteren, Aspects of pairing inversion, IEEE Transactions on Information Theory 54 (2008), no. 12, 5719-5728.[doi/eprint]
  4. S. D. Galbraith, X. Lin, and D. J. Mireles, Pairings on hyperelliptic curves with a real model, in LNCS 5209, Eds. Galbraith, S. D. and Paterson, K. G.., Springer, 2008, pp. 256–281.
  5. S. D. Galbraith, J. F. McKee, and P. C. Valença, Ordinary abelian varieties having small embedding degree, Finite Fields Appl. 13 (2007), no. 4, 800–814.[MR]
  6. Steven D. Galbraith, Supersingular curves in cryptography, Advances in Cryptology—Asiacrypt 2001 (Gold Coast), Lecture Notes in Comput. Sci., vol. 2248, Springer, Berlin, 2001, pp. 495–513.[MR]
  7. Steven D. Galbraith, Weil descent of Jacobians, Discrete Appl. Math. 128 (2003), no. 1, 165–180.[MR]
  8. Steven Galbraith, Disguising tori and elliptic curves, Preprint (2006), 12 pages.[link]
  9. Steven D. Galbraith, Michael Harrison, and David J. Mireles Morales, Efficient hyperelliptic arithmetic using balanced representation for divisors, Algorithmic number theory, Lecture Notes in Comput. Sci., vol. 5011, Springer, Berlin, 2008, pp. 342–356.[MR/doi/eprint]
  10. Steven D. Galbraith, Florian Hess, and Nigel P. Smart, Extending the GHS Weil descent attack, Advances in Cryptology—Eurocrypt 2002 (Amsterdam), Lecture Notes in Comput. Sci., vol. 2332, Springer, Berlin, 2002, pp. 29–44.[MR]
  11. Steven D. Galbraith and Xibin Lin, Computing pairings using x-coordinates only, Des. Codes Cryptogr. 50 (2009), no. 3, 305–324.[MR/eprint]
  12. Steven D. Galbraith, Xibin Lin, and David J. Mireles Morales, Pairings on hyperelliptic curves with a real model, Pairing-Based Cryptography, Pairing 2008, Lecture Notes in Computer Science, vol. 5209, Springer, 2008, pp. 265–281.
  13. Steven D. Galbraith, Colm Ó hÉigeartaigh, and Caroline Sheedy, Simplified pairing computation and security implications, J. Math. Cryptol. 1 (2007), no. 3, 267–281.[MR]
  14. Waldyr D. Benits Junior and Steven D. Galbraith, Constructing pairing-friendly elliptic curves using Gröbner basis reduction, Cryptography and Coding, Lecture Notes in Computer Science, vol. 4887/2007, Springer Berlin / Heidelberg, 2007, pp. 336–345.