Abstract
In hyperelliptic curve cryptography, finding a suitable hyperelliptic curve is an important fundamental problem. One of necessary conditions is that the order of its Jacobian is a product of a large prime number and a small number. In the paper, we give a probabilistic polynomial time algorithm to test whether the Jacobian of the given hyperelliptic curve of the form Y 2 = X 5 + u X 3 + v X satisfies the condition and, if so, to give the largest prime factor. Our algorithm enables us to generate random curves of the form until the order of its Jacobian is almost prime in the above sense. A key idea is to obtain candidates of its zeta function over the base field from its zeta function over the extension field where the Jacobian splits.
The original version of this chapter was revised: The copyright line was incorrect. This has been corrected. The Erratum to this chapter is available at DOI: 10.1007/978-3-642-01001-9_35
Chapter PDF
Similar content being viewed by others
References
Agrawal, M., Kayal, N., Saxena, N.: PRIMES is in P. Ann. of Math. 160, 781–793 (2004)
Anuradha, N.: Number of points on certain hyperelliptic curves defined over finite fields. Finite Fields Appl. 14, 314–328 (2008)
Berndt, B.C., Evans, R.J., Williams, K.S.: Gauss and Jacobi sums. John Wiley & Sons, Inc., New York (1998)
Cantor, D., Zassenhaus, H.: A new algorithm for factoring polynomials over finite fields. Math. Comp. 36, 587–592 (1981)
Cassels, J.W.S., Flynn, E.V.: Prolegomena to a middlebrow arithmetic of curves of genus 2. London Math. Soc. Lecture Note Series, vol. 230. Cambridge Univ. Press, Cambridge (1996)
Chebyshev, P.L.: Mémoire sur les nombres premiers. J. Math. Pures Appl. 17, 366–390 (1852) Œuvres, I-5
Duursma, I.M., Gaudry, P., Morain, F.: Speeding up the discrete log computation on curves with automorphisms. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol. 1716, pp. 103–121. Springer, Heidelberg (1999)
Elkies, N.D.: Elliptic and modular curves over finite fields and related computational issues. In: Buell, D.A., Teitelbaum, J.T. (eds.) Computational perspectives on number theory, Chicago, IL (1995); AMS/IP Stud. Adv. Math., vol. 7, pp. 21–76. AMS, Providence, RI (1998)
Frey, G., Kani, E.: Curves of genus 2 covering elliptic curves and an arithmetical application. In: van der Geer, G., Oort, F., Steenbrink, J. (eds.) Arithmetic algebraic geometry, Texel (1989); Progress in Math., vol. 89, pp. 153–176. Birkhäuser Boston, Boston (1991)
Frey, G., Rück, H.-G.: A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Math. Comp. 62, 865–874 (1994)
Furukawa, E., Kawazoe, M., Takahashi, T.: Counting points for hyperelliptic curves of type y 2 = x 5 + ax over finite prime fields. In: Matsui, M., Zuccherato, R.J. (eds.) SAC 2003. LNCS, vol. 3006, pp. 26–41. Springer, Heidelberg (2004)
Gallant, R.P., Lambert, R.J., Vanstone, S.A.: Faster point multiplication on elliptic curves with efficient endomorphisms. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 190–200. Springer, Heidelberg (2001)
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)
Gaudry, P.: Fast genus 2 arithmetic based on theta functions. J. Math. Cryptology 1, 243–265 (2007)
Gaudry, P.: Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem. J. Symbolic Comput. (2008), doi:10.1016/j.jsc.2008.08.005
Gaudry, P., Schost, É.: On the invariants of the quotients of the Jacobian of a curve of genus 2. In: Bozta, S., Sphparlinski, I. (eds.) AAECC 2001. LNCS, vol. 2227, pp. 373–386. Springer, Heidelberg (2001)
Gaudry, P., Schost, É.: Construction of secure random curves of genus 2 over prime fields. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 239–256. Springer, Heidelberg (2004)
Gaudry, P., Schost, É.: Hyperelliptic point counting record: 254 bit Jacobian. Post to NMBRTHRY list (June 22, 2008)
Haneda, M., Kawazoe, M., Takahashi, T.: Suitable curves for genus-4 HCC over prime fields: point counting formulae for hyperelliptic curves of type y 2 = x 2k + 1 + ax. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 539–550. Springer, Heidelberg (2005)
Hess, F., Seroussi, G., Smart, N.P.: Two topics in hyperelliptic cryptography. In: Vaudenay, S., Youssef, A.M. (eds.) SAC 2001. LNCS, vol. 2259, pp. 181–189. Springer, Heidelberg (2001)
Hitt, L.: On the minimal embedding field. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds.) Pairing 2007. LNCS, vol. 4575, pp. 294–301. Springer, Heidelberg (2007)
Kedlaya, K.: Counting points on hyperelliptic curves using Monsky-Washnitzer cohomology. J. Ramanujan Math. Soc. 16, 323–338 (2001)
Lauder, A.G.B.: Rigid cohomology and p-adic point counting. J. Théor. Nombres Bordeaux 17, 169–180 (2005)
Leprévost, F., Morain, F.: Revêtements de courbes elliptiques à multiplication complexe par des courbes hyperelliptiques et sommes de caractéres. J. Number Theory 64, 165–182 (1997)
Lercier, R.: Finding Good Random Elliptic Curves for Cryptosystems Defined over \(\mathbb{F}_{2^n}\). In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 379–392. Springer, Heidelberg (1997)
Lercier, R., Lubicz, D.: A quasi quadratic time algorithm for hyperelliptic curve point counting. Ramanujan J. 12, 399–423 (2006)
Matsuo, K., Chao, J., Tsujii, S.: An improved baby step giant step algorithm for point counting of hyperelliptic curves over finite fields. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol. 2369, pp. 461–474. Springer, Heidelberg (2002)
Maurer, M., Müller, V.: Finding the eigenvalue in Elkies’ algorithm. Experimental Math. 10, 275–285 (2001)
Milne, J.S.: Abelian varieties. In: Cornell, G., Silverman, J.H. (eds.) Arithmetic Geometry, pp. 103–150. Springer, New York (1986)
Milne, J.S.: Jacobian varieties. In: Cornell, G., Silverman, J.H. (eds.) Arithmetic Geometry, pp. 167–212. Springer, New York (1986)
Paulhus, J.: Decomposing Jacobians of curves with extra automorphisms. Acta Arith. 132, 231–244 (2008)
Pila, J.: Frobenius maps of Abelian varieties and finding roots of unity in finite fields. Math. Comp. 55, 745–763 (1990)
Pohlig, S.C., Hellman, M.E.: An improved algorithm for computing logarithms over GF (p) and its cryptographic significance. IEEE Trans. Info. Theory 24, 106–110 (1978)
Rück, H.G.: On the discrete logarithm in the divisor class group of curves. Math. Comp. 68, 805–806 (1999)
Scholten, J.: Weil restriction of an elliptic curve over a quadratic extension. preprint, http://homes.esat.kuleuven.be/~jscholte/
Schoof, R.: Elliptic curves over finite fields and the computation of square roots mod p. Math. Comp. 44, 483–494 (1985)
Schoof, R.: Counting points on elliptic curves over finite fields. J. Théor. Nombres Bordeaux 7, 219–254 (1995)
Sutherland, A.V.: A generic apporach to searching for Jacobians. Math. Comp. 78, 485–507 (2009)
Takashima, K.: A new type of fast endomorphisms on Jacobians of hyperelliptic curves and their cryptographic application. IEICE Trans. Fundamentals E89-A, 124–133 (2006)
Vercauteren, F.: Advances in point counting. In: Blake, I.F., Seroussi, G., Smart, N.P. (eds.) Advances in elliptic curve cryptography. London Math. Sco. Lecture Note Ser, vol. 317, pp. 103–132. Cambridge Univ. Press, Cambridge (2005)
Vercautern, F.: The SEA algorithm in characteristic 2, preprint (2000), http://homes.esat.kuleuven.be/~fvercaut/papers/SEA.pdf
von zur Gathen, J., Gerhard, J.: Modern computer algebra, 2nd edn. Cambridge UP, Cambridge (2003)
von zur Gathen, J., Shoup, V.: Computing Frobenius maps and factoring polynomials. Computational complexity 2, 187–224 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Satoh, T. (2009). Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields. In: Joux, A. (eds) Advances in Cryptology - EUROCRYPT 2009. EUROCRYPT 2009. Lecture Notes in Computer Science, vol 5479. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01001-9_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-01001-9_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01000-2
Online ISBN: 978-3-642-01001-9
eBook Packages: Computer ScienceComputer Science (R0)