{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T02:45:35Z","timestamp":1725936335188},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319724522"},{"type":"electronic","value":"9783319724539"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-72453-9_33","type":"book-chapter","created":{"date-parts":[[2017,12,20]],"date-time":"2017-12-20T09:35:54Z","timestamp":1513762554000},"page":"409-424","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Ordinary Pairing-Friendly Genus 2 Hyperelliptic Curves with Absolutely Simple Jacobians"],"prefix":"10.1007","author":[{"given":"Georgios","family":"Fotiadis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elisavet","family":"Konstantinou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,21]]},"reference":[{"key":"33_CR1","doi-asserted-by":"publisher","unstructured":"Balakrishnan, J., Belding, J., Chisholm, S., Eisentr\u00e4ger, K., Stange, K., Teske, E.: Pairings on hyperelliptic curves. In: Women in Numbers: Research Directions in Number Theory, vol. 60, pp. 87\u2013120. Fields Institute Communications (2009). https:\/\/doi.org\/10.1090\/fic\/060\/05","DOI":"10.1090\/fic\/060\/05"},{"key":"33_CR2","unstructured":"Bernstein, D.: Elliptic vs. hyperelliptic, Part 1. Talk at ECC 2006 (2006)"},{"issue":"1","key":"33_CR3","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 Cryptogr. 37(1), 133\u2013141 (2005). https:\/\/doi.org\/10.1007\/s10623-004-3808-4 . Springer","journal-title":"Des. Codes Cryptogr."},{"issue":"177","key":"33_CR4","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1090\/S0025-5718-1987-0866101-0","volume":"48","author":"DG Cantor","year":"1987","unstructured":"Cantor, D.G.: Computing in the Jacobian of a hyperelliptic curve. Math. Comput. 48(177), 95\u2013101 (1987). https:\/\/doi.org\/10.1090\/S0025-5718-1987-0866101-0","journal-title":"Math. Comput."},{"key":"33_CR5","series-title":"Discrete Mathematics and its Applications","volume-title":"Handbook of Elliptic and Hyperelliptic Curve Cryptography","author":"H Cohen","year":"2006","unstructured":"Cohen, H., Frey, G., Avanzi, R., Doche, C., Lange, T., Nguyen, K., Vercauteren, F.: Handbook of Elliptic and Hyperelliptic Curve Cryptography. Discrete Mathematics and its Applications. Chapman & Hall\/CRC Press, Boca Raton (2006)"},{"key":"33_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/978-3-642-34931-7_25","volume-title":"Progress in Cryptology - INDOCRYPT 2012","author":"R Dry\u0142o","year":"2012","unstructured":"Dry\u0142o, R.: Constructing pairing-friendly genus 2 curves with split Jacobian. In: Galbraith, S., Nandi, M. (eds.) INDOCRYPT 2012. LNCS, vol. 7668, pp. 431\u2013453. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34931-7_25"},{"key":"33_CR7","doi-asserted-by":"crossref","DOI":"10.1201\/9781315370170","volume-title":"Guide to Pairing-Based Cryptography","author":"N El Mrabet","year":"2017","unstructured":"El Mrabet, N., Joye, M.: Guide to Pairing-Based Cryptography. CRC Press, Boca Raton (2017)"},{"key":"33_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-540-85538-5_11","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"D Freeman","year":"2008","unstructured":"Freeman, D.: A generalized Brezing-Weng algorithm for constructing pairing-friendly ordinary abelian varieties. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 146\u2013163. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85538-5_11"},{"key":"33_CR9","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 2008. LNCS, vol. 5011, pp. 60\u201373. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79456-1_3"},{"issue":"5","key":"33_CR10","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1016\/j.jnt.2010.06.003","volume":"131","author":"DM Freeman","year":"2011","unstructured":"Freeman, D.M., Satoh, S.: Constructing pairing-friendly hyperelliptic curves using Weil restriction. J. Number Theor. 131(5), 959\u2013983 (2011). https:\/\/doi.org\/10.1016\/j.jnt.2010.06.003 . Elsevier","journal-title":"J. Number Theor."},{"key":"33_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/11792086_33","volume-title":"Algorithmic Number Theory","author":"G Frey","year":"2006","unstructured":"Frey, G., Lange, T.: Fast bilinear maps from the Tate-Lichtenbaum pairing on hyperelliptic curves. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol. 4076, pp. 466\u2013479. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11792086_33"},{"key":"33_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-642-36334-4_16","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2012","author":"A Guillevic","year":"2013","unstructured":"Guillevic, A., Vergnaud, D.: Genus 2 hyperelliptic curve families with explicit jacobian order evaluation and pairing-friendly constructions. In: Abdalla, M., Lange, T. (eds.) Pairing 2012. LNCS, vol. 7708, pp. 234\u2013253. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36334-4_16"},{"issue":"1","key":"33_CR13","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1006\/jnth.2001.2697","volume":"92","author":"EW Howe","year":"2002","unstructured":"Howe, E.W., Zhu, H.J.: On the existence of absolutely simple abelian varieties of a given dimension over an arbitrary field. J. Number Theor. 92(1), 139\u2013163 (2002). https:\/\/doi.org\/10.1006\/jnth.2001.2697 . Elsevier","journal-title":"J. Number Theor."},{"key":"33_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-662-54365-8_16","volume-title":"Public-Key Cryptography \u2013 PKC 2017","author":"T Kim","year":"2017","unstructured":"Kim, T., Jeong, J.: Extended tower number field sieve with application to finite fields of arbitrary composite extension degree. In: Fehr, S. (ed.) PKC 2017. LNCS, vol. 10174, pp. 388\u2013408. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54365-8_16"},{"key":"33_CR15","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":"EJ 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. 6487, pp. 312\u2013326. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17455-1_20"},{"key":"33_CR16","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 $$\\mathit{y}^{2} = \\mathit{x}^{5} + \\mathit{ax}$$ y 2 = x 5 + ax . In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 164\u2013177. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85538-5_12"},{"key":"33_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/978-3-662-53018-4_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"T Kim","year":"2016","unstructured":"Kim, T., Barbulescu, R.: Extended tower number field sieve: a new complexity for the medium prime case. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9814, pp. 543\u2013571. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_20"},{"issue":"3","key":"33_CR18","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF02252872","volume":"1","author":"N Koblitz","year":"1989","unstructured":"Koblitz, N.: Hyperelliptic cryptosystems. J. Cryptol. 1(3), 139\u2013150 (1989). https:\/\/doi.org\/10.1007\/BF02252872 . Springer","journal-title":"J. Cryptol."},{"key":"33_CR19","unstructured":"Lange, T.: Elliptic vs. hyperelliptic, Part 2. Talk at ECC 2006 (2006)"},{"issue":"3","key":"33_CR20","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10623-012-9611-8","volume":"67","author":"K Lauter","year":"2013","unstructured":"Lauter, K., Shang, N.: Generating pairing-friendly parameters for the CM construction of genus 2 curves over prime fields. Des. Codes Cryptogr. 67(3), 341\u2013355 (2013). https:\/\/doi.org\/10.1007\/s10623-012-9611-8 . Springer","journal-title":"Des. Codes Cryptogr."},{"key":"33_CR21","unstructured":"Milne, J.S.: Abelian varieties (2008). www.jmilne.org\/math\/"},{"key":"33_CR22","unstructured":"Murphy, A., Fitzpatrick, N.: Elliptic curves for pairing applications. CiteSeer (2005)"},{"key":"33_CR23","unstructured":"Oort, F., de Jong, A.J.: Abelian varieties over finite fields. Seminar at Columbia University, September\u2013December 2008"},{"key":"33_CR24","first-page":"235","volume":"21","author":"BK Spearman","year":"2006","unstructured":"Spearman, B.K., Williams, K.S.: Cyclic quartic fields with a unique normal integral basis. Far East J. Math. Sci. 21, 235\u2013240 (2006). CiteSeer","journal-title":"Far East J. Math. Sci."},{"issue":"241","key":"33_CR25","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1090\/S0025-5718-02-01422-9 . American Mathematical Society","journal-title":"Math. Comput."}],"container-title":["Lecture Notes in Computer Science","Mathematical Aspects of Computer and Information Sciences"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-72453-9_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,8]],"date-time":"2019-10-08T08:58:07Z","timestamp":1570525087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-72453-9_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319724522","9783319724539"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-72453-9_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}