Pairings for cryptographers SD Galbraith, KG Paterson, NP Smart Discrete Applied Mathematics 156 (16), 3113-3121, 2008 | 1088 | 2008 |

Pairings for cryptographers SD Galbraith, KG Paterson, NP Smart Discrete Applied Mathematics 156 (16), 3113-3121, 2008 | 1088 | 2008 |

Implementing the Tate pairing SD Galbraith, K Harrison, D Soldera International Algorithmic Number Theory Symposium, 324-337, 2002 | 764 | 2002 |

Efficient pairing computation on supersingular abelian varieties PSLM Barreto, SD Galbraith, CÓ hÉigeartaigh, M Scott Designs, Codes and Cryptography 42, 239-271, 2007 | 650 | 2007 |

Mathematics of public key cryptography SD Galbraith Cambridge University Press, 2012 | 626 | 2012 |

Supersingular curves in cryptography SD Galbraith International Conference on the Theory and Application of Cryptology and …, 2001 | 326 | 2001 |

On the security of supersingular isogeny cryptosystems SD Galbraith, C Petit, B Shani, YB Ti Advances in Cryptology–ASIACRYPT 2016: 22nd International Conference on the …, 2016 | 267 | 2016 |

An improved compression technique for signatures based on learning with errors S Bai, SD Galbraith Topics in Cryptology–CT-RSA 2014: The Cryptographer’s Track at the RSA …, 2014 | 239 | 2014 |

Identification protocols and signature schemes based on supersingular isogeny problems SD Galbraith, C Petit, J Silva Advances in Cryptology–ASIACRYPT 2017: 23rd International Conference on the …, 2017 | 190 | 2017 |

Pairings S Galbraith Advances in elliptic curve cryptography, 183-213, 2005 | 180 | 2005 |

SeaSign: compact isogeny signatures from class group actions L De Feo, SD Galbraith Advances in Cryptology–EUROCRYPT 2019: 38th Annual International Conference …, 2019 | 178 | 2019 |

Constructing isogenies between elliptic curves over finite fields SD Galbraith LMS Journal of Computation and Mathematics 2, 118-138, 1999 | 176 | 1999 |

Extending the GHS Weil descent attack SD Galbraith, F Hess, NP Smart Advances in Cryptology—EUROCRYPT 2002: International Conference on the …, 2002 | 175 | 2002 |

Computing isogenies between supersingular elliptic curves over C Delfs, SD Galbraith Designs, Codes and Cryptography 78, 425-440, 2016 | 164 | 2016 |

Recent progress on the elliptic curve discrete logarithm problem SD Galbraith, P Gaudry Designs, Codes and Cryptography 78, 51-72, 2016 | 160 | 2016 |

Invisibility and anonymity of undeniable and confirmer signatures SD Galbraith, W Mao Topics in Cryptology—CT-RSA 2003: The Cryptographers’ Track at the RSA …, 2003 | 160 | 2003 |

Sampling from discrete Gaussians for lattice-based cryptography on a constrained device NC Dwarakanath, SD Galbraith Applicable Algebra in Engineering, Communication and Computing 25, 159-180, 2014 | 146 | 2014 |

A cryptographic application of Weil descent SD Galbraith⋆, NP Smart Cryptography and Coding: 7th IMA International Conference Cirencester, UK …, 1999 | 146 | 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 | 141 | 2007 |

Elliptic curve Paillier schemes SD Galbraith Journal of Cryptology 15, 129-138, 2002 | 138 | 2002 |