Weil descent of Jacobians

Discrete Applied Mathematics

Volumn 128, Issue 1 SPEC., 2003, Pages 165-180

  Galbraith, Steven D ^a  

^a UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; MATHEMATICAL TECHNIQUES;

DISCRETE LOGARITHM PROBLEMS; ELLIPTIC CURVE CRYPTOGRAPHY; FINITE FIELDS; JACOBIANS; WEIL DESCENTS;

PUBLIC KEY CRYPTOGRAPHY;

EID: 0038060517     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(02)00443-2     Document Type: Conference Paper

References (14)

1. L. Adleman, J. De Marrais, M.-D. Huang, A subexponential algorithm for discrete logarithms over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fields, in: L.M. Adleman, M-D. Huang (Eds.), ANTS-I, Vol. 877, Springer, Berlin, 1994, pp. 28-40.
2. C. Diem, The GHS attack in odd characteristic, preprint 2001, available from http://www.exp-math.uni-essen.de/~diem/.
3. I. Duursma, P. Gaudry, F. Morain, Speeding up the discrete log computation on curves with automorphisms, in: Lam et al. (Eds.), ASIACRYPT '99, Lecture Notes in Computer Science, Vol. 1716, Springer, Berlin, 1999, pp. 103-121.
4. R. Flassenberg, and S. Paulus Sieving in function fields Exp. Math. 8 4 1997 339 349
5. G. Frey, How to disguise an elliptic curve, Talk at ECC '98, Waterloo, 1998, http://cacr.math.uwaterloo.ca/conferences/1998/ecc98/slides.html.
6. S.D. Galbraith, Limitations of constructive Weil descent, in: K. Alster, et al. (Eds.), Public-Key Cryptography and Computational Number Theory, Walter de Gruyter, Berlin, 2001, pp. 59-70.
7. S.D. Galbraith, and N.P. Smart A cryptographic application of Weil descent M. Walker, Codes and Cryptography Cirencester Lecture Notes in Computer Science Vol. 1746 1999 Springer Berlin 191 200
8. P. Gaudry An algorithm for solving the discrete log problem on hyperelliptic curves B. Preneel, EUROCRYPT 2000 Lecture Notes in Computer Science Vol. 1807 2000 19 34
9. P. Gaudry, F. Hess, and N.P. Smart Constructive and destructive facets of Weil descent on elliptic curves J. Cryptology 15 1 2002 19 46
10. C. Günther, T. Lange, and A. Stein Speeding up the arithmetic on Koblitz curves of genus two D. Stinson, SAC 2001 Lecture Notes in Computer Science Vol. 2012 2001 Springer Berlin 106 117
11. N. Koblitz Hyperelliptic cryptosystems J. Cryptology 1 3 1989 139 150
12. N.P. Smart, How secure are elliptic curves over composite extension fields? in: B. Pfitzmann (Ed.), EUROCRYPT 2001, Lecture Notes in Computer Science, Vol. 2045, Springer, Berlin, 2001, pp. 30-39.
13. A.-M. Spallek, Kurven vom Geschlecht 2 und ihre Anwendung in Public-Key-Kryptosystemen, Ph.D. Thesis, IEM Essen, 1994.
14. H. Stichtenoth, Algebraic Function Fields and Codes, Springer Universitext, Berlin, 1993.