Group law computations on Jacobians of hyperelliptic curves

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

Volumn 7118 LNCS, Issue , 2012, Pages 92-117

  Costello, Craig ^a,b,c   Lauter, Kristin ^c  

^a QUEENSLAND UNIVERSITY OF TECHNOLOGY   (Australia)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c MICROSOFT RESEARCH   (United States)

Author keywords

genus 2; group law; Hyperelliptic curves; Jacobian arithmetic

Indexed keywords

CRYPTOGRAPHIC SYSTEMS; EXPLICIT METHOD; GENUS 2; GEOMETRIC DESCRIPTION; GROUP LAW; GROUP OPERATIONS; HYPERELLIPTIC CURVE; JACOBIANS; POLYNOMIAL RINGS;

ALGORITHMS; LINEAR SYSTEMS;

CRYPTOGRAPHY;

EID: 84857727915     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-28496-0_6     Document Type: Conference Paper

References (54)

1. 3,4 curves over a large finite field. CoRR, abs/math/0610121 (2006)
2. Avanzi, R., Thériault, N., Wang, Z.: Rethinking low genus hyperelliptic Jacobian arithmetic over binary fields: interplay of field arithmetic and explicit formulæ. J. Math. Crypt. 2(3), 227-255 (2008)
3. Avanzi, R.M., Cohen, H., Doche, C., Frey, G., Lange, T., Nguyen, K., Vercauteren, F.: The Handbook of Elliptic and Hyperelliptic Curve Cryptography. CRC (2005)
4. Bernstein, D.J.: Elliptic vs. hyperelliptic, part I. Talk at ECC (September 2006)
5. Bernstein, D.J., Lange, T.: Explicit-formulas database, http://www.hyperelliptic.org/EFD
6. Cantor, D.G.: Computing in the Jacobian of a hyperelliptic curve. Math. Comp. 48(177), 95-101 (1987)
7. Ciet, M., Joye, M., Lauter, K., Montgomery, P.L.: Trading inversions for multiplications in elliptic curve cryptography. Designs, Codes and Cryptography 39(2), 189-206 (2006)
8. Diem, C.: An Index Calculus Algorithm for Plane Curves of Small Degree. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol. 4076, pp. 543-557. Springer, Heidelberg (2006)
9. Doche, C., Icart, T., Kohel, D.R.: Efficient scalar multiplication by isogeny decompositions. In: PKC 2006 [54], pp. 191-206 (2006)
10. Eisenträger, K., Lauter, K., Montgomery, P.L.: Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 343-354. Springer, Heidelberg (2003)
11. Erickson, S., Jacobson Jr., M.J., Shang, N., Shen, S., Stein, A.: Explicit Formulas for Real Hyperelliptic Curves of Genus 2 in Affine Representation. In: Carlet, C., Sunar, B. (eds.) WAIFI 2007. LNCS, vol. 4547, pp. 202-218. Springer, Heidelberg (2007)
12. Fan, X., Gong, G., Jao, D.: Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates. In: Avanzi, R.M., Keliher, L., Sica, F. (eds.) SAC 2008. LNCS, vol. 5381, pp. 18-34. Springer, Heidelberg (2009)
13. Flon, S., Oyono, R., Ritzenthaler, a.C.: Fast addition on non-hyperelliptic genus 3 curves. Algebraic geometry and its applications 5(3), 227-256 (2008)
14. Flon, S., Oyono, R.: Fast Arithmetic on Jacobians of Picard Curves. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 55-68. Springer, Heidelberg (2004)
15. Galbraith, S.D.: Mathematics of Public Key Cryptography, 0.9 edition (February 11, 2011), http://www.math.auckland.ac.nz/~sgal018/crypto-book/crypto- book.html
16. Galbraith, S.D., Harrison, M., Mireles Morales, D.J.: Efficient Hyperelliptic Arithmetic using Balanced Representation for Divisors. In: van der Poorten, A.J., Stein, A. (eds.) ANTS-VIII 2008. LNCS, vol. 5011, pp. 342-356. Springer, Heidelberg (2008) (Pubitemid 351775543)
17. Gaudry, P.: An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 19-34. Springer, Heidelberg (2000)
18. Gaudry, P.: Hyperelliptic curves and the HCDLP. London Mathematical Society Lecture Notes, vol. 317, ch. VII, pp. 133-150. Cambridge University Press (2005)
19. Gaudry, P.: Fast genus 2 arithmetic based on Theta functions. J. Math. Crypt. 1(3), 243-265 (2007)
20. Gaudry, P., Harley, R.: Counting Points on Hyperelliptic Curves Over Finite Fields. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol. 1838, pp. 313-332. Springer, Heidelberg (2000)
21. Gaudry, P., Thomé, E., Thériault, N., Diem, C.: A double large prime variation for small genus hyperelliptic index calculus. Math. Comp. 76(257), 475-492 (2007)
22. Gonda, M., Matsuo, K., Aoki, K., Chao, J., Tsujii, S.: Improvements of addition algorithm on genus 3 hyperelliptic curves and their implementation. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, 89-96 (2005)
23. Gurot, C., Kaveh, K., Patankar, V.M.: Explicit algorithm for the arithmetic on the hyperelliptic Jacobians of genus 3. Journal of the Ramanujan Mathematical Society 19, 75-115 (2004)
24. Harley, R.: Fast arithmetic on genus 2 curves, for C source code and further explanations, http://cristal.inria.fr/~harley/hyper
25. Hess, F.: Computing Riemann-Roch spaces in algebraic function fields and related topics. J. Symb. Comput. 33(4), 425-445 (2002)
26. Hisil, H.: Elliptic curves, group law, and efficient computation. PhD thesis, Queensland University of Technology (2010)
27. Huang, M.A., Ierardi, D.: Efficient algorithms for the Riemann-Roch problem and for addition in the Jacobian of a curve. J. Symb. Comput. 18(6), 519-539 (1994)
28. Katagi, M., Kitamura, I., Akishita, T., Takagi, T.: Novel Efficient Implementations of Hyperelliptic Curve Cryptosystems using Degenerate Divisors. In: Lim, C.H., Yung, M. (eds.) WISA 2004. LNCS, vol. 3325, pp. 345-359. Springer, Heidelberg (2005) (Pubitemid 41190824)
29. Khuri-Makdisi, K.: Linear algebra algorithms for divisors on an algebraic curve. Math. Comp. 73(245), 333-357 (2004)
30. Khuri-Makdisi, K.: Asymptotically fast group operations on jacobians of general curves. Math. Comp. 76(260), 2213-2239 (2007)
31. Koblitz, N.: Elliptic curve cryptosystems. Math. Comp. 48(177), 203-209 (1987)
32. Koblitz, N.: Hyperelliptic cryptosystems. J. Cryptology 1(3), 139-150 (1989)
33. Lang, S.: Introduction to algebraic geometry. Addison-Wesley (1972)
34. Lange, T.: Efficient arithmetic on hyperelliptic curves. PhD thesis, Universität- Gesamthochschule Essen (2001)
35. Lange, T.: Efficient arithmetic on genus 2 hyperelliptic curves over finite fields via explicit formulae. Cryptology ePrint Archive, Report 2002/121 (2002), http://eprint.iacr.org/
36. Lange, T.: Inversion-free arithmetic on genus 2 hyperelliptic curves. Cryptology ePrint Archive, Report 2002/147 (2002), http://eprint.iacr.org/
37. Lange, T.: Weighted coordinates on genus 2 hyperelliptic curves. Cryptology ePrint Archive, Report 2002/153 (2002), http://eprint.iacr.org/
38. Lange, T.: Formulae for arithmetic on genus 2 hyperelliptic curves. Appl. Algebra Eng. Commun. Comput. 15(5), 295-328 (2005)
39. Lange, T.: Elliptic vs. hyperelliptic, part II. Talk at ECC (September 2006)
40. Lauter, K.: The equivalence of the geometric and algebraic group laws for Jacobians of genus 2 curves. Topics in Algebraic and Noncommutative Geometry 324, 165-171 (2003)
41. Lauter, K., Montgomery, P.L., Naehrig, M.: An Analysis of Affine Coordinates for Pairing Computation. In: Joye, M., Miyaji, A., Otsuka, A. (eds.) Pairing 2010. LNCS, vol. 6487, pp. 1-20. Springer, Heidelberg (2010)
42. Leitenberger, F.: About the group law for the Jacobi variety of a hyperelliptic curve. Contributions to Algebra and Geometry 46(1), 125-130 (2005)
43. Matsuo, K., Chao, J., Tsujii, S.: Fast genus two hyperelliptic curve cryptosystems. Technical Report 214, IEIC (2001)
44. Miller, V.S.: Use of Elliptic Curves in Cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 417-426. Springer, Heidelberg (1986)
45. Miyamoto, Y., Doi, H., Matsuo, K., Chao, J., Tsujii, S.: A fast addition algorithm of genus two hyperelliptic curve. In: Symposium on Cryptography and Information Security - SCICS (2002) (in Japanese)
46. Mumford, D.: Tata lectures on theta II. In: Progress in Mathematics, vol. 43. Birkhiauser Boston Inc., Boston (1984)
47. Pollard, J.M.: Monte Carlo methods for index computation (mod p). Math. Comp. 32(143), 918-924 (1978)
48. Smith, B.: Isogenies and the discrete logarithm problem in Jacobians of genus 3 hyperelliptic curves. Journal of Cryptology 22(4), 505-529 (2009)
49. Sugizaki, H., Matsuo, K., Chao, J., Tsujii, S.: An extension of Harley addition algorithm for hyperelliptic curves over finite fields of characteristic two. Technical Report ISEC2002-9(2002-5), IEICE (2002)
50. Takahashi, M.: Improving Harley algorithms for Jacobians of genus 2 hyperelliptic curves. In: Symposium on Cryptography and Information Security - SCICS (2002) (in Japanese)
51. Wollinger, T.: Software and hardware implementation of hyperelliptic curve cryptosystems. PhD thesis, Ruhr-University of Bochum (2004)
52. Wollinger, T., Kovtun, V.: Fast explicit formulae for genus 2 hyperelliptic curves using projective coordinates. In: Fourth International Conference on Information Technology, pp. 893-897 (2007)
53. Wollinger, T., Pelzl, J., Paar, C.: Cantor versus Harley: optimization and analysis of explicit formulae for hyperelliptic curve cryptosystems. IEEE Transactions on Computers, 861-872 (2005)
54. Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.): PKC 2006. LNCS, vol. 3958. Springer, Heidelberg (2006)