Cryptography Reference
In-Depth Information
[203]
S. D. Galbraith, C. Heneghan and J. F. McKee, Tunable balancing of RSA. In
ACISP 2005
(C. Boyd and J. M. Gonzalez Nieto, eds.),
LNCS
, vol. 3574, Springer, 2005, pp. 280-292.
[204]
S. D. Galbraith, F. Hess and N. P. Smart, Extending the GHS Weil descent attack. In
EURO-
CRYPT 2002
(L. R. Knudsen, ed.),
LNCS
, vol. 2332, Springer, 2002, pp. 29-44.
[205]
S. D. Galbraith, F. Hess and F. Vercauteren, Aspects of pairing inversion,
IEEE Trans. Inf.
Theory
54
(12) (2008), 5719-5728.
[206]
S. D. Galbraith and M. Holmes,
A Non-Uniform Birthday Problem with Applications to
Discrete Logarithms
, Cryptology ePrint Archive, Report 2010/616, 2010.
[207]
S. D. Galbraith, X. Lin and M. Scott, Endomorphisms for faster elliptic curve cryptography
on a large class of curves. In
EUROCRYPT 2009
(A. Joux, ed.),
LNCS
, vol. 5479, Springer,
2009, pp. 518-535.
[208]
S. D. Galbraith and J. F. McKee, The probability that the number of points on an elliptic curve
over a finite field is prime,
J. Lond. Math. Soc.
62
(3) (2000), 671-684.
[209]
S. D. Galbraith, J. M. Pollard and R. S. Ruprai,
Computing Discrete Logarithms in an Interval
,
Cryptology ePrint Archive, Report 2010/617, 2010.
[210]
S. D. Galbraith and R. S. Ruprai, An improvement to the Gaudry-Schost algorithm for
multidimensional discrete logarithm problems. In
IMA Cryptography and Coding
(M. G.
Parker, ed.),
LNCS
, vol. 5921, Springer, 2009, pp. 368-382.
[211]
Using equivalence classes to accelerate solving the discrete logarithm problem in
a short interval. In
PKC 2010
(P. Q. Nguyen and D. Pointcheval, eds.),
LNCS
, vol. 6056,
Springer, 2010, pp. 368-383.
[212]
S. D. Galbraith and N. P. Smart, A cryptographic application of Weil descent. In
IMA Cryp-
tography and Coding
(M. Walker, ed.),
LNCS
, vol. 1746, Springer, 1999, pp. 191-200.
[213]
S. D. Galbraith and A. Stolbunov,
Improved Algorithm for the Isogeny Problem for Ordinary
Elliptic Curves
, Preprint, 2011.
[214]
S. D. Galbraith and E. R. Verheul, An analysis of the vector decomposition problem. In
PKC
2008
(R. Cramer, ed.),
LNCS
, vol. 4939, Springer, 2008, pp. 308-327.
[215]
R. P. Gallant, R. J. Lambert and S. A. Vanstone, Improving the parallelized Pollard lambda
search on binary anomalous curves,
Math. Comp.
69
(2000), (232) 1699-1705.
[216]
Faster point multiplication on elliptic curves with efficient endomorphisms. In
CRYPTO 2001
(J. Kilian, ed.),
LNCS
, vol. 2139, Springer, 2001, pp. 190-200.
[217]
N. Gama, P. Q. Nguyen and O. Regev, Lattice enumeration using extreme pruning. In
EURO-
CRYPT 2010
(H. Gilbert, ed.),
LNCS
, vol. 6110, Springer, 2010, pp. 257-278.
[218]
S. Gao, Normal bases over finite fields, Ph.D. thesis, Waterloo, 1993.
[219]
T. Garefalakis, The generalised Weil pairing and the discrete logarithm problem on elliptic
curves,
Theor. Comput. Sci.
321
(1) (2004), 59-72.
[220]
J. von zur Gathen and J. Gerhard,
Modern Computer Algebra
, Cambridge University Press,
1999.
[221]
J. von zur Gathen and M. Giesbrecht, Constructing normal bases in finite fields,
J. Symb.
Comput.
10
(6) (1990), 547-570.
[222]
J. von zur Gathen, I. E. Shparlinski and A. Sinclair, Finding points on curves over finite fields,
SIAM J. Comput.
32
(6) (2003), 1436-1448.
[223]
P. Gaudry, An algorithm for solving the discrete log problem on hyperelliptic curves. In
EUROCRYPT 2000
(B. Preneel, ed.),
LNCS
, vol. 1807, Springer, 2000, pp. 19-34.
[224]
Fast genus 2 arithmetic based on theta functions,
J. Math. Crypt.
1
(3) (2007), 243-265.
[225]
Index calculus for abelian varieties of small dimension and the elliptic curve discrete
logarithm problem,
J. Symb. Comput.
44
(12) (2009), 1690-1702.
[226]
P. Gaudry, F. Hess and N. P. Smart, Constructive and destructive facets of Weil descent on
elliptic curves,
J. Crypt.
15
(2002), 19-46.
