Two topics in hyperelliptic cryptography

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2259, Issue , 2001, Pages 181-189

  Hess, Florian ^a   Seroussi, Gadiel ^b   Smart, Nigel P ^a  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

^b HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GEOMETRY;

ELLIPTIC CURVE; HYPER-ELLIPTIC CURVES;

CRYPTOGRAPHY;

EID: 23044531187     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45537-x_14     Document Type: Conference Paper

References (19)

1. X9.62 Public Key Cryptography For The Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA). American National Standards Institute, 1999.
2. D.G. Cantor. Computing in the Jacobian of a hyperelliptic curve. Math. Comp., 48, 95-101, 1987.
3. M. Fouquet, P. Gaudry and R. Harley. An extension of Satoh’s algorithm and its implementation. J. Ramanujan Math. Soc., 15, 281-318, 2000.
4. G. Frey and H.-G. Rück. A remark concerning m-divisibility and the discrete logarithm problem in the divisor class group of curves. Math. Comp., 62, 865-874, 1994.
5. G. Frey, Applications of arithmetical geometry to cryptographic constructions, Preprint, 2000.
6. S.D. Galbraith. Limitations of constructive Weil descent. To appear Proceedings of a Conference on Cryptography and Computational Number Theory,Warsaw, Sept 2000.
7. P. Gaudry. An algorithm for solving the discrete log problem on hyperelliptic curves. Advances in Cryptology,EUR OCRYPT 2000, Springer-Verlag LNCS 1807, 19-34, 2000.
8. P. Gaudry and R. Harley. Counting points on hyperelliptic curves over finite fields. ANTS-IV, Springer-Verlag LNCS 1838, 313-332, 2000.
9. P. Gaudry, F. Hess and N.P. Smart. Constructive and destructive facets of Weil descent on elliptic curves. To appear J. Cryptology.
10. K. Kedlaya. Counting points on hyperelliptic curves using Monsky-Washnitzer cohomology. Preprint 2001.
11. N. Koblitz. Elliptic curve cryptosystems. Math. Comp., 48, 203-209, 1987.
12. N. Koblitz. Hyperelliptic cryptosystems. J. Cryptology, 1, 139-150, 1989.
13. V. Miller. Use of elliptic curves in cryptography. Advances in Cryptology, CRYPTO -’85, Springer-Verlag LNCS 218, 47-426, 1986.
14. T. Satoh. The canonical lift of an ordinary elliptic curve over a finite field and its point counting. J. Ramanujan Math. Soc., 15, 247-270, 2000.
15. B. Skjernaa. Satoh’s algorithm in characteristic two. Preprint 2000.
16. N.P. Smart. On the performance of hyperelliptic cryptosystems. Advances in Cryptology,EUR OCRYPT’99, Springer-Verlag, LNCS 1592, 165-175, 1999.
17. A.-M. Spallek, Kurven vom Geschlecht 2 und ihre Anwendung in Public-Key- Kryptosystemen, PhD Thesis, IEM Essen, 1994.
18. F. Vercauteren, B. Preneel and J. Vandewalle. A memory efficient version of Satoh’s algorithm. Advances in Cryptology,EUR OCRYPT 2001, Springer-Verlag, LNCS 2045, 1-13, 2001.
19. A. Weng, Constructing hyperelliptic curves of genus 2 suitable for cryptography, Preprint, 2000.