|
Search the dblp DataBase
Steven D. Galbraith:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Steven D. Galbraith, Chris Heneghan, James F. McKee
Tunable Balancing of RSA. [Citation Graph (0, 0)][DBLP] ACISP, 2005, pp:280-292 [Conf]
- Steven D. Galbraith, Herbie J. Hopkins, Igor Shparlinski
Secure Bilinear Diffie-Hellman Bits. [Citation Graph (0, 0)][DBLP] ACISP, 2004, pp:370-378 [Conf]
- Steven D. Galbraith, Keith Harrison, David Soldera
Implementing the Tate Pairing. [Citation Graph (0, 0)][DBLP] ANTS, 2002, pp:324-337 [Conf]
- Alexander W. Dent, Steven D. Galbraith
Hidden Pairings and Trapdoor DDH Groups. [Citation Graph (0, 0)][DBLP] ANTS, 2006, pp:436-451 [Conf]
- Simon R. Blackburn, Steven D. Galbraith
Cryptanalysis of Two Cryptosystems Based on Group Actions. [Citation Graph (0, 0)][DBLP] ASIACRYPT, 1999, pp:52-61 [Conf]
- Steven D. Galbraith
Supersingular Curves in Cryptography. [Citation Graph (0, 0)][DBLP] ASIACRYPT, 2001, pp:495-513 [Conf]
- Steven D. Galbraith, Wenbo Mao
Invisibility and Anonymity of Undeniable and Confirmer Signatures. [Citation Graph (0, 0)][DBLP] CT-RSA, 2003, pp:80-97 [Conf]
- Steven D. Galbraith, Wenbo Mao, Kenneth G. Paterson
RSA-Based Undeniable Signatures for General Moduli. [Citation Graph (0, 0)][DBLP] CT-RSA, 2002, pp:200-217 [Conf]
- Steven D. Galbraith, Florian Hess, Nigel P. Smart
Extending the GHS Weil Descent Attack. [Citation Graph (0, 0)][DBLP] EUROCRYPT, 2002, pp:29-44 [Conf]
- Steven D. Galbraith, James F. McKee
Pairings on Elliptic Curves over Finite Commutative Rings. [Citation Graph (0, 0)][DBLP] IMA Int. Conf., 2005, pp:392-409 [Conf]
- Steven D. Galbraith, Nigel P. Smart
A Cryptographic Application of Weil Descent. [Citation Graph (0, 0)][DBLP] IMA Int. Conf., 1999, pp:191-200 [Conf]
- Simon R. Blackburn, Simon Blake-Wilson, Mike Burmester, Steven D. Galbraith
Weaknesses in Shared RSA Key Generation Protocols. [Citation Graph (0, 0)][DBLP] IMA Int. Conf., 1999, pp:300-306 [Conf]
- Steven D. Galbraith
Weil Descent of Jacobians. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2003, v:128, n:1, pp:165-180 [Journal]
- Steven D. Galbraith, John Malone-Lee, Nigel P. Smart
Public key signatures in the multi-user setting. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 2002, v:83, n:5, pp:263-266 [Journal]
- Steven D. Galbraith
Elliptic Curve Paillier Schemes. [Citation Graph (0, 0)][DBLP] J. Cryptology, 2002, v:15, n:2, pp:129-138 [Journal]
- Steven D. Galbraith, S. M. Paulus, Nigel P. Smart
Arithmetic on superelliptic curves. [Citation Graph (0, 0)][DBLP] Math. Comput., 2002, v:71, n:237, pp:393-405 [Journal]
- Steven D. Galbraith, Florian Hess, Frederik Vercauteren
Hyperelliptic Pairings. [Citation Graph (0, 0)][DBLP] Pairing, 2007, pp:108-131 [Conf]
- Paulo S. L. M. Barreto, Steven D. Galbraith, Colm O'Eigeartaigh, Michael Scott
Efficient pairing computation on supersingular Abelian varieties. [Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 2007, v:42, n:3, pp:239-271 [Journal]
Efficient Hyperelliptic Arithmetic Using Balanced Representation for Divisors. [Citation Graph (, )][DBLP]
Endomorphisms for Faster Elliptic Curve Cryptography on a Large Class of Curves. [Citation Graph (, )][DBLP]
Constructing Pairing-Friendly Elliptic Curves Using Gröbner Basis Reduction. [Citation Graph (, )][DBLP]
An Improvement to the Gaudry-Schost Algorithm for Multidimensional Discrete Logarithm Problems. [Citation Graph (, )][DBLP]
An Analysis of the Vector Decomposition Problem. [Citation Graph (, )][DBLP]
Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval. [Citation Graph (, )][DBLP]
The GPS Identification Scheme Using Frobenius Expansions. [Citation Graph (, )][DBLP]
Pairings on Hyperelliptic Curves with a Real Model. [Citation Graph (, )][DBLP]
Exponentiation in Pairing-Friendly Groups Using Homomorphisms. [Citation Graph (, )][DBLP]
Pairings for cryptographers. [Citation Graph (, )][DBLP]
Computing pairings using x -coordinates only. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.306secs
|