| Pairings for cryptographers SD Galbraith, KG Paterson, NP Smart Discrete Applied Mathematics 156 (16), 3113-3121, 2008 | 874 | 2008 |
| Pairings for cryptographers SD Galbraith, KG Paterson, NP Smart Discrete Applied Mathematics 156 (16), 3113-3121, 2008 | 874 | 2008 |
| Implementing the Tate pairing SD Galbraith, K Harrison, D Soldera International Algorithmic Number Theory Symposium, 324-337, 2002 | 731 | 2002 |
| Efficient pairing computation on supersingular abelian varieties PSLM Barreto, SD Galbraith, C Ó’hÉigeartaigh, M Scott Designs, Codes and Cryptography 42 (3), 239-271, 2007 | 614 | 2007 |
| Mathematics of public key cryptography SD Galbraith Cambridge University Press, 2012 | 421 | 2012 |
| Supersingular curves in cryptography SD Galbraith International Conference on the Theory and Application of Cryptology and …, 2001 | 296 | 2001 |
| Pairings SD Galbraith book Advances in elliptic curve cryptography, 2005 | 162 | 2005 |
| An improved compression technique for signatures based on learning with errors S Bai, SD Galbraith Cryptographers’ Track at the RSA Conference, 28-47, 2014 | 155 | 2014 |
| Invisibility and anonymity of undeniable and confirmer signatures SD Galbraith, W Mao Cryptographers’ Track at the RSA Conference, 80-97, 2003 | 151 | 2003 |
| Extending the GHS Weil descent attack SD Galbraith, F Hess, NP Smart International Conference on the Theory and Applications of Cryptographic …, 2002 | 147 | 2002 |
| On the security of supersingular isogeny cryptosystems SD Galbraith, C Petit, B Shani, YB Ti International Conference on the Theory and Application of Cryptology and …, 2016 | 146 | 2016 |
| Constructing isogenies between elliptic curves over finite fields SD Galbraith LMS Journal of Computation and Mathematics 2, 118-138, 1999 | 143 | 1999 |
| A cryptographic application of Weil descent SD Galbraith, NP Smart IMA International Conference on Cryptography and Coding, 191-200, 1999 | 137 | 1999 |
| Ordinary abelian varieties having small embedding degree SD Galbraith, JF McKee, PC Valença Finite Fields and Their Applications 13 (4), 800-814, 2007 | 123 | 2007 |
| Sampling from discrete Gaussians for lattice-based cryptography on a constrained device NC Dwarakanath, SD Galbraith Applicable Algebra in Engineering, Communication and Computing 25 (3), 159-180, 2014 | 121 | 2014 |
| Easy decision diffie-hellman groups SD Galbraith, V Rotger LMS Journal of Computation and Mathematics 7, 201-218, 2004 | 107 | 2004 |
| Elliptic curve Paillier schemes SD Galbraith Journal of Cryptology 15 (2), 129-138, 2002 | 106 | 2002 |
| Identification protocols and signature schemes based on supersingular isogeny problems SD Galbraith, C Petit, J Silva Journal of Cryptology 33 (1), 130-175, 2020 | 104 | 2020 |
| Arithmetic on superelliptic curves S Galbraith, S Paulus, N Smart Mathematics of computation 71 (237), 393-405, 2002 | 102 | 2002 |
| Endomorphisms for faster elliptic curve cryptography on a large class of curves SD Galbraith, X Lin, M Scott Annual International Conference on the Theory and Applications of …, 2009 | 99 | 2009 |
