{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T13:11:31Z","timestamp":1768050691179,"version":"3.49.0"},"reference-count":73,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,11,15]],"date-time":"2014-11-15T00:00:00Z","timestamp":1416009600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s00145-014-9188-7","type":"journal-article","created":{"date-parts":[[2014,11,15]],"date-time":"2014-11-15T03:29:28Z","timestamp":1416022168000},"page":"28-60","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Fast Cryptography in Genus 2"],"prefix":"10.1007","volume":"29","author":[{"given":"Joppe W.","family":"Bos","sequence":"first","affiliation":[]},{"given":"Craig","family":"Costello","sequence":"additional","affiliation":[]},{"given":"Huseyin","family":"Hisil","sequence":"additional","affiliation":[]},{"given":"Kristin","family":"Lauter","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,15]]},"reference":[{"key":"9188_CR1","unstructured":"T. Acar, D. Shumow, Modular reduction without pre-computation for special moduli. Technical report, Microsoft Research, 2010"},{"key":"9188_CR2","doi-asserted-by":"crossref","unstructured":"L.\u00a0Adleman, J.\u00a0DeMarrais, M.\u00a0Huang, A subexponential algorithm for discrete logarithms over hyperelliptic curves of large genus over GF(q). Theor. Comput. Sci.\n                           226(1\u20132), 7\u201318 (1999)","DOI":"10.1016\/S0304-3975(99)00061-4"},{"key":"9188_CR3","doi-asserted-by":"crossref","unstructured":"D.F. Aranha, A.\u00a0Faz-Hern\u00e1ndez, J.\u00a0L\u00f3pez, F.\u00a0Rodr\u00edguez-Henr\u00edquez, Faster implementation of scalar multiplication on Koblitz curves, in A.\u00a0Hevia, G.\u00a0Neven, editors, LATINCRYPT. Lecture Notes in Computer Science, vol. 7533 (Springer, 2012), pp. 177\u2013193","DOI":"10.1007\/978-3-642-33481-8_10"},{"key":"9188_CR4","doi-asserted-by":"crossref","unstructured":"D.J. Bernstein, Curve25519: New Diffie\u2013Hellman speed records, in M.\u00a0Yung, Y.\u00a0Dodis, A.\u00a0Kiayias, T.\u00a0Malkin, editors, Public Key Cryptography\u2014PKC 2006. Lecture Notes in Computer Science, vol. 3958 (Springer, Heidelberg, 2006), pp. 207\u2013228","DOI":"10.1007\/11745853_14"},{"key":"9188_CR5","unstructured":"D.J. Bernstein, Differential addition chains. URL: \n                    http:\/\/cr.yp.to\/ecdh\/diffchain-20060219.pdf\n                    \n                  , February 2006"},{"key":"9188_CR6","unstructured":"D.J. Bernstein, Elliptic vs. Hyperelliptic, part I. Talk at ECC (slides at \n                    http:\/\/cr.yp.to\/talks\/2006.09.20\/slides.pdf\n                    \n                  ,), September 2006"},{"key":"9188_CR7","doi-asserted-by":"crossref","unstructured":"D.J. Bernstein, C. Chuengsatiansup, T. Lange, P. Schwabe, Kummer strikes back: new DH speed records. Cryptology ePrint Archive, Report 2014\/134, 2014. \n                    http:\/\/eprint.iacr.org\/","DOI":"10.1007\/978-3-662-45611-8_17"},{"key":"9188_CR8","doi-asserted-by":"crossref","unstructured":"D.J. Bernstein, N. Duif, T. Lange, P. Schwabe, B.-Y. Yang, High-speed high-security signatures, in B. Preneel, T. Takagi, editors, CHES. Lecture Notes in Computer Science, vol. 6917 (Springer, 2011), pp. 124\u2013142","DOI":"10.1007\/978-3-642-23951-9_9"},{"key":"9188_CR9","doi-asserted-by":"crossref","unstructured":"D.J. Bernstein, T. Lange, Analysis and optimization of elliptic-curve single-scalar multiplication, in G.L. Mullen, D. Panario, I.E. Shparlinski, editors, Finite Fields and Applications. Contemporary Mathematics Series, vol. 461 (American Mathematical Society, 2008), pp. 1\u201319","DOI":"10.1090\/conm\/461\/08979"},{"key":"9188_CR10","unstructured":"D.J. Bernstein, T. Lange (editors), eBACS: ECRYPT Benchmarking of Cryptographic Systems. \n                    http:\/\/bench.cr.yp.to\n                    \n                  , accessed 4 October 2012"},{"key":"9188_CR11","doi-asserted-by":"crossref","unstructured":"J.W. Bos, High-performance modular multiplication on the Cell processor, in M.A. Hasan, T. Helleseth, editors, Arithmetic of Finite Fields - WAIFI 2010. Lecture Notes in Computer Science, vol. 6087 (Springer, Heidelberg, 2010), pp. 7\u201324","DOI":"10.1007\/978-3-642-13797-6_2"},{"key":"9188_CR12","doi-asserted-by":"crossref","unstructured":"J.W. Bos, C. Costello, A. Miele, Elliptic and hyperelliptic curves: A practical security analysis, in H. Krawczyk, editor, Public Key Cryptography\u2014PKC 2014. Lecture Notes in Computer Science, vol. 8383 (Springer, 2014), pp. 203\u2013220","DOI":"10.1007\/978-3-642-54631-0_12"},{"key":"9188_CR13","doi-asserted-by":"crossref","unstructured":"J.W. Bos, M.E. Kaihara, T. Kleinjung, A.K. Lenstra, P.L. Montgomery, Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction. Int. J. Appl. Cryptogr.\n                           2(3), 212\u2013228 (2012)","DOI":"10.1504\/IJACT.2012.045590"},{"key":"9188_CR14","doi-asserted-by":"crossref","unstructured":"A. Brauer, On addition chains. Bull. Am. Math. Soc.\n                           45, 736\u2013739 (1939)","DOI":"10.1090\/S0002-9904-1939-07068-7"},{"key":"9188_CR15","doi-asserted-by":"crossref","unstructured":"M. Brown, D. Hankerson, J.L\u00f3pez, A. Menezes, Software implementation of the NIST elliptic curves over prime fields, in D. Naccache, editor, CT-RSA. Lecture Notes in Computer Science, vol. 2020 (Springer, Heidelberg, 2001), pp. 250\u2013265","DOI":"10.1007\/3-540-45353-9_19"},{"key":"9188_CR16","doi-asserted-by":"crossref","unstructured":"J. Buhler, N. Koblitz, Lattice basis reduction, Jacobi sums and hyperelliptic cryptosystems. Bull. Aust. Math. Soc.\n                           58(1), 147\u2013154 (1998)","DOI":"10.1017\/S000497270003207X"},{"key":"9188_CR17","unstructured":"D.V. Chudnovsky, G.V. Chudnovsky, Sequences of numbers generated by addition in formal groups and new primality and factorization tests. Adv. Appl. Math.\n                           7, 385\u2013434 (1986)"},{"key":"9188_CR18","doi-asserted-by":"crossref","unstructured":"R. Cosset, Factorization with genus 2 curves. Math. Comput.\n                           79(270), 1191\u20131208 (2010)","DOI":"10.1090\/S0025-5718-09-02295-9"},{"key":"9188_CR19","doi-asserted-by":"crossref","unstructured":"C. Costello, K. Lauter, Group law computations on Jacobians of hyperelliptic curves, in A. Miri, S. Vaudenay, editors, Selected Areas in Cryptography. Lecture Notes in Computer Science, vol. 7118 (Springer, 2011), pp. 92\u2013117","DOI":"10.1007\/978-3-642-28496-0_6"},{"key":"9188_CR20","unstructured":"C. Diem, On the discrete logarithm problem in class groups of curves. Math. Comput.\n                           80, 443\u2013475 (2011)"},{"key":"9188_CR21","doi-asserted-by":"crossref","unstructured":"I.M. Duursma, P. Gaudry, F. Morain, Speeding up the discrete log computation on curves with automorphisms, in K.-Y. Lam, E. Okamoto, C. Xing, editors, Asiacrypt 1999. Lecture Notes in Computer Science, vol. 1716 (Springer, Heidelberg, 1999), pp. 103\u2013121","DOI":"10.1007\/978-3-540-48000-6_10"},{"key":"9188_CR22","unstructured":"K. Eisentrager, K. Lauter, A CRT algorithm for constructing genus 2 curves over finite fields. AGCT-11 (2007)"},{"key":"9188_CR23","unstructured":"A. Enge, Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time. Math. Comput.\n                           71, 729\u2013742 (2002)"},{"key":"9188_CR24","doi-asserted-by":"crossref","unstructured":"E. Furukawa, M. Kawazoe, T. Takahashi, Counting points for hyperelliptic curves of type \n                    \n                      \n                    \n                    $$\\text{ y }^{\\text{2 }}= \\text{ x }^{\\text{5 }}$$\n                    \n                      \n                        \n                          \n                          y\n                          \n                            \n                            \n                              2\n                              \n                            \n                          \n                          =\n                          \n                          x\n                          \n                            \n                            \n                              5\n                              \n                            \n                          \n                        \n                      \n                    \n                   + ax over finite prime fields, in M. Matsui, R.J. Zuccherato, editors, Selected Areas in Cryptography. Lecture Notes in Computer Science, vol. 3006 (Springer, 2003), pp. 26\u201341","DOI":"10.1007\/978-3-540-24654-1_3"},{"key":"9188_CR25","doi-asserted-by":"crossref","unstructured":"S.D. Galbraith, X. Lin, M. Scott, Endomorphisms for faster elliptic curve cryptography on a large class of curves. J. Cryptol.\n                           24(3), 446\u2013469 (2011)","DOI":"10.1007\/s00145-010-9065-y"},{"key":"9188_CR26","doi-asserted-by":"crossref","unstructured":"R.P. Gallant, R.J. Lambert, S.A. Vanstone, Faster point multiplication on elliptic curves with efficient endomorphisms, in J. Kilian, editor, CRYPTO. Lecture Notes in Computer Science, vol. 2139 (Springer, 2001), pp. 190\u2013200","DOI":"10.1007\/3-540-44647-8_11"},{"key":"9188_CR27","doi-asserted-by":"crossref","unstructured":"P. Gaudry, An algorithm for solving the discrete log problem on hyperelliptic curves. Eurocrypt, 1807, 19\u201334 (2000)","DOI":"10.1007\/3-540-45539-6_2"},{"key":"9188_CR28","unstructured":"P. Gaudry, Algorithmique des courbes hyperelliptiques et applications \u00e0 la cryptologie. PhD thesis, \u00c9cole polytechnique. \n                    http:\/\/www.lix.polytechnique.fr\/Labo\/Pierrick.Gaudry\/publis\/\n                    \n                   (2000)"},{"key":"9188_CR29","doi-asserted-by":"crossref","unstructured":"P. Gaudry, Fast genus 2 arithmetic based on theta functions. J. Math. Cryptol. JMC\n                           1(3), 243\u2013265 (2007)","DOI":"10.1515\/JMC.2007.012"},{"key":"9188_CR30","doi-asserted-by":"crossref","unstructured":"P. Gaudry, Genus 2 formulae based on Theta functions and their implementation. Talk at ECC \n                    http:\/\/mathsci.ucd.ie\/gmg\/ECC2007Talks\/ecc07-gaudry2.pdf\n                    \n                  , September 2007","DOI":"10.1515\/JMC.2007.012"},{"key":"9188_CR31","unstructured":"P. Gaudry, Personal communication (2011)"},{"key":"9188_CR32","doi-asserted-by":"crossref","unstructured":"P. Gaudry, T. Houtmann, D.R. Kohel, C. Ritzenthaler, A. Weng, The 2-adic CM method for genus 2 curves with application to cryptography, in X. Lai, K. Chen, editors, ASIACRYPT. Lecture Notes in Computer Science, vol. 4284 (Springer, 2006), pp. 114\u2013129","DOI":"10.1007\/11935230_8"},{"key":"9188_CR33","doi-asserted-by":"crossref","unstructured":"P. Gaudry, D.R. Kohel, B.A. Smith, Counting points on genus 2 curves with real multiplication, in D.H. Lee, X. Wang, editors,ASIACRYPT. Lecture Notes in Computer Science, vol. 7073 (Springer, 2011), pp. 504\u2013519","DOI":"10.1007\/978-3-642-25385-0_27"},{"key":"9188_CR34","doi-asserted-by":"crossref","unstructured":"P. Gaudry, \u00c9. Schost, Genus 2 point counting over prime fields. J. Symb. Comput.\n                           47(4), 368\u2013400 (2012)","DOI":"10.1016\/j.jsc.2011.09.003"},{"key":"9188_CR35","unstructured":"P. Gaudry, E. Thom\u00e9, The mp\n                    \n                      \n                    \n                    $$\\mathbb{F}_q$$\n                    \n                      \n                        \n                          F\n                          q\n                        \n                      \n                    \n                   library and implementing curve-based key exchanges, in Software Performance Enhancement for Encryption and Decryption\u2014SPEED 2007, pp. 49\u201364 (2007). \n                    www.loria.fr\/~gaudry\/publis\/mpfq.pdf"},{"key":"9188_CR36","unstructured":"M. Hamburg, Fast and compact elliptic-curve cryptography. Cryptology ePrint Archive, Report 2012\/309, 2012. \n                    http:\/\/eprint.iacr.org\/"},{"key":"9188_CR37","doi-asserted-by":"crossref","unstructured":"H. Hisil, K.K.-H. Wong, G. Carter, E. Dawson, Twisted Edwards curves revisited, in J. Pieprzyk, editor, Asiacrypt 2008. Lecture Notes in Computer Science, vol. 5350 (Springer, Heidelberg, 2008), pp. 326\u2013343","DOI":"10.1007\/978-3-540-89255-7_20"},{"key":"9188_CR38","doi-asserted-by":"crossref","unstructured":"B.S. Kaliski Jr, The Montgomery inverse and its applications. IEEE Trans. Comput.\n                           44(8), 1064\u20131065 (1995)","DOI":"10.1109\/12.403725"},{"key":"9188_CR39","doi-asserted-by":"crossref","unstructured":"E. K\u00e4sper, Fast elliptic curve cryptography in OpenSSL, in G. Danezis, S. Dietrich, K. Sako, editors, Financial Cryptography Workshops. Lecture Notes in Computer Science, vol. 7126 (Springer, 2012) pp. 27\u201339","DOI":"10.1007\/978-3-642-29889-9_4"},{"key":"9188_CR40","doi-asserted-by":"crossref","unstructured":"M. Kne\u017eevi\u0107, F. Vercauteren, I. Verbauwhede, Speeding up bipartite modular multiplication, in M. Hasan, T. Helleseth, editors, Arithmetic of Finite Fields - WAIFI 2010. Lecture Notes in Computer Science, vol. 6087 (Springer, Berlin \/ Heidelberg, 2010), pp. 166\u2013179","DOI":"10.1007\/978-3-642-13797-6_12"},{"key":"9188_CR41","doi-asserted-by":"crossref","unstructured":"N. Koblitz, Elliptic curve cryptosystems. Math. Comput.\n                           48(177), 203\u2013209 (1987)","DOI":"10.1090\/S0025-5718-1987-0866109-5"},{"key":"9188_CR42","doi-asserted-by":"crossref","unstructured":"P.C. Kocher, Timing attacks on implementations of Diffie\u2013Hellman, RSA, DSS, and other systems, in N. Koblitz, editor, Crypto 1996. Lecture Notes in Computer Science, vol. 1109 (Springer, Heidelberg, 1996), pp. 104\u2013113","DOI":"10.1007\/3-540-68697-5_9"},{"key":"9188_CR43","unstructured":"D.R. Kohel, Databases for Elliptic Curves and Higher Dimensional Analogues (Echidna). \n                    http:\/\/echidna.maths.usyd.edu.au\/kohel\/dbs\/"},{"key":"9188_CR44","doi-asserted-by":"crossref","unstructured":"D.R. Kohel, B.A. Smith, Efficiently computable endomorphisms for hyperelliptic curves, in F. Hess, S. Pauli, M.E. Pohst, editors, ANTS. Lecture Notes in Computer Science, vol. 4076 (Springer, 2006), pp. 495\u2013509","DOI":"10.1007\/11792086_35"},{"key":"9188_CR45","doi-asserted-by":"crossref","unstructured":"A.K. Lenstra, Generating RSA moduli with a predetermined portion, in K. Ohta, D. Pei, editors, Asiacrypt\u201998. Lecture Notes in Computer Science, vol. 1514 (Springer, Berlin\/Heidelberg, 1998), pp. 1\u201310","DOI":"10.1007\/3-540-49649-1_1"},{"key":"9188_CR46","doi-asserted-by":"crossref","unstructured":"C.H. Lim, H.S. Hwang, Speeding up elliptic scalar multiplication with precomputation, in J. Song, editor, Information Security and Cryptology\u2014ICISC\u201999. Lecture Notes in Computer Science, vol. 1787 (Springer, 2000), pp. 102\u2013119","DOI":"10.1007\/10719994_9"},{"key":"9188_CR47","doi-asserted-by":"crossref","unstructured":"C.H. Lim, P.J. Lee, More flexible exponentiation with precomputation, in Y. Desmedt, editor, CRYPTO. Lecture Notes in Computer Science, vol. 839 (Springer, 1994), pp. 95\u2013107","DOI":"10.1007\/3-540-48658-5_11"},{"key":"9188_CR48","doi-asserted-by":"crossref","unstructured":"P. Longa, F. Sica, Four-dimensional Gallant\u2013Lambert\u2013Vanstone scalar multiplication, in X. Wang, K. Sako, editors, Asiacrypt 2012. Lecture Notes in Computer Science, vol. 7658 (Springer, 2012), pp. 718\u2013739","DOI":"10.1007\/978-3-642-34961-4_43"},{"key":"9188_CR49","unstructured":"J.-F. Mestre, Couples de jacobiennes isogenes de courbes hyperelliptiques. Preprint, arXiv \n                    http:\/\/arxiv.org\/abs\/0902.3470\n                    \n                  , or see \n                    http:\/\/www.lix.polytechnique.fr\/ smith\/Mestre--families.pdf\n                    \n                   (2009)"},{"key":"9188_CR50","doi-asserted-by":"crossref","unstructured":"V.S. Miller, Use of elliptic curves in cryptography, in H.C. Williams, editor, Crypto 1985. Lecture Notes in Computer Science, vol. 218 (Springer, Heidelberg, 1986), pp. 417\u2013426","DOI":"10.1007\/3-540-39799-X_31"},{"key":"9188_CR51","doi-asserted-by":"crossref","unstructured":"P.L. Montgomery, Modular multiplication without trial division. Math. Comput.\n                           44(170), 519\u2013521 (1985)","DOI":"10.1090\/S0025-5718-1985-0777282-X"},{"key":"9188_CR52","doi-asserted-by":"crossref","unstructured":"P.L. Montgomery, Speeding the Pollard and elliptic curve methods of factorization. Math. Comput.\n                           48(177), 243\u2013264 (1987)","DOI":"10.1090\/S0025-5718-1987-0866113-7"},{"key":"9188_CR53","unstructured":"P.L. Montgomery, Evaluating recurrences of form \n                    \n                      \n                    \n                    $$x_{m+n}=f(x_m, x_n, x_{m-n})$$\n                    \n                      \n                        \n                          \n                            x\n                            \n                              m\n                              +\n                              n\n                            \n                          \n                          =\n                          f\n                          \n                            (\n                            \n                              x\n                              m\n                            \n                            ,\n                            \n                              x\n                              n\n                            \n                            ,\n                            \n                              x\n                              \n                                m\n                                -\n                                n\n                              \n                            \n                            )\n                          \n                        \n                      \n                    \n                   via lucas chains. \n                    ftp:\/\/ftp.cwi.nl\/pub\/pmontgom\/Lucas.ps.gz\n                    \n                   (1992)"},{"key":"9188_CR54","doi-asserted-by":"crossref","unstructured":"F. Morain, J. Olivos, Speeding up the computations on an elliptic curve using addition\u2013subtraction chains. Inform. Th\u00e9or. Appl. Theor. Inform. Appl.\n                           24, 531\u2013544 (1990)","DOI":"10.1051\/ita\/1990240605311"},{"key":"9188_CR55","unstructured":"National Security Agency, Fact sheet NSA Suite B Cryptography. \n                    http:\/\/www.nsa.gov\/ia\/programs\/suiteb_cryptography\/index.shtml\n                    \n                   (2009)"},{"key":"9188_CR56","unstructured":"T. Oliveira, J.L\u00f3pez, D.F. Aranha, F. Rodr\u00edguez-Henr\u00edquez, Two is the fastest prime: lambda coordinates for binary elliptic curves. J. Cryptogr. Eng.\n                           4(1), 3\u201317 (2014)"},{"key":"9188_CR57","unstructured":"T. Oliveira, F. Rodr\u00edguez-Henr\u00edquez, J.L\u00f3pez, New timings for scalar multiplication using a new set of coordinates. Rump session talk at ECC 2012 October 2012 (2012)"},{"key":"9188_CR58","doi-asserted-by":"crossref","unstructured":"Y.-H. Park, S. Jeong, J. Lim, Speeding up point multiplication on hyperelliptic curves with efficiently-computable endomorphisms, in L.R. Knudsen, editor, EUROCRYPT. Lecture Notes in Computer Science, vol. 2332 (Springer, 2002), pp. 197\u2013208","DOI":"10.1007\/3-540-46035-7_13"},{"key":"9188_CR59","doi-asserted-by":"crossref","unstructured":"J. Pila. Frobenius maps of abelian varieties and finding roots of unity in finite fields. Math. Comput.\n                           55(192), 745\u2013763 (1990)","DOI":"10.1090\/S0025-5718-1990-1035941-X"},{"key":"9188_CR60","doi-asserted-by":"crossref","unstructured":"J.M. Pollard, Monte Carlo methods for index computation (mod \n                    \n                      \n                    \n                    $$p$$\n                    \n                      \n                        p\n                      \n                    \n                  ). Math. Comput.\n                           32(143), 918\u2013924 (1978)","DOI":"10.2307\/2006496"},{"key":"9188_CR61","unstructured":"A. Scholz, Aufgabe 253. Jahresbericht der deutschen Mathematiker-Vereingung\n                           47, 41\u201342 (1937)"},{"key":"9188_CR62","doi-asserted-by":"crossref","unstructured":"R. Schoof, Elliptic curves over finite fields and the computation of square roots mod p. Math. Comput.\n                           44(170), 483\u2013494 (1985)","DOI":"10.2307\/2007968"},{"key":"9188_CR63","doi-asserted-by":"crossref","unstructured":"D. Shanks, Class number, a theory of factorization, and genera, in D.J. Lewis, editor, Symposia in Pure Mathematics, vol. 20 (American Mathematical Society, 1971), pp. 415\u2013440","DOI":"10.1090\/pspum\/020\/0316385"},{"key":"9188_CR64","doi-asserted-by":"crossref","unstructured":"N.P. Smart, S. Siksek, A fast Diffie\u2013Hellman protocol in genus 2. J. Cryptol.\n                           12(1), 67\u201373 (1999)","DOI":"10.1007\/PL00003818"},{"key":"9188_CR65","unstructured":"J.A. Solinas, Generalized Mersenne numbers. Technical Report CORR 99\u201339, Centre for Applied Cryptographic Research, University of Waterloo (1999)"},{"key":"9188_CR66","unstructured":"M. Stam, Speeding up Subgroup Cryptosystems. PhD thesis, Technische Universiteit Eindhoven, May 2003 (2003)"},{"key":"9188_CR67","doi-asserted-by":"crossref","unstructured":"K. Takashima, A new type of fast endomorphisms on Jacobians of hyperelliptic curves and their cryptographic application. IEICE Trans.\n                           89-A(1), 124\u2013133 (2006)","DOI":"10.1093\/ietfec\/e89-a.1.124"},{"key":"9188_CR68","unstructured":"E.G. Thurber, On addition chains \n                    \n                      \n                    \n                    $$l(mn)\\le l(n)-b$$\n                    \n                      \n                        \n                          l\n                          (\n                          m\n                          n\n                          )\n                          \u2264\n                          l\n                          (\n                          n\n                          )\n                          -\n                          b\n                        \n                      \n                    \n                   and lower bounds for \n                    \n                      \n                    \n                    $$c(r)$$\n                    \n                      \n                        \n                          c\n                          (\n                          r\n                          )\n                        \n                      \n                    \n                  . Duke Math. J.\n                           40, 907\u2013913 (1973)"},{"key":"9188_CR69","unstructured":"U.S. Department of Commerce\/National Institute of Standards and Technology. Digital Signature Standard (DSS). FIPS-186-3, 2009. \n                    http:\/\/csrc.nist.gov\/publications\/fips\/fips186-3\/fips_186-3.pdf"},{"key":"9188_CR70","doi-asserted-by":"crossref","unstructured":"P.B. van Wamelen, Examples of genus two CM curves defined over the rationals. Math. Comput.\n                           68(225), 307\u2013320 (1999)","DOI":"10.1090\/S0025-5718-99-01020-0"},{"key":"9188_CR71","doi-asserted-by":"crossref","unstructured":"P.B. van Wamelen, Computing with the analytic Jacobian of a genus 2 curve, in W. Bosma, J. Cannon, M. Bronstein, A.M. Cohen, H. Cohen, D. Eisenbud, B. Sturmfels, editors, Discovering Mathematics with Magma. Algorithms and Computation in Mathematics, vol. 19 (Springer, Berlin Heidelberg, 2006), pp. 117\u2013135","DOI":"10.1007\/978-3-540-37634-7_5"},{"key":"9188_CR72","doi-asserted-by":"crossref","unstructured":"A. Weng, Constructing hyperelliptic curves of genus 2 suitable for cryptography. Math. Comput.\n                           72(241), 435\u2013458 (2003)","DOI":"10.1090\/S0025-5718-02-01422-9"},{"key":"9188_CR73","doi-asserted-by":"crossref","unstructured":"M.J. Wiener, R.J. Zuccherato, Faster attacks on elliptic curve cryptosystems, in S. Tavares, H. Meijer, editors, Selected Areas in Cryptography\u2014(SAC) 1998. Lecture Notes in Computer Science, vol. 1556 (Springer New York, 1999), pp. 190\u2013200","DOI":"10.1007\/3-540-48892-8_15"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-014-9188-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00145-014-9188-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-014-9188-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-014-9188-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,8]],"date-time":"2020-04-08T08:18:51Z","timestamp":1586333931000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00145-014-9188-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,15]]},"references-count":73,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["9188"],"URL":"https:\/\/doi.org\/10.1007\/s00145-014-9188-7","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,15]]},"assertion":[{"value":"11 March 2013","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 November 2014","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}