{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,1]],"date-time":"2026-09-01T14:46:03Z","timestamp":1788273963753,"version":"build-2803163510"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T00:00:00Z","timestamp":1330214400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1007\/s10623-012-9611-8","type":"journal-article","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T13:30:35Z","timestamp":1330176635000},"page":"341-355","source":"Crossref","is-referenced-by-count":6,"title":["Generating pairing-friendly parameters for the CM construction of genus 2 curves over prime fields"],"prefix":"10.1007","volume":"67","author":[{"given":"Kristin","family":"Lauter","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ning","family":"Shang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,2,26]]},"reference":[{"key":"9611_CR1","unstructured":"Balakrishnan J., Belding J., Chisholm S., Eisentr\u00e4ger K., Stange K., Teske E.: Pairings on hyperelliptic curves. http:\/\/arxiv.org\/PS_cache\/arxiv\/pdf\/0908\/0908.3731v2.pdf ."},{"issue":"2","key":"9611_CR2","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s001459900040","volume":"11","author":"R. Balasubramanian","year":"1998","unstructured":"Balasubramanian R., Koblitz N.: The improbability that an elliptic curve has subexponential discrete log problem under the Menezes\u2013Okamoto\u2013Vanstone algorithm. J. Cryptol. 11(2), 141\u2013145 (1998)","journal-title":"J. Cryptol."},{"issue":"3\u20134","key":"9611_CR3","doi-asserted-by":"crossref","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. Symb. Comput. 24(3\u20134), 235\u2013265 (1997)","journal-title":"J. Symb. Comput."},{"key":"9611_CR4","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1142\/9789812701640_0006","volume-title":"Computational Aspects of Algebraic Curves, vol. 13","author":"G. Cardona","year":"2005","unstructured":"Cardona G., Quer J.: Field of moduli and field of definition for curves of genus 2. In: Shaska, T. (ed.) Computational Aspects of Algebraic Curves, vol. 13, pp. 71\u201383. World Scientific Publications, Hackensack (2005)"},{"key":"9611_CR5","unstructured":"Eisentr\u00e4ger K., Lauter K.: A CRT algorithm for constructing genus 2 curves over finite fields. In: Arithmetic, Geometry and Coding Theory AGCT-10 (2005), S\u00e9minaires et Congr\u00e9s 21, pp. 161\u2013176. Soci\u00e9t\u00e9 Math\u00e9matique de France, Paris (2009)."},{"key":"9611_CR6","unstructured":"Freeman D.: Constructing pairing-friendly genus 2 curves over prime fields with ordinary Jacobians. In: Proceedings of Pairing-Based Cryptography (Pairing 2007), vol. 4575 of LNCS, pp. 152\u2013176. Springer, Heidelberg (2007)."},{"key":"9611_CR7","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/978-3-540-85538-5_11","volume-title":"Pairing-Based Cryptography\u2014Pairing 2008, vol. 5209 of Lecture Notes in Computer Science","author":"D. Freeman","year":"2008","unstructured":"Freeman D.: A generalized Brezing-Weng algorithm for constructing pairing-friendly ordinary abelian varieties. In: Galbraith, S, Paterson, K (eds) Pairing-Based Cryptography\u2014Pairing 2008, vol. 5209 of Lecture Notes in Computer Science, pp. 146\u2013163. Springer, Berlin (2008)"},{"key":"9611_CR8","unstructured":"Freeman D., Stevenhagen P., Streng M.: Abelian varieties with prescribed embedding degree. In: Algorithmic Number Theory VIII, pp. 60\u201373. Springer, Heidelberg (2008)."},{"key":"9611_CR9","doi-asserted-by":"crossref","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. Cryptol. 23, 224\u2013280 (2010)","journal-title":"J. Cryptol."},{"issue":"5","key":"9611_CR10","doi-asserted-by":"crossref","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 131(5), 959\u2013983 (2011)","journal-title":"J. Number Theory"},{"key":"9611_CR11","first-page":"26","volume-title":"Selected Areas in Cryptography, vol. 3006 of Lecture Notes in Computer Science","author":"E. Furukawa","year":"2004","unstructured":"Furukawa E., Kawazoe M., Takahashi T.: Counting points for hyperelliptic curves of type y 2 =\u00a0x 5 +\u00a0ax over finite prime fields. In: Matsui, M, Zuccherato, R (eds) Selected Areas in Cryptography, vol. 3006 of Lecture Notes in Computer Science, pp. 26\u201341. Springer, Berlin (2004)"},{"issue":"4","key":"9611_CR12","doi-asserted-by":"crossref","first-page":"800","DOI":"10.1016\/j.ffa.2007.02.003","volume":"13","author":"S.D. Galbraith","year":"2007","unstructured":"Galbraith S.D., McKee J.F., Valenca P.C.: Ordinary abelian varieties having small embedding degree. Finite Fields Appl. 13(4), 800\u2013814 (2007)","journal-title":"Finite Fields Appl."},{"key":"9611_CR13","first-page":"313","volume-title":"Algorithmic Number Theory, vol. 1838 of Lecture Notes in Computer Science","author":"P. Gaudry","year":"2000","unstructured":"Gaudry P., Harley R.: Counting points on hyperelliptic curves over finite fields. In: Bosma, W (ed.) Algorithmic Number Theory, vol. 1838 of Lecture Notes in Computer Science, pp. 313\u2013332. Springer, Berlin (2000)"},{"key":"9611_CR14","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/11935230_8","volume-title":"Advances in Cryptology ASIACRYPT 2006, vol. 4284 of Lecture Notes in Computer Science","author":"P. Gaudry","year":"2006","unstructured":"Gaudry P., Houtmann T., Kohel D., Ritzenthaler C., Weng A.: The 2-adic CM method for genus 2 curves with application to cryptography. In: Lai, X, Chen, K (eds.) Advances in Cryptology ASIACRYPT 2006, vol. 4284 of Lecture Notes in Computer Science, pp. 114\u2013129. Springer, Berlin (2006)"},{"issue":"1","key":"9611_CR15","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1515\/JMC.2009.002","volume":"3","author":"L. Hitt","year":"2009","unstructured":"Hitt L.: Families of genus 2 curves with small embedding degree. J. Math. Cryptol. 3(1), 19\u201336 (2009)","journal-title":"J. Math. Cryptol."},{"key":"9611_CR16","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1007\/BF01418933","volume":"15","author":"M.N. Huxley","year":"1972","unstructured":"Huxley M.N.: On the difference between consecutive primes. Invent. Math. 15, 164\u2013170 (1972)","journal-title":"Invent. Math."},{"key":"9611_CR17","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1007\/978-3-540-85538-5_12","volume-title":"Pairing-Based Cryptography\u2014Pairing 2008, vol. 5209 of Lecture Notes in Computer Science","author":"M. Kawazoe","year":"2008","unstructured":"Kawazoe M., Takahashi T.: Pairing-friendly hyperelliptic curves with ordinary Jacobians of type y 2 =\u00a0x 5 +\u00a0ax. In: Galbraith, S, Paterson, K (eds.) Pairing-Based Cryptography\u2014Pairing 2008, vol. 5209 of Lecture Notes in Computer Science, pp. 164\u2013177. Springer, Berlin (2008)"},{"issue":"1","key":"9611_CR18","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1112\/plms\/84.1.105","volume":"84","author":"H.W. Lenstra Jr.","year":"2002","unstructured":"Lenstra H.W. Jr., Pila J., Pomerance C.: A hyperelliptic smoothness test, II. Proc. Lond. Math. Soc. 84(1), 105\u2013146 (2002)","journal-title":"Proc. Lond. Math. Soc."},{"key":"9611_CR19","unstructured":"Mestre J.-F.: Construction de courbes de genre 2 \u00e0 \u00e0 partir de leurs modules (Construction of genus 2 curves starting from their moduli). In: Effective Methods in Algebraic Geometry, Proceedings of Symposium on Castiglioncello\/Italy 1990, Progress in Mathematics, vol. 94, pp. 313\u2013334. Birkh\u00e4user, Basel (1991)."},{"key":"9611_CR20","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1109\/TIT.1978.1055817","volume":"24","author":"S. Pohlig","year":"1978","unstructured":"Pohlig S., Hellman M.: An improved algorithm for computing logarithms over GF(p) and its cryptographic significance. IEEE Trans. Inf. Theory 24, 106\u2013110 (1978)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9611_CR21","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1007\/3-540-45708-9_22","volume-title":"Advances in Cryptology\u2014CRYPTO 2002, vol. 2442 of Lecture Notes in Computer Science","author":"K. Rubin","year":"2002","unstructured":"Rubin K., Silverberg A.: Supersingular abelian varieties in cryptology. In: Yung, M (ed.) Advances in Cryptology\u2014CRYPTO 2002, vol. 2442 of Lecture Notes in Computer Science, pp. 336\u2013353. Springer, Berlin (2002)"},{"key":"9611_CR22","unstructured":"Shang N.: Low genus algebraic curves in cryptography. PhD thesis, Purdue University, West Lafayette, USA, January 2009. https:\/\/www.cerias.purdue.edu\/assets\/pdf\/bibtex_archive\/2009-07.pdf ."},{"issue":"225","key":"9611_CR23","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1090\/S0025-5718-99-01020-0","volume":"68","author":"P. Van Wamelen","year":"1999","unstructured":"Van Wamelen P.: Examples of genus two CM curves defined over the rationals. Math. Comput. 68(225), 307\u2013320 (1999)","journal-title":"Math. Comput."},{"key":"9611_CR24","volume-title":"Vari\u00e9t\u00e9s Ab\u00e9liennes et Courbes Alg\u00e9briques","author":"A. Weil","year":"1948","unstructured":"Weil A.: Vari\u00e9t\u00e9s Ab\u00e9liennes et Courbes Alg\u00e9briques. Hermann, Paris (1948)"},{"issue":"241","key":"9611_CR25","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1090\/S0025-5718-02-01422-9","volume":"72","author":"A. Weng","year":"2002","unstructured":"Weng A.: Constructing hyperelliptic curves of genus 2 suitable for cryptography. Math. Comput. 72(241), 435\u2013458 (2002)","journal-title":"Math. Comput."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9611-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-012-9611-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-012-9611-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:58:32Z","timestamp":1559246312000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-012-9611-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,26]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["9611"],"URL":"https:\/\/doi.org\/10.1007\/s10623-012-9611-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,26]]}}}