{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T19:09:19Z","timestamp":1778267359824,"version":"3.51.4"},"publisher-location":"Boston, MA","reference-count":22,"publisher":"Springer US","isbn-type":[{"value":"9781441959058","type":"print"},{"value":"9781441959065","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-1-4419-5906-5_253","type":"book-chapter","created":{"date-parts":[[2011,10,27]],"date-time":"2011-10-27T09:51:00Z","timestamp":1319709060000},"page":"580-582","source":"Crossref","is-referenced-by-count":0,"title":["Hyperelliptic Curves Performance"],"prefix":"10.1007","author":[{"given":"Roberto","family":"Avanzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Th\u00e9riault","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"253_CR1_253","unstructured":"Avanzi R (2004) Aspects of hyperelliptic curves over large prime fields in software implementations. Cryptographic Hardware and Embedded Systems \u2013 CHES 2004, Lecture Notes in Computer Science 3156, pp.\u00a0148\u2013162. Springer, Berlin"},{"key":"253_CR2_253","unstructured":"Avanzi R, Th\u00e9riault N (2007) Effects of optimizations for software implementations of small binary field arithmetic. Arithmetic of Finite Fields \u2013 WAIFI 2007, Lecture Notes in Computer Science 4547, pp.\u00a069\u201384. Springer, Berlin"},{"key":"253_CR3_253","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1515\/JMC.2008.011","volume":"2","author":"R Avanzi","year":"2008","unstructured":"Avanzi R, Th\u00e9riault N, Wang Z (2008) Rethinking low genus hyperelliptic Jacobian arithmetic over binary fields: interplay of field arithmetic and explicit formul\u00e6. J Math Cryptol 2:227\u2013255","journal-title":"J Math Cryptol"},{"key":"253_CR4_253","unstructured":"Birkner P (2007) Efficient divisor class halving on genus two curves. Selected Areas in Cryptography SAC 2006, Lecture Notes in Computer Science 4356, pp.\u00a0317\u2013326. Springer, Berlin"},{"key":"253_CR5_253","unstructured":"Birkner P, Th\u00e9riault N (2008) Faster halvings in genus 2. Selected Areas in Cryptography SAC 2008, Lecture Notes in Computer Science 5381, pp.\u00a0116. Springer, Berlin"},{"key":"253_CR6_253","unstructured":"Birkner P, Th\u00e9riault N (2009) Efficient halvings for genus 3 curves over binary fields. preprint, 2009"},{"key":"253_CR7_253","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1090\/S0025-5718-1987-0866101-0","volume":"48","author":"DG Cantor","year":"1987","unstructured":"Cantor DG (1987) Computing in the Jacobian of hyperelliptic curves. Math Computation 48:95\u2013101","journal-title":"Math Computation"},{"key":"253_CR8_253","unstructured":"Bernstein DJ, Lange T.\u00a0Series of talks on Elliptic vs.\u00a0hyperelliptic"},{"key":"253_CR9_253","unstructured":"Fan X, Wollinger TJ, Wang Y (2006) Efficient doubling on genus 3 curves over binary fields. Topics in Cryptology CT-RSA 2006, Lecture Notes in Computer Science 3860, pp.\u00a064\u201381. Springer, Berlin"},{"key":"253_CR10_253","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1515\/JMC.2007.012","volume":"1","author":"P Gaudry","year":"2007","unstructured":"Gaudry P (2007) Fast genus 2 arithmetic based on Theta functions. J Math Cryptol 1:243\u2013265","journal-title":"J Math Cryptol"},{"key":"253_CR11_253","unstructured":"Edwards HM (2007) A normal form for elliptic curves. Bull Am Math Soc (N.S.) 44(3):393\u2013422"},{"key":"253_CR12_253","unstructured":"Gaudry P, Schost \u00c9 (2004) Construction of Secure Random Curves of Genus 2 over Prime Fields. Advances in Cryptology \u2013 EUROCRYPT 2004, Lecture Notes in Computer Science 3027, pp.\u00a0239\u2013256. Springer-Verlag, Berlin"},{"key":"253_CR13_253","unstructured":"Harley R (2000) Fast arithmetic on genus two curves. Preprint"},{"key":"253_CR14_253","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF02252872","volume":"1","author":"N Koblitz","year":"1989","unstructured":"Koblitz N (1989) Hyperelliptic cryptosystems. J Cryptol 1:139\u2013150","journal-title":"J Cryptol"},{"key":"253_CR15_253","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s00200-004-0154-8","volume":"15","author":"T Lange","year":"2005","unstructured":"Lange T (2005) Formulae for arithmetic on genus 2 hyperelliptic curves. Applicable Algebra in Engineering, Commun Comput 15:295\u2013328","journal-title":"Applicable Algebra in Engineering, Commun Comput"},{"key":"253_CR16_253","unstructured":"Lange T, Stevens M (2005) Efficient doubling for genus two curves over binary fields. Selected Areas in Cryptography \u2013 SAC 2004, Lecture Notes in Computer Science 3357, pp.\u00a0170\u2013181. Springer, Berlin"},{"key":"253_CR17_253","first-page":"313","volume":"94","author":"JF Mestre","year":"1991","unstructured":"Mestre JF (1991) Construction des courbes de genre 2 a partir de leurs modules. Prog Math 94:313\u2013334","journal-title":"Prog Math"},{"key":"253_CR18_253","unstructured":"Nagao K (2000) Improving group law algorithms for Jacobians of hyperelliptic curves. Algorithmic Number Theory \u2013 ANTS-IV, Lecture Notes in Computer Science 1838, pp.\u00a0439\u2013448. Springer, Berlin"},{"key":"253_CR19_253","unstructured":"Satoh T (2009) Generating genus two hyperelliptic curves over large characteristic finite fields. Advances in Cryptology \u2013 EUROCRYPT 2009, Lecture Notes in Computer Science 5479, pp.\u00a0536\u2013553. Springer, Berlin"},{"key":"253_CR20_253","unstructured":"Smart N (1999) On the performance of hyperelliptic cryptosystems. Advances in Cryptology \u2013 EUROCRYPT \u201999, Lecture Notes in Computer Science 1592, pp.\u00a0165\u2013175. Springer, Berlin"},{"key":"253_CR21_253","unstructured":"Streng M (2008) Computing Igusa Class Polynomials. Preprint"},{"key":"253_CR22_253","unstructured":"Weng A (2001) Konstruktion kryptographisch geeigneter Kurven mit komplexer Multiplikation. PhD thesis, Universit\u00e4t Gesamthochschule Essen, Germany"}],"container-title":["Encyclopedia of Cryptography and Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4419-5906-5_253","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T18:10:26Z","timestamp":1778263826000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4419-5906-5_253"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9781441959058","9781441959065"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-1-4419-5906-5_253","relation":{},"subject":[],"published":{"date-parts":[[2011]]}}}