{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:21:34Z","timestamp":1774369294791,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":45,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642010002","type":"print"},{"value":"9783642010019","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01001-9_31","type":"book-chapter","created":{"date-parts":[[2009,4,15]],"date-time":"2009-04-15T08:38:25Z","timestamp":1239784705000},"page":"536-553","source":"Crossref","is-referenced-by-count":13,"title":["Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields"],"prefix":"10.1007","author":[{"given":"Takakazu","family":"Satoh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"publisher","first-page":"781","DOI":"10.4007\/annals.2004.160.781","volume":"160","author":"M. Agrawal","year":"2004","unstructured":"Agrawal, M., Kayal, N., Saxena, N.: PRIMES is in P. Ann. of Math.\u00a0160, 781\u2013793 (2004)","journal-title":"Ann. of Math."},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1016\/j.ffa.2006.12.007","volume":"14","author":"N. Anuradha","year":"2008","unstructured":"Anuradha, N.: Number of points on certain hyperelliptic curves defined over finite fields. Finite Fields Appl.\u00a014, 314\u2013328 (2008)","journal-title":"Finite Fields Appl."},{"key":"31_CR3","volume-title":"Gauss and Jacobi sums","author":"B.C. Berndt","year":"1998","unstructured":"Berndt, B.C., Evans, R.J., Williams, K.S.: Gauss and Jacobi sums. John Wiley & Sons, Inc., New York (1998)"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1090\/S0025-5718-1981-0606517-5","volume":"36","author":"D. Cantor","year":"1981","unstructured":"Cantor, D., Zassenhaus, H.: A new algorithm for factoring polynomials over finite fields. Math. Comp.\u00a036, 587\u2013592 (1981)","journal-title":"Math. Comp."},{"key":"31_CR5","series-title":"London Math. Soc. Lecture Note Series","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511526084","volume-title":"Prolegomena to a middlebrow arithmetic of curves of genus 2","author":"J.W.S. Cassels","year":"1996","unstructured":"Cassels, J.W.S., Flynn, E.V.: Prolegomena to a middlebrow arithmetic of curves of genus 2. London Math. Soc. Lecture Note Series, vol.\u00a0230. Cambridge Univ. Press, Cambridge (1996)"},{"key":"31_CR6","first-page":"366","volume":"17","author":"P.L. Chebyshev","year":"1852","unstructured":"Chebyshev, P.L.: M\u00e9moire sur les nombres premiers. J. Math. Pures Appl.\u00a017, 366\u2013390 (1852) \u0152uvres, I-5","journal-title":"J. Math. Pures Appl."},{"key":"31_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-540-48000-6_10","volume-title":"Advances in Cryptology - ASIACRYPT\u201999","author":"I.M. Duursma","year":"1999","unstructured":"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.\u00a01716, pp. 103\u2013121. Springer, Heidelberg (1999)"},{"key":"#cr-split#-31_CR8.1","unstructured":"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);"},{"key":"#cr-split#-31_CR8.2","unstructured":"AMS\/IP Stud. Adv. Math., vol. 7, pp. 21???76. AMS, Providence, RI (1998)"},{"key":"#cr-split#-31_CR9.1","unstructured":"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);"},{"key":"#cr-split#-31_CR9.2","unstructured":"Progress in Math., vol. 89, pp. 153???176. Birkh??user Boston, Boston (1991)"},{"key":"31_CR10","first-page":"865","volume":"62","author":"G. Frey","year":"1994","unstructured":"Frey, G., R\u00fcck, H.-G.: A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves. Math. Comp.\u00a062, 865\u2013874 (1994)","journal-title":"Math. Comp."},{"key":"31_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-540-24654-1_3","volume-title":"Selected Areas in Cryptography","author":"E. Furukawa","year":"2004","unstructured":"Furukawa, E., Kawazoe, M., Takahashi, T.: Counting points for hyperelliptic curves of type y\n                  2\u2009=\u2009x\n                  5\u2009+\u2009ax over finite prime fields. In: Matsui, M., Zuccherato, R.J. (eds.) SAC 2003. LNCS, vol.\u00a03006, pp. 26\u201341. Springer, Heidelberg (2004)"},{"key":"31_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-44647-8_11","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"R.P. Gallant","year":"2001","unstructured":"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.\u00a02139, pp. 190\u2013200. Springer, Heidelberg (2001)"},{"key":"31_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-45539-6_2","volume-title":"Advances in Cryptology - EUROCRYPT 2000","author":"P. Gaudry","year":"2000","unstructured":"Gaudry, P.: An algorithm for solving the discrete log problem on hyperelliptic curves. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol.\u00a01807, pp. 19\u201334. Springer, Heidelberg (2000)"},{"key":"31_CR14","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1515\/JMC.2007.012","volume":"1","author":"P. Gaudry","year":"2007","unstructured":"Gaudry, P.: Fast genus 2 arithmetic based on theta functions. J. Math. Cryptology\u00a01, 243\u2013265 (2007)","journal-title":"J. Math. Cryptology"},{"key":"31_CR15","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1016\/j.jsc.2008.08.005"},{"key":"31_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/3-540-45624-4_39","volume-title":"Applied Algebra, Algebraic Algorithms and Error-Correcting Codes","author":"P. Gaudry","year":"2001","unstructured":"Gaudry, P., Schost, \u00c9.: 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.\u00a02227, pp. 373\u2013386. Springer, Heidelberg (2001)"},{"key":"31_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-540-24676-3_15","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"P. Gaudry","year":"2004","unstructured":"Gaudry, P., Schost, \u00c9.: Construction of secure random curves of genus 2 over prime fields. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 239\u2013256. Springer, Heidelberg (2004)"},{"key":"31_CR18","unstructured":"Gaudry, P., Schost, \u00c9.: Hyperelliptic point counting record: 254 bit Jacobian. Post to NMBRTHRY list (June 22, 2008)"},{"key":"31_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1007\/11523468_44","volume-title":"Automata, Languages and Programming","author":"M. Haneda","year":"2005","unstructured":"Haneda, M., Kawazoe, M., Takahashi, T.: Suitable curves for genus-4 HCC over prime fields: point counting formulae for hyperelliptic curves of type y\n                  2\u2009=\u2009x\n                  2k\u2009+\u20091\u2009+\u2009ax. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 539\u2013550. Springer, Heidelberg (2005)"},{"key":"31_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/3-540-45537-X_14","volume-title":"Selected Areas in Cryptography","author":"F. Hess","year":"2001","unstructured":"Hess, F., Seroussi, G., Smart, N.P.: Two topics in hyperelliptic cryptography. In: Vaudenay, S., Youssef, A.M. (eds.) SAC 2001. LNCS, vol.\u00a02259, pp. 181\u2013189. Springer, Heidelberg (2001)"},{"key":"31_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-73489-5_16","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2007","author":"L. Hitt","year":"2007","unstructured":"Hitt, L.: On the minimal embedding field. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds.) Pairing 2007. LNCS, vol.\u00a04575, pp. 294\u2013301. Springer, Heidelberg (2007)"},{"key":"31_CR22","first-page":"323","volume":"16","author":"K. Kedlaya","year":"2001","unstructured":"Kedlaya, K.: Counting points on hyperelliptic curves using Monsky-Washnitzer cohomology. J. Ramanujan Math. Soc.\u00a016, 323\u2013338 (2001)","journal-title":"J. Ramanujan Math. Soc."},{"key":"31_CR23","doi-asserted-by":"publisher","first-page":"169","DOI":"10.5802\/jtnb.484","volume":"17","author":"A.G.B. Lauder","year":"2005","unstructured":"Lauder, A.G.B.: Rigid cohomology and p-adic point counting. J. Th\u00e9or. Nombres Bordeaux\u00a017, 169\u2013180 (2005)","journal-title":"J. Th\u00e9or. Nombres Bordeaux"},{"key":"31_CR24","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1006\/jnth.1997.2070","volume":"64","author":"F. Lepr\u00e9vost","year":"1997","unstructured":"Lepr\u00e9vost, F., Morain, F.: Rev\u00eatements de courbes elliptiques \u00e0 multiplication complexe par des courbes hyperelliptiques et sommes de caract\u00e9res. J. Number Theory\u00a064, 165\u2013182 (1997)","journal-title":"J. Number Theory"},{"key":"31_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/3-540-69053-0_26","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"R. Lercier","year":"1997","unstructured":"Lercier, R.: Finding Good Random Elliptic Curves for Cryptosystems Defined over \n                    \n                      \n                    \n                    $\\mathbb{F}_{2^n}$\n                  . In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 379\u2013392. Springer, Heidelberg (1997)"},{"key":"31_CR26","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/s11139-006-0151-6","volume":"12","author":"R. Lercier","year":"2006","unstructured":"Lercier, R., Lubicz, D.: A quasi quadratic time algorithm for hyperelliptic curve point counting. Ramanujan J.\u00a012, 399\u2013423 (2006)","journal-title":"Ramanujan J."},{"key":"31_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/3-540-45455-1_36","volume-title":"Algorithmic Number Theory","author":"K. Matsuo","year":"2002","unstructured":"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.\u00a02369, pp. 461\u2013474. Springer, Heidelberg (2002)"},{"key":"31_CR28","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1080\/10586458.2001.10504448","volume":"10","author":"M. Maurer","year":"2001","unstructured":"Maurer, M., M\u00fcller, V.: Finding the eigenvalue in Elkies\u2019 algorithm. Experimental Math.\u00a010, 275\u2013285 (2001)","journal-title":"Experimental Math."},{"key":"31_CR29","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-1-4613-8655-1_5","volume-title":"Arithmetic Geometry","author":"J.S. Milne","year":"1986","unstructured":"Milne, J.S.: Abelian varieties. In: Cornell, G., Silverman, J.H. (eds.) Arithmetic Geometry, pp. 103\u2013150. Springer, New York (1986)"},{"key":"31_CR30","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-1-4613-8655-1_7","volume-title":"Arithmetic Geometry","author":"J.S. Milne","year":"1986","unstructured":"Milne, J.S.: Jacobian varieties. In: Cornell, G., Silverman, J.H. (eds.) Arithmetic Geometry, pp. 167\u2013212. Springer, New York (1986)"},{"key":"31_CR31","doi-asserted-by":"publisher","first-page":"231","DOI":"10.4064\/aa132-3-3","volume":"132","author":"J. Paulhus","year":"2008","unstructured":"Paulhus, J.: Decomposing Jacobians of curves with extra automorphisms. Acta Arith.\u00a0132, 231\u2013244 (2008)","journal-title":"Acta Arith."},{"key":"31_CR32","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1090\/S0025-5718-1990-1035941-X","volume":"55","author":"J. Pila","year":"1990","unstructured":"Pila, J.: Frobenius maps of Abelian varieties and finding roots of unity in finite fields. Math. Comp.\u00a055, 745\u2013763 (1990)","journal-title":"Math. Comp."},{"key":"31_CR33","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"S.C. Pohlig","year":"1978","unstructured":"Pohlig, S.C., Hellman, M.E.: An improved algorithm for computing logarithms over GF (p) and its cryptographic significance. IEEE Trans. Info. Theory\u00a024, 106\u2013110 (1978)","journal-title":"IEEE Trans. Info. Theory"},{"key":"31_CR34","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1090\/S0025-5718-99-01043-1","volume":"68","author":"H.G. R\u00fcck","year":"1999","unstructured":"R\u00fcck, H.G.: On the discrete logarithm in the divisor class group of curves. Math. Comp.\u00a068, 805\u2013806 (1999)","journal-title":"Math. Comp."},{"key":"31_CR35","unstructured":"Scholten, J.: Weil restriction of an elliptic curve over a quadratic extension. preprint, \n                    \n                      http:\/\/homes.esat.kuleuven.be\/~jscholte\/"},{"key":"31_CR36","first-page":"483","volume":"44","author":"R. Schoof","year":"1985","unstructured":"Schoof, R.: Elliptic curves over finite fields and the computation of square roots mod p. Math. Comp.\u00a044, 483\u2013494 (1985)","journal-title":"Math. Comp."},{"key":"31_CR37","doi-asserted-by":"publisher","first-page":"219","DOI":"10.5802\/jtnb.142","volume":"7","author":"R. Schoof","year":"1995","unstructured":"Schoof, R.: Counting points on elliptic curves over finite fields. J. Th\u00e9or. Nombres Bordeaux\u00a07, 219\u2013254 (1995)","journal-title":"J. Th\u00e9or. Nombres Bordeaux"},{"key":"31_CR38","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1090\/S0025-5718-08-02143-1","volume":"78","author":"A.V. Sutherland","year":"2009","unstructured":"Sutherland, A.V.: A generic apporach to searching for Jacobians. Math. Comp.\u00a078, 485\u2013507 (2009)","journal-title":"Math. Comp."},{"key":"31_CR39","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1093\/ietfec\/e89-a.1.124","volume":"E89-A","author":"K. Takashima","year":"2006","unstructured":"Takashima, K.: A new type of fast endomorphisms on Jacobians of hyperelliptic curves and their cryptographic application. IEICE Trans. Fundamentals\u00a0E89-A, 124\u2013133 (2006)","journal-title":"IEICE Trans. Fundamentals"},{"key":"31_CR40","series-title":"London Math. Sco. Lecture Note Ser","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1017\/CBO9780511546570.008","volume-title":"Advances in elliptic curve cryptography","author":"F. Vercauteren","year":"2005","unstructured":"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.\u00a0317, pp. 103\u2013132. Cambridge Univ. Press, Cambridge (2005)"},{"key":"31_CR41","unstructured":"Vercautern, F.: The SEA algorithm in characteristic 2, preprint (2000), \n                    \n                      http:\/\/homes.esat.kuleuven.be\/~fvercaut\/papers\/SEA.pdf"},{"key":"31_CR42","volume-title":"Modern computer algebra","author":"J. Gathen von zur","year":"2003","unstructured":"von zur Gathen, J., Gerhard, J.: Modern computer algebra, 2nd edn. Cambridge UP, Cambridge (2003)","edition":"2"},{"key":"31_CR43","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF01272074","volume":"2","author":"J. Gathen von zur","year":"1992","unstructured":"von zur Gathen, J., Shoup, V.: Computing Frobenius maps and factoring polynomials. Computational complexity\u00a02, 187\u2013224 (1992)","journal-title":"Computational complexity"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - EUROCRYPT 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01001-9_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T07:32:32Z","timestamp":1551943952000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01001-9_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642010002","9783642010019"],"references-count":45,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01001-9_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}