Hyperelliptic curve cryptosystems: Closing the performance gap to elliptic curves

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

Volumn 2779, Issue , 2003, Pages 351-365

  Pelzl, Jan ^a   Wollinger, Thomas ^a   Guajardo, Jorge ^a   Paar, Christof ^a  

^a RUHR UNIVERSITY BOCHUM   (Germany)

Author keywords

Comparison HECC vs. ECC; Efficient implementation; Explicit formulae; Hyperelliptic curves

Indexed keywords

CRYPTOGRAPHY; EMBEDDED SYSTEMS;

COMPARISON HECC VS. ECC; EFFICIENT IMPLEMENTATION; ELLIPTIC CURVE CRYPTOSYSTEMS; EXPLICIT FORMULA; HYPER-ELLIPTIC CURVES; HYPERELLIPTIC CURVE CRYPTOSYSTEMS; PERFORMANCE COMPARISON; PERFORMANCE PENALTIES;

GEOMETRY;

EID: 35248899925     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45238-6_28     Document Type: Article

References (42)

1. ANSI X9.62-1999. The Elliptic Curve Digital Signature Algorithm. Technical report, ANSI, 1999.
2. N. Boston, T. Clancy, Y. Liow, and J. Webster. Genus Two Hyperelliptic Curve Coprocessor. In Workshop on Cryptographic Hardware and Embedded Systems - CHES 2002, New York, 2002. Springer Verlag. LNCS 2523.
3. I.F. Blake, G. Seroussi, and N.P. Smart. Elliptic Curves in Cryptography. London Mathematical Society Lecture Notes Series 265. Cambridge University Press, Reading, Massachusetts, 1999.
4. D.G. Cantor. Computing in Jacobian of a Hyperelliptic Curve. In Mathematics of Computation, volume 48(177), pages 95-101, January 1987.
5. D.V. Chudnovsky and G.V. Chudnovsky. Sequences of numbers generated by addition in formal groups and new primality and factorization tests. In Advances in Applied Mathematics, volume 7, pages 385-434, 1987.
6. H. Cohen, A. Miyaji, and T. Ono. Efficient elliptic curve exponentiation using mixed coordinates. In K. Ohta and D. Pei, editors, Advances in Cryptology - ASIACRYPT 98, pages 51-65. Springer Verlag, 1998. LNCS 1514.
7. H. Cohen. A course in computational number theory. Graduate Texts in Math. 138. Springer-Verlag, Berlin, 1993. Third corrected printing 1996.
8. W. Diffie and M. E. Hellman. New directions in cryptography. IEEE Transactions on Information Theory, IT-22:644-654, 1976.
9. A. Enge. The extended Euclidean algorithm on polynomials, and the computational efficiency of hyperelliptic cryptosystems, November '1999. Preprint.
10. G. Frey and H.-G. Rück. A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Mathematics of Computation, 62(206) :865-874, April 1994.
11. S.D. Galbraith. Supersingular curves in cryptography. In Advances in Cryptology - ASIACRYPT 2001, pages 495-517, 2001. LNCS 2248.
12. P. Gaudry. An algorithm for solving the discrete log problem on hyperelliptic curves. In Bart Preneel, editor, Advances in Cryptology - EUROCRYPT 2000, volume LNCS 1807, pages 19-34, Berlin, Germany, 2000. Springer-Verlag.
13. P. Gaudry and R. Harley. Counting Points on Hyperelliptic Curves over Finite Fields. In W. Bosma, editor, The 4th Algorithmic Number Theory Symposium - ANTS IV, pages 297-312, Berlin, 2000. Springer Verlag. LNCS 1838.
14. ∼harley/hyper/, 2000.
15. D. Hankerson, J. Lopez Hernandez, and A. Menezes. Software Implementation of Elliptic Curve Cryptography Over Binary Fields. In Çetin K. Koç and Christof Paar, editors, Workshop on Cryptographic Hardware and Embedded Systems - CHES 2000, pages 1-24. Springer Verlag, August 2000. LNCS 1717.
16. J. Kuroki, M. Gonda, K. Matsuo, Jinhui Chao, and Shigeo Tsujii. Fast Genus Three Hyperelliptic Curve Cryptosystems. In The 2002 Symposium on Cryptography and Information Security, Japan - SCIS 2002, Jan.29-Feb.1 2002.
17. A. Karatsuba and Y. Ofman. Multiplication of multidigit numbers on automata. Sov. Phys. Dokl. (English translation), 7(7):595-596, 1963.
18. N. Koblitz. Elliptic curve cryptosystems. Mathematics of Computation, 48:203-209, 1987.
19. N. Koblitz. A Family of Jacobians Suitable for Discrete Log Cryptosystems. In Shafi Goldwasser, editor, Advances in Cryptology - Crypto '88, pages 94-99, Berlin, 1988. Springer-Verlag. LNCS 403.
20. N. Koblitz. Hyperelliptic Cryptosystems. In Ernest F. Brickell, editor, Journal of Cryptology, pages 139-150, 1989.
21. N. Koblitz. Algebraic Aspects of Cryptography. Algorithms and Computation in Mathematics. Springer-Verlag, 1998.
22. Uwe Krieger, signatures, February 1997. Diplomarbeit, Universität Essen, Fachbereich 6 (Mathematik und Informatik).
23. T. Lange. Efficient Arithmetic on Genus 2 Hyperelliptic Curves over Finite Fields via Explicit Formulae. Cryptology ePrint Archive, Report 2002/121, 2002. http://eprint.iacr.org/.
24. T. Lange. Inversion-Free Arithmetic on Genus 2 Hyperelliptic Curves. Cryptology ePrint Archive, Report 2002/147, 2002. http://eprint.iacr.org/.
25. T. Lange. Weighted Coordinates on Genus 2 Hyperelliptic Curves. Cryptology ePrint Archive, Report 2002/153, 2002. http://eprint.iacr.org/.
26. n). In Selected Areas in Cryptography - SAC '98, pages 201-212, 1999. LNCS 1556.
27. 2m. In INDOCRYPT, pages 203-212, 2000.
28. K. Matsuo, J. Chao, and S. Tsujii. Fast Genus Two Hyperelliptic Curve Cryptosystems. In ISEC2001-31, IEICE, 2001.
29. Y. Miyamoto, H. Doi, K. Matsuo, J. Chao, and S. Tsuji. A Fast Addition Algorithm of Genus Two Hyperelliptic Curve. In SCIS, IEICE Japan, pages 497-502, 2002. in Japanese.
30. V. Miller. Uses of elliptic curves in cryptography. In H. C. Williams, editor, Advances in Cryptology - CRYPTO '85, volume LNCS 218, pages 417-426, Berlin, Germany, 1986. Springer-Verlag.
31. D. Mumford. Tata lectures on theta II. In Prog. Math., volume 43. Birkhäuser, 1984.
32. K. Nagao. Improving group law algorithms for Jacobians of hyperelliptic curves. In W. Bosma, editor, ANTS IV, volume 1838 of Lecture Notes in Computer Science, pages 439-448, Berlin, 2000. Springer Verlag.
33. IEEE P1363 Standard Specifications for Public Key Cryptography, November 1999. Last Preliminary Draft.
34. J. M. Pollard. Monte carlo methods for index computation mod p. Mathematics of Computation, 32(143):918-924, July 1978.
35. Jan Pelzl, Thomas Wollinger, Jorge Guajardo, and Christof Paar. Hyperelliptic Curve Cryptosystems: Closing the Performance Gap to Elliptic Curves (Update). Cryptology ePrint Archive, Report 2003/026, 2003. http://eprint.iacr.org/.
36. N.P. Smart. On the Performance of Hyperelliptic Cryptosystems. In Advances in Cryptology - EUROCRYPT '99, volume 1592 of Lecture Notes in Computer Science, pages 165-175, Berlin, 1999. Springer-Verlag.
37. 2n. In Advances in Cryptology - ASIACRYPT '98, pages 80-94, Berlin, 1998. Springer Verlag. LNCS 1514.
38. Y. Sakai and K. Sakurai. On the Practical Performance of Hyperelliptic Curve Cryptosystems in Software Implementation. In IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, volume E83-A NO.4, pages 692-703, April 2000. IEICE Trans.
39. Y. Sakai, K. Sakurai, and H. Ishizuka. Secure Hyperelliptic Cryptosystems and their Performance. In Public Key Cryptography, pages 164-181, Berlin, 1998. Springer-Verlag. LNCS 1431.
40. M. Takahashi. Improving Harley Algorithms for Jacobians of Genus 2 Hyperelliptic Curves. In SCIS, IEICE Japan, 2002. in Japanese.
41. P. C. van Oorschot and M. J. Wiener. Parallel collision search with cryptanalytic applications. Journal of Cryptology, 12(1):1-28, Winter 1999.
42. T. Wollinger. Computer Architectures for Cryptosystems Based on Hyperelliptic Curves, 2001. Master Thesis, Worcester Polytechnic Institute.