Rethinking low genus hyperelliptic Jacobian arithmetic over binary fields: Interplay of field arithmetic and explicit formulæ

Journal of Mathematical Cryptology

Volumn 2, Issue 3, 2008, Pages 227-255

  Avanzi, R ^a   Theriault N ^b   Wang, Z ^c  

^a RUHR UNIVERSITY BOCHUM   (Germany)

^b UNIVERSIDAD DE TALCA   (Chile)

^c UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Cryptography; Efficient implementation; Elliptic and hyperelliptic curves; Explicit formul

Indexed keywords

EID: 84863338116     PISSN: 18622976     EISSN: 18622984     Source Type: Journal    
DOI: 10.1515/JMC.2008.011     Document Type: Article

References (50)

1. R. Avanzi, Aspects of hyperelliptic curves over large prime fields in software implementations. Cryptographic Hardware and Embedded Systems - CHES 2004, Lecture Notes in Computer Science 3156, pp. 148-162. Springer-Verlag, 2004.
2. -, A Note on the Signed Sliding Window Integer Recoding and its Left-to-Right Ana- logue. Selected Areas in Cryptography - SAC 2004, Lecture Notes in Computer Science 3357, pp. 130-143. Springer-Verlag, 2005. (Pubitemid 41228735)
3. -, Another Look at Square Roots (and Other Less Common Operations) in Fields of Even Characteristic. Selected Areas in Cryptography - SAC 2007, Lecture Notes in Computer Science 4876, pp. 138-154. Springer-Verlag, 2007. (Pubitemid 351153083)
4. R. Avanzi, H. Cohen, C. Doche, G. Frey, T. Lange, K. Nguyen, and F. Vercauteren, The Handbook of Elliptic and Hyperelliptic Curve Cryptography. CRC Press, 2006.
5. R. Avanzi and N. Thériault, Effects of Optimizations for Software Implementations of Small Binary Field Arithmetic. WAIFI 2007, Lecture Notes in Computer Science 4547, pp. 69-84. Springer-Verlag, 2007.
6. I. F. Blake, G. Seroussi, and N. P. Smart, Elliptic curves in cryptography, London Mathematical Society Lecture Note Series 265. Cambridge University Press, 1999.
7. -, Advances in Elliptic Curve Cryptography, London Mathematical Society Lecture Note Series 317. Cambridge University Press, 2005.
8. D. G. Cantor, Computing in the Jacobian ofhyperelliptic curves, Mathematics of Computation 48(1987), pp. 95-101.
9. ECRYPT, Ecrypt yearly report on algorithms and keysizes, ECRYPT, Report, 2005.
10. A. Enge, Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time, Mathematics of Computation 71 (2002), pp. 729-742.
11. X. Fan, T. Wollinger, and Y Wang, Efficient Doubling on Genus 3 Curves over Binary Fields. Topics in Cryptology - CT-RSA 2006, Lecture Notes in Computer Science 3860, pp. 64-81. Springer-Verlag, 2006. (Pubitemid 43977220)
12. FIPS 186-2, Digital Signature Standard (DSS), Federal Information Processing Standards Publication 186-2, 2000.
13. K. Fong, D. Hankerson, J. Lopez, and A. Menezes, Field Inversion and Point Halving Revisited, IEEE Transactions on Computers 53 (2004), pp. 1047-1059.
14. G. Frey and H. Rück, A remark concerning m-divisibility and the discrete logarithm problem in the divisor class group of curves, Mathematics of Computation 62 (1994), pp. 865-874.
15. S. D. Galbraith, Supersingular Curves in Cryptography. Advances in Cryptology - Asiacrypt 2001, Lecture Notes in Computer Science 2248, pp. 49-513. Springer-Verlag, 2001.
16. P. Gaudry, Index calculus for abelian varieties and the elliptic curve discrete logarithm problem, to appear, Journal of Symbolic Computation, 2007.
17. P. Gaudry, F. Hess, and N. P. Smart, Constructive and destructive facets of Weil descent on elliptic curves, Journal of Cryptology 15 (2002), pp. 19-46. (Pubitemid 44126469)
18. P. Gaudry, E. Thomé, N. Thériault, and C. Diem, A double large prime variation for small genus hyperelliptic index calculus, Mathematics of Computation 76 (2007), pp. 475-92.
19. C. Guyot, K. Kaveh, and V. M. Patankar, Explicit algorithm for the arithmetic on the hyperelliptic Jacobians of genus 3, Journal of the Ramanujan Mathematical Society 19 (2004), pp. 75-115.
20. D. Hankerson, A. J. Menezes, and S. A. Vanstone, Guide to elliptic curve cryptography. Springer-Verlag, 2003.
21. R. Harley, Fast arithmetic on genus two curves, preprint, 2000.
22. F. Hess, The GHS Attack Revisited. Advances in Cryptology - Eurocrypt 2003, Lecture Notes in Computer Science 2656, pp. 374-387. Springer-Verlag, 2003.
23. N. Koblitz, Elliptic curve cryptosystems, Mathematics of Computation 48 (1987), pp. 203-209.
24. -, Hyperelliptic cryptosystems, Journal of Cryptology 1 (1989), pp. 139-150.
25. J. Kuroki, M. Gonda, K. Matsuo, J. Chao, and S. Tsujii, Fast genus three hyperelliptic curve cryptosystems. The 2002 Symposium on Cryptography and Information Security, Japan - SCIS 2002, 29 Jan. -1 Feb., 2002.
26. T. Lange, Formulae for arithmetic on genus 2 hyperelliptic curves, Appl. Algebra Engrg. Comm. Comput. 15 (2005), pp. 295-328. (Pubitemid 40226354)
27. T. Lange and M. Stevens, Efficient doubling for genus two curves over binary fields. Selected Areas in Cryptography - SAC 2004, Lecture Notes in Computer Science 3357, pp. 170-181. Springer-Verlag, 2005. (Pubitemid 41228737)
28. A. K. Lenstra and E. R. Verheul, Selecting Cryptographic Key Sizes, Journal of Cryptology 14 (2001), pp. 255-293. (Pubitemid 33770276)
29. J. Lopez and R. Dahab, High-speed software multiplication in ¥2™ ■ Progress in Cryptology -INDOCRYPT 2000, Lecture Notes in Computer Science 1977, pp. 203-212. Springer-Verlag, 2000. (Pubitemid 33210851)
30. K. Matsuo, J. Chao, and S. Tsujii, Fast genus two hyperelliptic curve crypto systems. ISEC2001-31.IEICE, 2001.
31. A. Menezes, T. Okamoto, and S. Vanstone, Reducing elliptic curve logarithms in a finite field, IEEE Transactions on Information Theory IT-39 (1993), pp. 1639-1646.
32. A. Menezes and E. Teske, Cryptographic Implications of Hess ' Generalized GHS Attack, Appl. Algebra Engrg. Comm. Comput. 16 (2006), pp. 439-460. (Pubitemid 43152917)
33. A. Menezes, Y.-H. Wu, and R. Zuccherato, An Elementary Introduction to Hyperelliptic Curves, Algebraic aspects of cryptography (N. Koblitz, ed.), Springer-Verlag, 1998, pp. 155-178.
34. A. Miayaji, H. Cohen, and T. Ono, Efficient elliptic curve exponentiation. Information and Communication Security - IOCS 1997, Lecture Notes in Computer Science 1334, pp. 282-290. Springer-Verlag, 1997.
35. V. S. Miller, Use of elliptic curves in cryptography. Advances in Cryptology - Crypto 1985, Lecture Notes in Computer Science 218, pp. 417-426. Springer-Ver lag, 1986.
36. D. Mumford, Tata Lectures on Theta II. Birkhäuser, 1984.
37. K. Nagao, Improving group law algorithms for Jacobians of hyperelliptic curves. Algorithmic Number Theory - ANTS-IV, Lecture Notes in Computer Science 1838, pp. 439-48. Springer-Verlag, 2000.
38. -, Improvement of Thériault Algorithm of Index Calculus for Jacobian of Hyperelliptic Curves of Small Genus, preprint, 2004.
39. NIST, Key Management Guideline - Workshop Document, Draft, October 2001.
40. J. Pelzl, T. Wollinger, J. Guajardo, and C. Paar, Hyperelliptic curve crypto systems: closing the performance gap to elliptic curves. Cryptography Hardware and Embedded Systems - CHES 2003, Lecture Notes in Computer Science 2779, pp. 351-365. Springer-Verlag, 2003.
41. J. Pelzl, T. Wollinger, andC. Paar, High Performance Arithmetic for Hyperelliptic Curve Cryp-tosystems of Genus Two. Information Technology: Coding and Computing - ITCC 2004, 2, pp. 513-517, 2004.
42. -, Low cost Security: Explicit Formulae f or Genus 4 Hyperelliptic Curves. Selected Areas in Cryptography - SAC 2003, Lecture Notes in Computer Science 3006, pp. 1-16. Springer-Verlag, 2004.
43. J. Scholten and H. J. Zhu, Hyperelliptic Curves in Characteristic 2, Inter. Math. Research Notices 17 (2002), pp. 905-917.
44. V. Shoup, NTL: A Library for doing number theory.
45. B. Smith, Isogenies and the Discrete Logarithm Problem on Jacobians of Genus 3 Hyperelliptic Curves. Advances in Cryptology - EUROCRYPT 2008, Lecture Notes in Computer Science 4965, pp. 163-180. Springer-Verlag, 2008. (Pubitemid 351762829)
46. J. A. Solinas, An improved algorithm for arithmetic on a family of elliptic curves. Advances in Cryptology - CRYPTO '97, Lecture Notes in Computer Science 1294, pp. 357-371. Springer-Verlag, 1997. (Pubitemid 127112565)
47. -, Improved Algorithms for Arithmetic on Anomalous Binary Curves, University of Wa terloo, Combinatorics and Optimization Research Report no. CORR 99-46, 1999. updated and corrected version of [46].
48. N. Thériault, Weil Descent for Artin-Schreier Curves, preprint, 2003.
49. N. Thériault (with R. Avanzi), Towards an Exact Cost Analysis of Index Calculus Algorithms, Presented at ECC 2006.
50. T. Wollinger, J. Pelzl, and C. Paar, Cantor versus Harley: Optimization and Analysis of Explicit Formulae for Hyperelliptic Curve Crypto systems, IEEE Transactions on Computers 54 (2005), pp. 861-872. (Pubitemid 41055319)