{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T17:12:44Z","timestamp":1791306764684,"version":"4.3.1"},"publisher-location":"Berlin, Heidelberg","reference-count":54,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642284953","type":"print"},{"value":"9783642284960","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-28496-0_6","type":"book-chapter","created":{"date-parts":[[2012,2,20]],"date-time":"2012-02-20T02:17:48Z","timestamp":1329704268000},"page":"92-117","source":"Crossref","is-referenced-by-count":22,"title":["Group Law Computations on Jacobians of Hyperelliptic Curves"],"prefix":"10.1007","author":[{"given":"Craig","family":"Costello","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kristin","family":"Lauter","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Abu Salem, F.K., Khuri-Makdisi, K.: Fast Jacobian group operations for C 3,4 curves over a large finite field. CoRR, abs\/math\/0610121 (2006)","DOI":"10.1112\/S146115700000142X"},{"issue":"3","key":"6_CR2","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1515\/JMC.2008.011","volume":"2","author":"R. Avanzi","year":"2008","unstructured":"Avanzi, R., Th\u00e9riault, N., Wang, Z.: Rethinking low genus hyperelliptic Jacobian arithmetic over binary fields: interplay of field arithmetic and explicit formul\u00e6. J. Math. Crypt.\u00a02(3), 227\u2013255 (2008)","journal-title":"J. Math. Crypt."},{"key":"6_CR3","unstructured":"Avanzi, R.M., Cohen, H., Doche, C., Frey, G., Lange, T., Nguyen, K., Vercauteren, F.: The Handbook of Elliptic and Hyperelliptic Curve Cryptography. CRC (2005)"},{"key":"6_CR4","unstructured":"Bernstein, D.J.: Elliptic vs. hyperelliptic, part I. Talk at ECC (September 2006)"},{"key":"6_CR5","unstructured":"Bernstein, D.J., Lange, T.: Explicit-formulas database, http:\/\/www.hyperelliptic.org\/EFD"},{"issue":"177","key":"6_CR6","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1090\/S0025-5718-1987-0866101-0","volume":"48","author":"D.G. Cantor","year":"1987","unstructured":"Cantor, D.G.: Computing in the Jacobian of a hyperelliptic curve. Math. Comp.\u00a048(177), 95\u2013101 (1987)","journal-title":"Math. Comp."},{"issue":"2","key":"6_CR7","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10623-005-3299-y","volume":"39","author":"M. Ciet","year":"2006","unstructured":"Ciet, M., Joye, M., Lauter, K., Montgomery, P.L.: Trading inversions for multiplications in elliptic curve cryptography. Designs, Codes and Cryptography\u00a039(2), 189\u2013206 (2006)","journal-title":"Designs, Codes and Cryptography"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/11792086_38","volume-title":"Algorithmic Number Theory","author":"C. Diem","year":"2006","unstructured":"Diem, C.: An Index Calculus Algorithm for Plane Curves of Small Degree. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol.\u00a04076, pp. 543\u2013557. Springer, Heidelberg (2006)"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Doche, C., Icart, T., Kohel, D.R.: Efficient scalar multiplication by isogeny decompositions. In: PKC 2006 [54], pp. 191\u2013206 (2006)","DOI":"10.1007\/11745853_13"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/3-540-36563-X_24","volume-title":"Topics in Cryptology - CT-RSA 2003","author":"K. Eisentr\u00e4ger","year":"2003","unstructured":"Eisentr\u00e4ger, K., Lauter, K., Montgomery, P.L.: Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol.\u00a02612, pp. 343\u2013354. Springer, Heidelberg (2003)"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-540-73074-3_16","volume-title":"Arithmetic of Finite Fields","author":"S. Erickson","year":"2007","unstructured":"Erickson, S., Jacobson Jr., M.J., Shang, N., Shen, S., Stein, A.: Explicit Formulas for Real Hyperelliptic Curves of Genus 2 in Affine Representation. In: Carlet, C., Sunar, B. (eds.) WAIFI 2007. LNCS, vol.\u00a04547, pp. 202\u2013218. Springer, Heidelberg (2007)"},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-642-04159-4_2","volume-title":"Selected Areas in Cryptography","author":"X. Fan","year":"2009","unstructured":"Fan, X., Gong, G., Jao, D.: Efficient Pairing Computation on Genus 2 Curves in Projective Coordinates. In: Avanzi, R.M., Keliher, L., Sica, F. (eds.) SAC 2008. LNCS, vol.\u00a05381, pp. 18\u201334. Springer, Heidelberg (2009)"},{"issue":"3","key":"6_CR13","first-page":"227","volume":"5","author":"S. Flon","year":"2008","unstructured":"Flon, S., Oyono, R., Ritzenthaler, a.C.: Fast addition on non-hyperelliptic genus 3 curves. Algebraic geometry and its applications\u00a05(3), 227\u2013256 (2008)","journal-title":"Algebraic geometry and its applications"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-540-24632-9_5","volume-title":"Public Key Cryptography \u2013 PKC 2004","author":"S. Flon","year":"2004","unstructured":"Flon, S., Oyono, R.: Fast Arithmetic on Jacobians of Picard Curves. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol.\u00a02947, pp. 55\u201368. Springer, Heidelberg (2004)"},{"key":"6_CR15","unstructured":"Galbraith, S.D.: Mathematics of Public Key Cryptography, 0.9 edition (February 11, 2011), http:\/\/www.math.auckland.ac.nz\/~sgal018\/crypto-book\/crypto-book.html"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/978-3-540-79456-1_23","volume-title":"Algorithmic Number Theory","author":"S.D. Galbraith","year":"2008","unstructured":"Galbraith, S.D., Harrison, M., Mireles Morales, D.J.: Efficient Hyperelliptic Arithmetic using Balanced Representation for Divisors. In: van der Poorten, A.J., Stein, A. (eds.) ANTS-VIII 2008. LNCS, vol.\u00a05011, pp. 342\u2013356. Springer, Heidelberg (2008)"},{"key":"6_CR17","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":"6_CR18","doi-asserted-by":"crossref","unstructured":"Gaudry, P.: Hyperelliptic curves and the HCDLP. London Mathematical Society Lecture Notes, vol.\u00a0317, ch.VII, pp. 133\u2013150. Cambridge University Press (2005)","DOI":"10.1017\/CBO9780511546570.009"},{"issue":"3","key":"6_CR19","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":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/10722028_18","volume-title":"Algorithmic Number Theory","author":"P. Gaudry","year":"2000","unstructured":"Gaudry, P., Harley, R.: Counting Points on Hyperelliptic Curves Over Finite Fields. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol.\u00a01838, pp. 313\u2013332. Springer, Heidelberg (2000)"},{"issue":"257","key":"6_CR21","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1090\/S0025-5718-06-01900-4","volume":"76","author":"P. Gaudry","year":"2007","unstructured":"Gaudry, P., Thom\u00e9, E., Th\u00e9riault, N., Diem, C.: A double large prime variation for small genus hyperelliptic index calculus. Math. Comp.\u00a076(257), 475\u2013492 (2007)","journal-title":"Math. Comp."},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Gonda, M., Matsuo, K., Aoki, K., Chao, J., Tsujii, S.: Improvements of addition algorithm on genus 3 hyperelliptic curves and their implementation. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences, 89\u201396 (2005)","DOI":"10.1093\/ietfec\/E88-A.1.89"},{"key":"6_CR23","first-page":"75","volume":"19","author":"C. Gurot","year":"2004","unstructured":"Gurot, C., Kaveh, K., Patankar, V.M.: Explicit algorithm for the arithmetic on the hyperelliptic Jacobians of genus 3. Journal of the Ramanujan Mathematical Society\u00a019, 75\u2013115 (2004)","journal-title":"Journal of the Ramanujan Mathematical Society"},{"key":"6_CR24","unstructured":"Harley, R.: Fast arithmetic on genus 2 curves, for C source code and further explanations, http:\/\/cristal.inria.fr\/~harley\/hyper"},{"issue":"4","key":"6_CR25","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1006\/jsco.2001.0513","volume":"33","author":"F. Hess","year":"2002","unstructured":"Hess, F.: Computing Riemann-Roch spaces in algebraic function fields and related topics. J. Symb. Comput.\u00a033(4), 425\u2013445 (2002)","journal-title":"J. Symb. Comput."},{"key":"6_CR26","unstructured":"Hisil, H.: Elliptic curves, group law, and efficient computation. PhD thesis, Queensland University of Technology (2010)"},{"issue":"6","key":"6_CR27","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1006\/jsco.1994.1063","volume":"18","author":"M.A. Huang","year":"1994","unstructured":"Huang, M.A., Ierardi, D.: Efficient algorithms for the Riemann-Roch problem and for addition in the Jacobian of a curve. J. Symb. Comput.\u00a018(6), 519\u2013539 (1994)","journal-title":"J. Symb. Comput."},{"key":"6_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-540-31815-6_28","volume-title":"Information Security Applications","author":"M. Katagi","year":"2005","unstructured":"Katagi, M., Kitamura, I., Akishita, T., Takagi, T.: Novel Efficient Implementations of Hyperelliptic Curve Cryptosystems using Degenerate Divisors. In: Lim, C.H., Yung, M. (eds.) WISA 2004. LNCS, vol.\u00a03325, pp. 345\u2013359. Springer, Heidelberg (2005)"},{"issue":"245","key":"6_CR29","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1090\/S0025-5718-03-01567-9","volume":"73","author":"K. Khuri-Makdisi","year":"2004","unstructured":"Khuri-Makdisi, K.: Linear algebra algorithms for divisors on an algebraic curve. Math. Comp.\u00a073(245), 333\u2013357 (2004)","journal-title":"Math. Comp."},{"issue":"260","key":"6_CR30","doi-asserted-by":"publisher","first-page":"2213","DOI":"10.1090\/S0025-5718-07-01989-8","volume":"76","author":"K. Khuri-Makdisi","year":"2007","unstructured":"Khuri-Makdisi, K.: Asymptotically fast group operations on jacobians of general curves. Math. Comp.\u00a076(260), 2213\u20132239 (2007)","journal-title":"Math. Comp."},{"issue":"177","key":"6_CR31","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."},{"issue":"3","key":"6_CR32","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(3), 139\u2013150 (1989)","journal-title":"J. Cryptology"},{"key":"6_CR33","unstructured":"Lang, S.: Introduction to algebraic geometry. Addison-Wesley (1972)"},{"key":"6_CR34","unstructured":"Lange, T.: Efficient arithmetic on hyperelliptic curves. PhD thesis, Universit\u00e4t-Gesamthochschule Essen (2001)"},{"key":"6_CR35","unstructured":"Lange, T.: Efficient arithmetic on genus 2 hyperelliptic curves over finite fields via explicit formulae. Cryptology ePrint Archive, Report 2002\/121 (2002), http:\/\/eprint.iacr.org\/"},{"key":"6_CR36","unstructured":"Lange, T.: Inversion-free arithmetic on genus 2 hyperelliptic curves. Cryptology ePrint Archive, Report 2002\/147 (2002), http:\/\/eprint.iacr.org\/"},{"key":"6_CR37","unstructured":"Lange, T.: Weighted coordinates on genus 2 hyperelliptic curves. Cryptology ePrint Archive, Report 2002\/153 (2002), http:\/\/eprint.iacr.org\/"},{"issue":"5","key":"6_CR38","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s00200-004-0154-8","volume":"15","author":"T. Lange","year":"2005","unstructured":"Lange, T.: Formulae for arithmetic on genus 2 hyperelliptic curves. Appl. Algebra Eng. Commun. Comput.\u00a015(5), 295\u2013328 (2005)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"6_CR39","unstructured":"Lange, T.: Elliptic vs. hyperelliptic, part II. Talk at ECC (September 2006)"},{"key":"6_CR40","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1090\/conm\/324\/05738","volume":"324","author":"K. Lauter","year":"2003","unstructured":"Lauter, K.: The equivalence of the geometric and algebraic group laws for Jacobians of genus 2 curves. Topics in Algebraic and Noncommutative Geometry\u00a0324, 165\u2013171 (2003)","journal-title":"Topics in Algebraic and Noncommutative Geometry"},{"key":"6_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-17455-1_1","volume-title":"Pairing-Based Cryptography - Pairing 2010","author":"K. Lauter","year":"2010","unstructured":"Lauter, K., Montgomery, P.L., Naehrig, M.: An Analysis of Affine Coordinates for Pairing Computation. In: Joye, M., Miyaji, A., Otsuka, A. (eds.) Pairing 2010. LNCS, vol.\u00a06487, pp. 1\u201320. Springer, Heidelberg (2010)"},{"issue":"1","key":"6_CR42","first-page":"125","volume":"46","author":"F. Leitenberger","year":"2005","unstructured":"Leitenberger, F.: About the group law for the Jacobi variety of a hyperelliptic curve. Contributions to Algebra and Geometry\u00a046(1), 125\u2013130 (2005)","journal-title":"Contributions to Algebra and Geometry"},{"key":"6_CR43","unstructured":"Matsuo, K., Chao, J., Tsujii, S.: Fast genus two hyperelliptic curve cryptosystems. Technical Report 214, IEIC (2001)"},{"key":"6_CR44","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":"6_CR45","unstructured":"Miyamoto, Y., Doi, H., Matsuo, K., Chao, J., Tsujii, S.: A fast addition algorithm of genus two hyperelliptic curve. In: Symposium on Cryptography and Information Security - SCICS (2002) (in Japanese)"},{"key":"6_CR46","volume-title":"Progress in Mathematics","author":"D. Mumford","year":"1984","unstructured":"Mumford, D.: Tata lectures on theta II. In: Progress in Mathematics, vol.\u00a043. Birkhiauser Boston Inc., Boston (1984)"},{"issue":"143","key":"6_CR47","first-page":"918","volume":"32","author":"J.M. Pollard","year":"1978","unstructured":"Pollard, J.M.: Monte Carlo methods for index computation (mod p). Math. Comp.\u00a032(143), 918\u2013924 (1978)","journal-title":"Math. Comp."},{"issue":"4","key":"6_CR48","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/s00145-009-9038-1","volume":"22","author":"B. Smith","year":"2009","unstructured":"Smith, B.: Isogenies and the discrete logarithm problem in Jacobians of genus 3 hyperelliptic curves. Journal of Cryptology\u00a022(4), 505\u2013529 (2009)","journal-title":"Journal of Cryptology"},{"key":"6_CR49","unstructured":"Sugizaki, H., Matsuo, K., Chao, J., Tsujii, S.: An extension of Harley addition algorithm for hyperelliptic curves over finite fields of characteristic two. Technical Report ISEC2002-9(2002-5), IEICE (2002)"},{"key":"6_CR50","unstructured":"Takahashi, M.: Improving Harley algorithms for Jacobians of genus 2 hyperelliptic curves. In: Symposium on Cryptography and Information Security - SCICS (2002) (in Japanese)"},{"key":"6_CR51","unstructured":"Wollinger, T.: Software and hardware implementation of hyperelliptic curve cryptosystems. PhD thesis, Ruhr-University of Bochum (2004)"},{"key":"6_CR52","doi-asserted-by":"crossref","unstructured":"Wollinger, T., Kovtun, V.: Fast explicit formulae for genus 2 hyperelliptic curves using projective coordinates. In: Fourth International Conference on Information Technology, pp. 893\u2013897 (2007)","DOI":"10.1109\/ITNG.2007.94"},{"key":"6_CR53","doi-asserted-by":"crossref","unstructured":"Wollinger, T., Pelzl, J., Paar, C.: Cantor versus Harley: optimization and analysis of explicit formulae for hyperelliptic curve cryptosystems. IEEE Transactions on Computers, 861\u2013872 (2005)","DOI":"10.1109\/TC.2005.109"},{"key":"6_CR54","series-title":"Lecture Notes in Computer Science","volume-title":"Public Key Cryptography - PKC 2006","year":"2006","unstructured":"Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.): PKC 2006. LNCS, vol.\u00a03958. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Selected Areas in Cryptography"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28496-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T06:03:57Z","timestamp":1742537037000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28496-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642284953","9783642284960"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28496-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}