{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:21:39Z","timestamp":1774369299336,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642363337","type":"print"},{"value":"9783642363344","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36334-4_16","type":"book-chapter","created":{"date-parts":[[2013,1,30]],"date-time":"2013-01-30T19:55:13Z","timestamp":1359575713000},"page":"234-253","source":"Crossref","is-referenced-by-count":7,"title":["Genus 2 Hyperelliptic Curve Families with Explicit Jacobian Order Evaluation and Pairing-Friendly Constructions"],"prefix":"10.1007","author":[{"given":"Aurore","family":"Guillevic","sequence":"first","affiliation":[]},{"given":"Damien","family":"Vergnaud","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1090\/S0025-5718-1993-1199989-X","volume":"61","author":"A.O.L. Atkin","year":"1993","unstructured":"Atkin, A.O.L., Morain, F.: Elliptic curves and primality proving. Math. Comput.\u00a061, 29\u201368 (1993)","journal-title":"Math. Comput."},{"key":"16_CR2","series-title":"Fields Institute Communications","first-page":"87","volume-title":"WIN - Women in Numbers: Research Directions in Number Theory","author":"J. Balakrishnan","year":"2011","unstructured":"Balakrishnan, J., Belding, J., Chisholm, S., Eisentr\u00e4ger, K., Stange, K., Teske, E.: Pairings on hyperelliptic curves. In: WIN - Women in Numbers: Research Directions in Number Theory. Fields Institute Communications, vol.\u00a060, pp. 87\u2013120. Amer. Math. Soc., Providence (2011)"},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/978-3-642-03298-1_4","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2009","author":"N. Benger","year":"2009","unstructured":"Benger, N., Charlemagne, M., Freeman, D.M.: On the Security of Pairing-Friendly Abelian Varieties over Non-prime Fields. In: Shacham, H., Waters, B. (eds.) Pairing 2009. LNCS, vol.\u00a05671, pp. 52\u201365. Springer, Heidelberg (2009)"},{"issue":"3","key":"16_CR4","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/S0097539701398521","volume":"32","author":"D. Boneh","year":"2003","unstructured":"Boneh, D., Franklin, M.K.: Identity-based encryption from the Weil pairing. SIAM J. Comput.\u00a032(3), 586\u2013615 (2003)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"16_CR5","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00145-004-0314-9","volume":"17","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. J. Cryptology\u00a017(4), 297\u2013319 (2004)","journal-title":"J. Cryptology"},{"issue":"3-4","key":"16_CR6","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1006\/jsco.1996.0125","volume":"24","author":"W. Bosma","year":"1997","unstructured":"Bosma, W., Cannon, J., Playoust, C.: The Magma algebra system. I. The user language. J. Symbolic Comput.\u00a024(3-4), 235\u2013265 (1997); Computational algebra and number theory, London (1993)","journal-title":"J. Symbolic Comput."},{"issue":"1","key":"16_CR7","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s10623-004-3808-4","volume":"37","author":"F. Brezing","year":"2005","unstructured":"Brezing, F., Weng, A.: Elliptic curves suitable for pairing based cryptography. Des. Codes Cryptography\u00a037(1), 133\u2013141 (2005)","journal-title":"Des. Codes Cryptography"},{"key":"16_CR8","unstructured":"Certivox. MIRACL Crypto SDK (2012), \n                    \n                      http:\/\/certivox.com\/index.php\/solutions\/miracl-crypto-sdk\/"},{"key":"16_CR9","unstructured":"Cocks, C., Pinch, R.G.: ID-based cryptosystems based on the Weil pairing (2001) (unpublished manuscript)"},{"issue":"2","key":"16_CR10","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00145-004-0219-7","volume":"18","author":"R. Dupont","year":"2005","unstructured":"Dupont, R., Enge, A., Morain, F.: Building curves with arbitrary small mov degree over finite prime fields. J. Cryptology\u00a018(2), 79\u201389 (2005)","journal-title":"J. Cryptology"},{"key":"16_CR11","unstructured":"Enge, A.: CM Software (February 2012), \n                    \n                      http:\/\/www.multiprecision.org\/index.php?prog=cm"},{"issue":"2","key":"16_CR12","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/s00145-009-9048-z","volume":"23","author":"D. Freeman","year":"2010","unstructured":"Freeman, D., Scott, M., Teske, E.: A taxonomy of pairing-friendly elliptic curves. J. Cryptology\u00a023(2), 224\u2013280 (2010)","journal-title":"J. Cryptology"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-540-79456-1_3","volume-title":"Algorithmic Number Theory","author":"D. Freeman","year":"2008","unstructured":"Freeman, D., Stevenhagen, P., Streng, M.: Abelian Varieties with Prescribed Embedding Degree. In: van der Poorten, A.J., Stein, A. (eds.) ANTS-VIII 2008. LNCS, vol.\u00a05011, pp. 60\u201373. Springer, Heidelberg (2008)"},{"issue":"5","key":"16_CR14","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1016\/j.jnt.2010.06.003","volume":"131","author":"D.M. Freeman","year":"2011","unstructured":"Freeman, D.M., Satoh, T.: Constructing pairing-friendly hyperelliptic curves using weil restriction. J. Number Theory\u00a0131(5), 959\u2013983 (2011)","journal-title":"J. Number Theory"},{"key":"16_CR15","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":"16_CR16","unstructured":"Galbraith, S.D.: Pairings. In: Blake, I.F., Seroussi, G., Smart, N.P. (eds.) Advances in Elliptic Curve Cryptography. London Mathematical Society Lecture Note Series, vol.\u00a0317, ch. 9. Cambridge Univ. Press (2004)"},{"key":"16_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-540-73489-5_7","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2007","author":"S.D. Galbraith","year":"2007","unstructured":"Galbraith, S.D., Hess, F., Vercauteren, F.: Hyperelliptic Pairings. In: Takagi, T., Okamoto, T., Okamoto, E., Okamoto, T. (eds.) Pairing 2007. LNCS, vol.\u00a04575, pp. 108\u2013131. Springer, Heidelberg (2007)"},{"issue":"1","key":"16_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1515\/JMC.2009.001","volume":"3","author":"S.D. Galbraith","year":"2009","unstructured":"Galbraith, S.D., Pujolas, J., Ritzenthaler, C., Smith, B.: Distortion maps for supersingular genus two curves. J. Math. Crypt.\u00a03(1), 1\u201318 (2009)","journal-title":"J. Math. Crypt."},{"key":"16_CR19","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)"},{"issue":"3","key":"16_CR20","first-page":"243","volume":"1","author":"P. Gaudry","year":"2007","unstructured":"Gaudry, P.: Fast genus 2 arithmetic based on theta functions. J. Math. Crypt.\u00a01(3), 243\u2013265 (2007)","journal-title":"J. Math. Crypt."},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/978-3-642-25385-0_27","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"P. Gaudry","year":"2011","unstructured":"Gaudry, P., Kohel, D., Smith, B.: Counting Points on Genus 2 Curves with Real Multiplication. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol.\u00a07073, pp. 504\u2013519. Springer, Heidelberg (2011)"},{"key":"16_CR22","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)"},{"issue":"4","key":"16_CR23","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1016\/j.jsc.2011.09.003","volume":"47","author":"P. Gaudry","year":"2012","unstructured":"Gaudry, P., Schost, \u00c9.: Genus 2 point counting over prime fields. J. Symb. Comput.\u00a047(4), 368\u2013400 (2012)","journal-title":"J. Symb. Comput."},{"key":"16_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-540-85538-5_9","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"E.J. Kachisa","year":"2008","unstructured":"Kachisa, E.J., Schaefer, E.F., Scott, M.: Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol.\u00a05209, pp. 126\u2013135. Springer, Heidelberg (2008)"},{"key":"16_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-642-17455-1_20","volume-title":"Pairing-Based Cryptography - Pairing 2010","author":"E.J. Kachisa","year":"2010","unstructured":"Kachisa, E.J.: Generating More Kawazoe-Takahashi Genus 2 Pairing-Friendly Hyperelliptic Curves. In: Joye, M., Miyaji, A., Otsuka, A. (eds.) Pairing 2010. LNCS, vol.\u00a06487, pp. 312\u2013326. Springer, Heidelberg (2010)"},{"key":"16_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-540-85538-5_12","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"M. Kawazoe","year":"2008","unstructured":"Kawazoe, M., Takahashi, T.: Pairing-Friendly Hyperelliptic Curves with Ordinary Jacobians of Type y\n                  2 = x\n                  5 + ax. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol.\u00a05209, pp. 164\u2013177. Springer, Heidelberg (2008)"},{"issue":"177","key":"16_CR27","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N. Koblitz","year":"1987","unstructured":"Koblitz, N.: Elliptic curve cryptosystems. Math. Comp.\u00a048(177), 203\u2013209 (1987)","journal-title":"Math. Comp."},{"key":"16_CR28","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF02252872","volume":"1","author":"N. Koblitz","year":"1989","unstructured":"Koblitz, N.: Hyperelliptic cryptosystems. J. Cryptology\u00a01, 139\u2013150 (1989)","journal-title":"J. Cryptology"},{"key":"16_CR29","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/s00145-009-9037-2","volume":"23","author":"E. Konstantinou","year":"2010","unstructured":"Konstantinou, E., Kontogeorgis, A., Stamatiou, Y., Zaroliagis, C.: On the efficient generation of prime-order elliptic curves. J. Cryptology\u00a023, 477\u2013503 (2010)","journal-title":"J. Cryptology"},{"key":"16_CR30","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s10207-006-0009-3","volume":"6","author":"E. Konstantinou","year":"2007","unstructured":"Konstantinou, E., Stamatiou, Y., Zaroliagis, C.: Efficient generation of secure elliptic curves. International Journal of Information Security\u00a06, 47\u201363 (2007)","journal-title":"International Journal of Information Security"},{"key":"16_CR31","unstructured":"Lercier, R.: Algorithmique des courbes elliptiques dans les corps finis. PhD thesis, \u00c9cole Polytechnique (1997)"},{"key":"16_CR32","series-title":"Discrete Mathematics and its Applications","first-page":"239","volume-title":"Handbook of Elliptic and Hyperelliptic Curve Cryptography","author":"R. Lercier","year":"2005","unstructured":"Lercier, R., Lubicz, D., Vercauteren, F.: Point counting on elliptic and hyperelliptic curves. In: Avanzi, R.M., Cohen, H., Doche, C., Frey, G., Lange, T., Nguyen, K., Vercauteren, F. (eds.) Handbook of Elliptic and Hyperelliptic Curve Cryptography. Discrete Mathematics and its Applications, vol.\u00a034, ch. 17, pp. 239\u2013263. CRC Press, Boca Raton (2005)"},{"key":"16_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in Cryptology","author":"V.S. Miller","year":"1986","unstructured":"Miller, V.S.: Use of Elliptic Curves in Cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol.\u00a0218, pp. 417\u2013426. Springer, Heidelberg (1986)"},{"key":"16_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/3-540-45455-1_5","volume-title":"Algorithmic Number Theory","author":"T. Satoh","year":"2002","unstructured":"Satoh, T.: On p-adic Point Counting Algorithms for Elliptic Curves over Finite Fields. In: Fieker, C., Kohel, D.R. (eds.) ANTS 2002. LNCS, vol.\u00a02369, pp. 43\u201366. Springer, Heidelberg (2002)"},{"key":"16_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1007\/978-3-642-01001-9_31","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"T. Satoh","year":"2009","unstructured":"Satoh, T.: Generating Genus Two Hyperelliptic Curves over Large Characteristic Finite Fields. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol.\u00a05479, pp. 536\u2013553. Springer, Heidelberg (2009)"},{"key":"16_CR36","first-page":"483","volume":"44","author":"R. Schoof","year":"1998","unstructured":"Schoof, R.: Elliptic curves over finite fields and the computation of square roots mod p. Math. Comput.\u00a044, 483\u2013494 (1998)","journal-title":"Math. Comput."},{"key":"16_CR37","unstructured":"Scott, M.: MIRACL library (August 2011), \n                    \n                      http:\/\/www.shamus.ie"},{"issue":"1","key":"16_CR38","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1093\/ietfec\/e89-a.1.124","volume":"89-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 Transactions\u00a089-A(1), 124\u2013133 (2006)","journal-title":"IEICE Transactions"}],"container-title":["Lecture Notes in Computer Science","Pairing-Based Cryptography \u2013 Pairing 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36334-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,10]],"date-time":"2019-05-10T20:06:23Z","timestamp":1557518783000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36334-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642363337","9783642363344"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36334-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}