Improvements of addition algorithm on genus 3 hyperelliptic curves and their implementation

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E88-A, Issue 1, 2005, Pages 89-96

  Gonda, Masaki ^a   Matsuo, Kazuto ^a,b   Aoki, Kazumaro ^c,d   Chao, Jinhui ^a   Tsujii, Shigeo ^a,b,e,f,g  

^a CHUO UNIVERSITY   (Japan)

^b INSTITUTE OF INFORMATION SECURITY   (Japan)

^c NTT CORPORATION   (Japan)

^d International Association for Cryptologic Research

^e TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^f Japan Science Council   (Japan)

^g IEEE

Author keywords

Addition algorithm; Cantor algorithm; Genus 3 hyperelliptic curves; Harley algorithm; Hyperelliptic curve cryptosystems; Toom's multiplication

Indexed keywords

COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY;

ADDITION ALGORITHM; CANTOR ALGORITHM; GENUS 3 HYPERELLIPTIC CURVES; HARLEY ALGORITHM; HYPERELLIPTIC CURVE CRYPTOSYSTEMS; TOOM'S MULTIPLICATION;

ALGORITHMS;

EID: 27544481767     PISSN: 09168508     EISSN: 17451337     Source Type: Journal    
DOI: 10.1093/ietfec/E88-A.1.89     Document Type: Conference Paper

References (37)

