On the practical performance of hyperelliptic curve cryptosystems in software implementation

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E83-A, Issue 4, 2000, Pages 692-701

  Sakai, Yasuyuki ^a   Sakurai, Kouichi ^b  

^a MITSUBISHI ELECTRIC CORPORATION   (Japan)

^b KYUSHU UNIVERSITY   (Japan)

Author keywords

Efficient implementation; Hyperelliptic curve cryptosystem; Jacobian; Lagrange reduction

Indexed keywords

HYPERELLIPTIC CURVE CRYPTOSYSTEMS;

COMPUTER SOFTWARE; DIGITAL ARITHMETIC; SECURITY OF DATA;

CRYPTOGRAPHY;

EID: 0033685799     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (39)

1. L.M. Adleman, J. DeMarrais, and M. Huang, "A subex-ponential algorithm for discrete logarithm over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fields," Algorithmic Number Theory I, LNCS, vol.877, pp.28-40, Springer-Verlag, 1998.
2. J. Buhler and N. Koblitz, "An application of lattice basis reduction to Jacobi sums and hyperelliptic cryptosystems," Preprint, 1997.
3. D.V. Bailey and C. Paar, "Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms," Advances in Cryptology-CRYPTO'98, LNCS, vol.1462, pp.472-485, Springer-Verlag, 1998.
4. T. Beth and F. Scaefer, "Non supersingular elliptic curves for public key cryptosystems," Advances in Cryptology-EUROCRYPT'91, LNCS, vol.547, pp.316-327, Springer-Verlag, 1991.
5. D.G. Cantor, "Computing in the Jacobian of a hyperelliptic curve," Math. Comp, vol.48, no.177, pp.95-101, 1987.
6. http://www.certicom.com/
7. H. Cohen, A. Miyaji, and T. Ono, "Efficient elliptic curve exponentiation using mixed coordinates," Advances in Cryptology - ASIACRYPT'98, LNCS, vol.1514, pp.51-65, Springer-Verlag, 1998.
8. J. Chao, K. Tanaka, and S. Tsujii, "Design of elliptic curves with controllable lower boundary of extension degree for reduction attacks," Advances in Cryptology-CRYPTO'94, LNCS, vol.839, pp.50-55, Springer-Verlag, 1994.
9. I. Duursma, P. Gaudry, and F. Morain, "Speeding up the discrete log computation on curves with automorphisms," Advances in Cryptology - ASIACRYPT99, LNCS, vol.1716, pp. 103-121, Springer-Verlag, 1999.
10. Alpha Architecture Handbook version 4, Compaq, http://ftp.digital.com
11. A. Enge, "The extended Euclidean algorithm on polynomials, and the efficiency of hyperelliptic cryptosystems," Preprint, 1998.
12. A. Enge, "Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time," Tech. Report from Center for Applied Cryptographic Research at the University of Waterloo, CORE 99-04, 1999.
13. G. Frey, M. Müller, and H.G. Rück, "The tate pairing and the discrete logarithm applied to elliptic curve cryptosystems," Preprints der Arbeits-gruppe Zahlentheorie, 1998. http://www.exp-math.uniessen.de/zahlentheorie/preprints/Index.html
14. G. Frey and H.G. Rück, "A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves," Math. Comp, vol.62, no.206, pp.865-874, 1994.
15. P. Gaudry, "A variant of the Adleman-DeMarrais-Huang algorithm and its application to small genera," LIX Research Report LIX/RR/99/04, presented in Conference on The Mathematics of Public Key Cryptography, Toronto, 1999.
16. J. Guajardo and C. Paar, "Efficient Algorithms for Elliptic Curve Cryptosystems," Advances in Cryptology-CRYPTO'97, LNCS, vol.1294, pp.342-356, Springer-Verlag, 1997.
17. R. Gallant, R. Lambert, and S. Vanstone, "Improving the parallelized Pollard lambda search on binary anomalous curves," http://grouper.ieee.org/groups/1363/contrib.html, April 1998.
18. N. Koblitz, "Elliptic curve cryptosystems," Mathematics of Computation, vol.48, pp.203-209, 1987.
19. N. Koblitz, "A family of Jacobians suitable for discrete log cryptosystems," Advances in Cryptology - CRYPTO'88, LNCS, vol.403, pp.94-99, Springer-Verlag, 1988.
20. N. Koblitz, "Hyperelliptic Cryptosystems," J. Cryptology, vol.1, pp.139-150, Springer-Verlag, 1989.
21. N. Koblitz, Algebraic Aspects of Cryptography, Springer - Verlag, 1998.
22. A. Lenstra, H. Lenstra, and L. Lovasz, "Factoring polynomials with rational coefficients," Math. Ann., vol.261, pp.515-534, 1982.
23. V. Miller, "Uses of elliptic curves in cryptography," Advances in Cryptology-CRYPTO'85, LNCS, vol.218, pp.417-426, Springer-Verlag, 1986.
24. A.J. Menezes, T. Okamoto, and S.A. Vanstone, "Reducing elliptic curve logarithm to logarithm in a finite field," IEEE Trans, on IT, vol.39, pp. 1639-1646, 1993.
25. S.C. Pohlig and M.E. Hellman, "An improved algorithm for computing logarithms over GF(p) and its cryptographic significance," IEEE Trans, on IT, vol.24, pp.106-110, 1978.
26. S. Paulus and A. Stein, "Comparing real and imaginary arithmetics for divisor class groups of hyperelliptic curves," Algorithmic Number Theory III, LNCS, vol.1423, pp.80-94, Springer-Verlag, 1998.
27. H.G. Rück, "On the discrete logarithms in the divisor class group of curves," Mathematics of Computation, vol.68, pp.805-806, 1999.
28. http://www.rsa.com
29. T. Satoh and K. Araki, "Fermat quotients and the polynomial time discrete log algorithm for anomalous elliptic curves," Comm. Math. Univ. Sancti. Pauli, vol.47, pp.81-92, 1998.
30. I.A. Semaev, "Evaluation of discrete logarithms in a group of p-torsion points of an elliptic curve in characteristic p," Math. Comp., vol.76, pp.353-356, 1998.
31. N.P. Smart, "The discrete logarithm problem on elliptic curves of trace one," J. Cryptology, vol.12, pp.193-196, Springer-Verlag, 1999.
32. N.P. Smart, "On the performance of hyperelliptic cryptosystems," Advances in Cryptology-EUROCRYPT'99, LNCS, vol.1592, pp.165-175, Springer-Verlag, 1999.
33. J.A. Solinas, "An improved algorithm for arithmetic on a family of elliptic curves," Advances in Cryptology-CRYPTO'97, LNCS, vol.1291, pp.357-371, Springer-Verlag, 1997.
34. 2n," Advances in Cryptology - ASIACRYPT'98, LNCS, vol.1514, pp.80-94, Springer-Verlag, 1998.
35. Y. Sakai, K. Sakurai, and H. Ishizuka, "Secure hyperelliptic cryptosystems and their performance," Public Key Cryptography, PKC'98, LNCS, vol.1431, pp.164-181, Springer-Verlag, 1998.
36. H. Stichtenoth, Algebraic Function Fields and Codes, Springer-Verlag, 1993.
37. n)," Advances in Cryptology-ASIACRYPT'96, LNCS, vol.1163, pp.65-76, Springer-Verlag, 1996.
38. E.D. Win, S. Mister, B. Preneel, and M. Wiener, "On the performance of signature schemes based on elliptic curves," Algorithmic Number Theory III, LNCS, vol.1423, pp.252-266, Springer-Verlag, 1998.
39. M. Wiener and R. Zuccherato, "Faster attacks on elliptic curve cryptosystems," http://grouper.ieee.org/groups/ 1363/contrib.html, 1998.