14 citations · 19 across the 3 of their papers we have counts for
3 papers
math.NT2006★ 14 cited
Distortion maps for genus two curves
Steven D. Galbraith, Jordi Pujolàs, Christophe Ritzenthaler +1
Distortion maps are a useful tool for pairing based cryptography. Compared with elliptic curves, the case of hyperelliptic curves of genus g > 1 is more complicated since the full…
math.NT2006★ 5 cited
Discrete Logarithms in Generalized Jacobians
S. D. Galbraith, B. A. Smith
Déchène has proposed generalized Jacobians as a source of groups for public-key cryptosystems based on the hardness of the Discrete Logarithm Problem (DLP). Her specific proposal g…
math.NT2004
Easy decision-Diffie-Hellman groups
Steven Galbraith, Victor Rotger
The decision-Diffie-Hellman problem (DDH) is a central computational problem in cryptography. It is known that the Weil and Tate pairings can be used to solve many DDH problems on…