1. K. Aoki, F. Hoshino, and T. Kobayashi, "The fastest ECC implementations," Proc. SCIS2000, B05, 2000.
2. K. Aoki, F. Hoshino, and T. Kobayashi, "A cyclic window algorithm for ECC defined over extension fields," in Information and Communications Security, ed. S. Qing, T. Okamoto, and J. Zhou, LNCS 2229, pp.62-73, Springer-Verlag, 2001.
3. R.M. Avanzi, "Aspects of hyperelliptic curves over large prime fields in software implementations," Cryptology ePrint Archive, Report 2003/253, 2003, http://eprint.iacr.org/
4. D.V. Bailey and C. Paar, "Optimal extension fields for fast arithmetic in public-key algorithms," Advances in Cryptology - CRYPTO '98, ed. H. Krawczyk, LNCS 1462, pp.472-485, Springer-Verlag, 1998.
5. D. Bernstein, "Multidigit multiplication for mathematicians," 2001, manuscript, ftp://koobera.math.uic.edu/pub/papers/m3.dvi
6. I. Blake, G. Seroussi, and N. Smart, Elliptic Curves in Cryptography, LMS 265, Cambridge U.P., 1999.
7. D.G. Cantor, "Computing in the Jacobian of hyperelliptic curve," Math. Comput., vol.48, no.177, pp.95-101, 1987.
8. H. Cohen, A Course in Computational Algebraic Number Theory, Graduate Text in Mathematics, no.138, Springer-Verlag, 1993.
9. F.S. Foundation, "GNU MP," http://www.swox.com/gmp/manual/, 2003.
10. P. Gaudry, "An algorithm for solving the discrete log problem on hyperelliptic curves," Advances in Cryptology - EUROCRYPT 2000, ed. B. Preneel, LNCS 1807, pp. 19-34, Springer-Verlag, 2000.
11. P. Gaudry and R. Harley, "Counting points on hyperelliptic curves over finite fields," ANTS-IV, ed. W. Bosma, LNCS 1838, pp.313-332, Springer-Verlag, 2000.
12. R. Harley, "adding.text, doubling.c," http://cristal.inria.fr/ ~harley/hyper/, 2000.
13. A. Karatsuba and Y. Ofman, "Multiplication of multidigit numbers on automata," Soviet Physics Doklady, vol.7, pp.595-596, 1963.
14. 2n," Cryptology ePrint Archive, Report 2003/248, 2003, http://eprint.iacr.org/
15. J. Kuroki, M. Gonda, K. Matsuo, J. Chao, and S. Tsujii, "Fast genus three hyperelliptic curve cryptosystems," Proc. SCIS2002, pp.503-507, 2002.
16. 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/
17. T. Lange, "Inversion-free arithmetic on genus 2 hyperelliptic curves," Cryptology ePrint Archive, Report 2002/147, 2002, http://eprint.iacr.org/
18. T. Lange, "Weighted coordinates on genus 2 hyperelliptic curves," Cryptology ePrint Archive, Report 2002/153, 2002, http://eprint.iacr.org/
19. K. Matsuo and J. Chao, "Fast genus two hyperelliptic curve cryptosystems," Talk at the 2nd workshop on cryptology and algebraic curves, Chuo U., http://www.tsujii-lab.ise.chuo-u.ac.jp/hyper/pdf/mats_ohp0108. pdf, 2001.
20. K. Matsuo, J. Chao, and S. Tsujii, "Fast genus two hyperelliptic curve cryptosystems," IEICE Technical Report, ISEC2001-31, 2001.
21. P.K. Mishra and P. Sarka, "Parallelizing explicit formula for arithmetic in the Jacobian of hyperelliptic curves," Advances in Cryptology - ASIACRYPT 2003, ed. C.S. Laih, LNCS 2894, pp.93-110, Springer-Verlag, 2003.
22. Y. Miyamoto, H. Doi, K. Matsuo, J. Chao, and S. Tsujii, "A fast addition algorithm of genus two hyperelliptic curves," Proc. SCIS2002, pp.497-502, 2002.
23. D. Mumford, Tata Lectures on Theta II, Progress in Mathematics, no.43, Birkhäuser, 1984.
24. K. Nagao, "Improving group law algorithms for Jacobians of hyperelliptic curves," ANTS-IV, ed. W. Bosma, LNCS 1838, pp.439-448, Springer-Verlag, 2000.
25. J. Pelzl, T. Wollinger, J. Guajardo, and C. Paar, "Hyperelliptic curve cryptosystems: Closing the performance gap to elliptic curves," CHESS 2003, ed. C.D. Walter and Ç.K. Koç, LNCS2779, pp.351-365, Springer-Verlag, 2003.
26. J. Pelzl, T. Wollinger, and C. Paar, "High performance arithmetic for hyperelliptic curve cryptosystems of genus two," Cryptology ePrint Archive, Report 2003/212, 2003, http://eprint.iacr.org/
27. J. Pelzl, T. Wollinger, and C. Paar, "Low cost security: Explicit formulae for genus 4 hyperelliptic curves," SAC 2003, ed. M. Matsui and R.J. Zucherato, LNCS 3006, pp.1-16, Springer-Verlag, 2000.
28. V. Shoup, "A tour of NTL," http://www.shoup.net/ntl/, 2003.
29. H. Stichtenoth, Algebraic function fields and codes, Universitext, Springer-Verlag, 1993.
30. H. Sugizaki, K. Matsuo, J. Chao, and S. Tsujii, "An extension of Harley addition algorithm for hyperelliptic curves over finite fields of characteristic two," IEICE Technical Report, ISEC2002-9, 2002.
31. H. Sugizaki, K. Matsuo, J. Chao, and S. Tsujii, "A generalized Harley algorithm for genus two hyperelliptic curves," Proc. SCIS2003, pp.917-921, 2003.
32. M. Takahashi, "Improving Harley algorithms for Jacobians of genus 2 hyperelliptic curves," Proc. SCIS2002, pp.155-160, 2002.
33. N. Takahashi and M. Miyaji, "Efficient exponentiation on genus two hyperelliptic curves," IEICE Technical Report, ISEC2002-102, 2002.
34. N. Takahashi, H. Morimoto, and M. Miyaji, "Efficient exponentiation on genus two hyperelliptic curves (ii)," IEICE Technical Report, ISEC2002-145, 2003.
35. N. Thériault, "Index calculus attack for hyperelliptic curves of small genus," Advances in Cryptology - ASIACRYPT 2003, ed. C.S. Laih, LNCS 2894, pp.75-92, Springer-Verlag, 2003.
36. A.L. Toom, "The complexity of a scheme of functional elements realizing the multiplication of integers," Soviet Mathematics Doklady, vol.3, pp.714-716, 1963.
37. H.S. Warren, Jr., Hacker's delight, Addison Wesley, 2003.