{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T04:48:11Z","timestamp":1764305291029},"publisher-location":"Berlin, Heidelberg","reference-count":58,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642383472"},{"type":"electronic","value":"9783642383489"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38348-9_12","type":"book-chapter","created":{"date-parts":[[2013,5,8]],"date-time":"2013-05-08T20:46:38Z","timestamp":1368045998000},"page":"194-210","source":"Crossref","is-referenced-by-count":45,"title":["Fast Cryptography in Genus 2"],"prefix":"10.1007","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","reference":[{"key":"12_CR1","unstructured":"Acar, T., Shumow, D.: Modular reduction without pre-computation for special moduli. Technical report, Microsoft Research (2010)"},{"issue":"1-2","key":"12_CR2","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/S0304-3975(99)00061-4","volume":"226","author":"L. Adleman","year":"1999","unstructured":"Adleman, L., DeMarrais, J., Huang, M.: A subexponential algorithm for discrete logarithms over hyperelliptic curves of large genus over GF(q). Theoretical Computer Science\u00a0226(1-2), 7\u201318 (1999)","journal-title":"Theoretical Computer Science"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Aranha, D.F., Faz-Hern\u00e1ndez, A., L\u00f3pez, J., Rodr\u00edguez-Henr\u00edquez, F.: Faster implementation of scalar multiplication on Koblitz curves. In: Hevia, A., Neven, G. (eds.) LATINCRYPT 2012. LNCS, vol.\u00a07533, pp. 177\u2013193. Springer, Heidelberg (2012)","DOI":"10.1007\/978-3-642-33481-8_10"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/11745853_14","volume-title":"Public Key Cryptography - PKC 2006","author":"D.J. Bernstein","year":"2006","unstructured":"Bernstein, D.J.: Curve25519: New Diffie-Hellman speed records. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T. (eds.) PKC 2006. LNCS, vol.\u00a03958, pp. 207\u2013228. Springer, Heidelberg (2006)"},{"key":"12_CR5","unstructured":"Bernstein, D.J.: Elliptic vs. Hyperelliptic, part I. Talk at ECC, slides at (September 2006), \n                  \n                    http:\/\/cr.yp.to\/talks\/2006.09.20\/slides.pdf"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-642-23951-9_9","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2011","author":"D.J. Bernstein","year":"2011","unstructured":"Bernstein, D.J., Duif, N., Lange, T., Schwabe, P., Yang, B.-Y.: High-speed high-security signatures. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol.\u00a06917, pp. 124\u2013142. Springer, Heidelberg (2011)"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Lange, T.: Analysis and optimization of elliptic-curve single-scalar multiplication. In: Finite Fields and Applications. Contemporary Mathematics Series, vol.\u00a0461, pp. 1\u201319. American Mathematical Society (2008)","DOI":"10.1090\/conm\/461\/08979"},{"key":"12_CR8","unstructured":"Bernstein, D.J., Lange, T. (eds). eBACS: ECRYPT Benchmarking of Cryptographic Systems, \n                  \n                    http:\/\/bench.cr.yp.to\n                  \n                  \n                 (accessed October 4, 2012)"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/978-3-642-13797-6_2","volume-title":"Arithmetic of Finite Fields","author":"J.W. Bos","year":"2010","unstructured":"Bos, J.W.: High-performance modular multiplication on the Cell processor. In: Hasan, M.A., Helleseth, T. (eds.) WAIFI 2010. LNCS, vol.\u00a06087, pp. 7\u201324. Springer, Heidelberg (2010)"},{"key":"12_CR10","unstructured":"Bos, J.W., Costello, C., Hisil, H., Lauter, K.: Two is greater than one. Cryptology ePrint Archive, Report 2012\/670 (2012), \n                  \n                    http:\/\/eprint.iacr.org\/"},{"issue":"3","key":"12_CR11","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1504\/IJACT.2012.045590","volume":"2","author":"J.W. Bos","year":"2012","unstructured":"Bos, J.W., Kaihara, M.E., Kleinjung, T., Lenstra, A.K., Montgomery, P.L.: Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction. Int. J. of Applied Cryptography\u00a02(3), 212\u2013228 (2012)","journal-title":"Int. J. of Applied Cryptography"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1090\/S0002-9904-1939-07068-7","volume":"45","author":"A. Brauer","year":"1939","unstructured":"Brauer, A.: On addition chains. Bulletin of the American Mathematical Society\u00a045, 736\u2013739 (1939)","journal-title":"Bulletin of the American Mathematical Society"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/3-540-45353-9_19","volume-title":"Topics in Cryptology - CT-RSA 2001","author":"M. Brown","year":"2001","unstructured":"Brown, M., Hankerson, D., L\u00f3pez, J., Menezes, A.: Software implementation of the NIST elliptic curves over prime fields. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol.\u00a02020, pp. 250\u2013265. Springer, Heidelberg (2001)"},{"issue":"1","key":"12_CR14","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1017\/S000497270003207X","volume":"58","author":"J. Buhler","year":"1998","unstructured":"Buhler, J., Koblitz, N.: Lattice basis reduction, Jacobi sums and hyperelliptic cryptosystems. Bull. of the Australian Math. Soc.\u00a058(1), 147\u2013154 (1998)","journal-title":"Bull. of the Australian Math. Soc."},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/0196-8858(86)90023-0","volume":"7","author":"D.V. Chudnovsky","year":"1986","unstructured":"Chudnovsky, D.V., Chudnovsky, G.V.: Sequences of numbers generated by addition in formal groups and new primality and factorization tests. Advances in Applied Mathematics\u00a07, 385\u2013434 (1986)","journal-title":"Advances in Applied Mathematics"},{"issue":"270","key":"12_CR16","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1090\/S0025-5718-09-02295-9","volume":"79","author":"R. Cosset","year":"2010","unstructured":"Cosset, R.: Factorization with genus 2 curves. Math. Comp.\u00a079(270), 1191\u20131208 (2010)","journal-title":"Math. Comp."},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-642-28496-0_6","volume-title":"Selected Areas in Cryptography","author":"C. Costello","year":"2012","unstructured":"Costello, C., Lauter, K.: Group law computations on Jacobians of hyperelliptic curves. In: Miri, A., Vaudenay, S. (eds.) SAC 2011. LNCS, vol.\u00a07118, pp. 92\u2013117. Springer, Heidelberg (2012)"},{"key":"12_CR18","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1090\/S0025-5718-2010-02281-1","volume":"80","author":"C. Diem","year":"2011","unstructured":"Diem, C.: On the discrete logarithm problem in class groups of curves. Math. Comp.\u00a080, 443\u2013475 (2011)","journal-title":"Math. Comp."},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/978-3-540-48000-6_10","volume-title":"Advances in Cryptology - ASIACRYPT\u201999","author":"I.M. Duursma","year":"1999","unstructured":"Duursma, I.M., Gaudry, P., Morain, F.: Speeding up the discrete log computation on curves with automorphisms. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol.\u00a01716, pp. 103\u2013121. Springer, Heidelberg (1999)"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1090\/S0025-5718-01-01363-1","volume":"71","author":"A. Enge","year":"2002","unstructured":"Enge, A.: Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time. Math. Comp.\u00a071, 729\u2013742 (2002)","journal-title":"Math. Comp."},{"key":"12_CR21","series-title":"LNCS","first-page":"26","volume-title":"SAC 2003","author":"E. Furukawa","year":"2003","unstructured":"Furukawa, E., Kawazoe, M., Takahashi, T.: Counting points for hyperelliptic curves of type y2= x5 + ax over finite prime fields. In: SAC 2003. LNCS, vol.\u00a03006, pp. 26\u201341. Springer, Heidelberg (2003)"},{"issue":"3","key":"12_CR22","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/s00145-010-9065-y","volume":"24","author":"S.D. Galbraith","year":"2011","unstructured":"Galbraith, S.D., Lin, X., Scott, M.: Endomorphisms for faster elliptic curve cryptography on a large class of curves. J. Cryptology\u00a024(3), 446\u2013469 (2011)","journal-title":"J. Cryptology"},{"key":"12_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-44647-8_11","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"R.P. Gallant","year":"2001","unstructured":"Gallant, R.P., Lambert, R.J., Vanstone, S.A.: Faster point multiplication on elliptic curves with efficient endomorphisms. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 190\u2013200. Springer, Heidelberg (2001)"},{"key":"12_CR24","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":"12_CR25","unstructured":"Gaudry, P.: Algorithmique des courbes hyperelliptiques et applications \u00e0 la cryptologie. PhD thesis, \u00c9cole polytechnique (2000), \n                  \n                    http:\/\/www.lix.polytechnique.fr\/Labo\/Pierrick.Gaudry\/publis\/"},{"issue":"3","key":"12_CR26","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1515\/JMC.2007.012","volume":"1","author":"P. Gaudry","year":"2007","unstructured":"Gaudry, P.: Fast genus 2 arithmetic based on theta functions. Journal of Mathematical Cryptology\u00a01(3), 243\u2013265 (2007)","journal-title":"Journal of Mathematical Cryptology"},{"key":"12_CR27","unstructured":"Gaudry, P.: Personal communication (2011)"},{"key":"12_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/978-3-642-25385-0_27","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"P. Gaudry","year":"2011","unstructured":"Gaudry, P., Kohel, D.R., Smith, B.A.: Counting points on genus 2 curves with real multiplication. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol.\u00a07073, pp. 504\u2013519. Springer, Heidelberg (2011)"},{"issue":"4","key":"12_CR29","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1016\/j.jsc.2011.09.003","volume":"47","author":"P. Gaudry","year":"2012","unstructured":"Gaudry, P., Schost, \u00c9.: Genus 2 point counting over prime fields. J. Symb. Comp.\u00a047(4), 368\u2013400 (2012)","journal-title":"J. Symb. Comp."},{"key":"12_CR30","unstructured":"Gaudry, P., Thom\u00e9, E.: The mp\n                  \n                    \n                  \n                  $\\mathbb{F}_q$\n                 library and implementing curve-based key exchanges. In: SPEED 2007, pp. 49\u201364 (2007), \n                  \n                    http:\/\/www.loria.fr\/~gaudry\/publis\/mpfq.pdf"},{"key":"12_CR31","unstructured":"Hamburg, M.: Fast and compact elliptic-curve cryptography. Cryptology ePrint Archive, Report 2012\/309 (2012), \n                  \n                    http:\/\/eprint.iacr.org\/"},{"key":"12_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-540-89255-7_20","volume-title":"Advances in Cryptology - ASIACRYPT 2008","author":"H. Hisil","year":"2008","unstructured":"Hisil, H., Wong, K.K.-H., Carter, G., Dawson, E.: Twisted Edwards curves revisited. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol.\u00a05350, pp. 326\u2013343. Springer, Heidelberg (2008)"},{"issue":"8","key":"12_CR33","doi-asserted-by":"publisher","first-page":"1064","DOI":"10.1109\/12.403725","volume":"44","author":"B.S. Kaliski Jr.","year":"1995","unstructured":"Kaliski Jr., B.S.: The Montgomery inverse and its applications. IEEE Transactions on Computers\u00a044(8), 1064\u20131065 (1995)","journal-title":"IEEE Transactions on Computers"},{"key":"12_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-642-29889-9_4","volume-title":"Financial Cryptography and Data Security","author":"E. K\u00e4sper","year":"2012","unstructured":"K\u00e4sper, E.: Fast elliptic curve cryptography in openSSL. In: Danezis, G., Dietrich, S., Sako, K. (eds.) FC 2011 Workshops 2011. LNCS, vol.\u00a07126, pp. 27\u201339. Springer, Heidelberg (2012)"},{"key":"12_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-642-13797-6_12","volume-title":"Arithmetic of Finite Fields","author":"M. Kne\u017eevi\u0107","year":"2010","unstructured":"Kne\u017eevi\u0107, M., Vercauteren, F., Verbauwhede, I.: Speeding up bipartite modular multiplication. In: Hasan, M.A., Helleseth, T. (eds.) WAIFI 2010. LNCS, vol.\u00a06087, pp. 166\u2013179. Springer, Heidelberg (2010)"},{"issue":"177","key":"12_CR36","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."},{"key":"12_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/3-540-68697-5_9","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"P.C. Kocher","year":"1996","unstructured":"Kocher, P.C.: Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 104\u2013113. Springer, Heidelberg (1996)"},{"key":"12_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/11792086_35","volume-title":"Algorithmic Number Theory","author":"D.R. Kohel","year":"2006","unstructured":"Kohel, D.R., Smith, B.A.: Efficiently computable endomorphisms for hyperelliptic curves. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol.\u00a04076, pp. 495\u2013509. Springer, Heidelberg (2006)"},{"key":"12_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-49649-1_1","volume-title":"Advances in Cryptology - ASIACRYPT\u201998","author":"A.K. Lenstra","year":"1998","unstructured":"Lenstra, A.K.: Generating RSA moduli with a predetermined portion. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol.\u00a01514, pp. 1\u201310. Springer, Heidelberg (1998)"},{"key":"12_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"718","DOI":"10.1007\/978-3-642-34961-4_43","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"P. Longa","year":"2012","unstructured":"Longa, P., Sica, F.: Four-dimensional Gallant-Lambert-Vanstone scalar multiplication. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol.\u00a07658, pp. 718\u2013739. Springer, Heidelberg (2012)"},{"key":"12_CR41","unstructured":"Mestre, J.-F.: Couples de Jacobiennes isogenes de courbes hyperelliptiques. Preprint, arXiv (2009), \n                  \n                    http:\/\/arxiv.org\/abs\/0902.3470"},{"key":"12_CR42","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)"},{"issue":"170","key":"12_CR43","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"P.L. Montgomery","year":"1985","unstructured":"Montgomery, P.L.: Modular multiplication without trial division. Math. Comp.\u00a044(170), 519\u2013521 (1985)","journal-title":"Math. Comp."},{"issue":"177","key":"12_CR44","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1090\/S0025-5718-1987-0866113-7","volume":"48","author":"P.L. Montgomery","year":"1987","unstructured":"Montgomery, P.L.: Speeding the Pollard and elliptic curve methods of factorization. Math. Comp.\u00a048(177), 243\u2013264 (1987)","journal-title":"Math. Comp."},{"key":"12_CR45","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1051\/ita\/1990240605311","volume":"24","author":"F. Morain","year":"1990","unstructured":"Morain, F., Olivos, J.: Speeding up the computations on an elliptic curve using addition-subtraction chains. Informatique Th\u00e9orique et Applications\/Theoretical Informatics and Applications\u00a024, 531\u2013544 (1990)","journal-title":"Informatique Th\u00e9orique et Applications\/Theoretical Informatics and Applications"},{"key":"12_CR46","unstructured":"National Security Agency. Fact sheet NSA Suite B Cryptography (2009), \n                  \n                    http:\/\/www.nsa.gov\/ia\/programs\/suiteb_cryptography\/index.shtml"},{"key":"12_CR47","unstructured":"Oliveira, T., Rodr\u00edguez-Henr\u00edquez, F., L\u00f3pez, J.: New timings for scalar multiplication using a new set of coordinates. In: Rump Session Talk at ECC 2012 (2012)"},{"key":"12_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/3-540-46035-7_13","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"Y.-H. Park","year":"2002","unstructured":"Park, Y.-H., Jeong, S., Lim, J.: Speeding up point multiplication on hyperelliptic curves with efficiently-computable endomorphisms. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 197\u2013208. Springer, Heidelberg (2002)"},{"issue":"143","key":"12_CR49","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."},{"key":"12_CR50","first-page":"41","volume":"47","author":"A. Scholz","year":"1937","unstructured":"Scholz, A.: Aufgabe 253. Jahresbericht der deutschen Mathematiker-Vereingung\u00a047, 41\u201342 (1937)","journal-title":"Jahresbericht der deutschen Mathematiker-Vereingung"},{"issue":"1","key":"12_CR51","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/PL00003818","volume":"12","author":"N.P. Smart","year":"1999","unstructured":"Smart, N.P., Siksek, S.: A fast Diffie-Hellman protocol in genus 2. J. Cryptology\u00a012(1), 67\u201373 (1999)","journal-title":"J. Cryptology"},{"key":"12_CR52","unstructured":"Solinas, J.A.: Generalized Mersenne numbers. Technical Report CORR 99\u201339, Centre for Applied Cryptographic Research, University of Waterloo (1999)"},{"key":"12_CR53","doi-asserted-by":"crossref","unstructured":"Takashima, K.: A new type of fast endomorphisms on Jacobians of hyperelliptic curves and their cryptographic application. IEICE Trans.\u00a089-A(1), 124\u2013133 (2006)","DOI":"10.1093\/ietfec\/e89-a.1.124"},{"issue":"5","key":"12_CR54","doi-asserted-by":"publisher","first-page":"1055","DOI":"10.4153\/CJM-1991-061-x","volume":"43","author":"W. Tautz","year":"1991","unstructured":"Tautz, W., Top, J., Verberkmoes, A.: Explicit hyperelliptic curves with real multiplication and permutation polynomials. Canad. J. Math\u00a043(5), 1055\u20131064 (1991)","journal-title":"Canad. J. Math"},{"key":"12_CR55","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1215\/S0012-7094-73-04085-4","volume":"40","author":"E.G. Thurber","year":"1973","unstructured":"Thurber, E.G.: On addition chains l(mn)\u2009\u2264\u2009l(n)\u2009\u2212\u2009b and lower bounds for c(r). Duke Mathematical Journal\u00a040, 907\u2013913 (1973)","journal-title":"Duke Mathematical Journal"},{"key":"12_CR56","unstructured":"U.S. Department of Commerce\/National Institute of Standards and Technology. Digital Signature Standard (DSS). FIPS-186-3 (2009), \n                  \n                    http:\/\/csrc.nist.gov\/publications\/fips\/fips186-3\/fips_186-3.pdf"},{"key":"12_CR57","series-title":"Algorithms and Computation in Mathematics","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/978-3-540-37634-7_5","volume-title":"Discovering Mathematics with Magma","author":"P. Wamelen van","year":"2006","unstructured":"van Wamelen, P.: Computing with the analytic Jacobian of a genus 2 curve. In: Discovering Mathematics with Magma. Algorithms and Computation in Mathematics, vol.\u00a019, pp. 117\u2013135. Springer, Heidelberg (2006)"},{"key":"12_CR58","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/3-540-48892-8_15","volume-title":"Selected Areas in Cryptography","author":"M.J. Wiener","year":"1999","unstructured":"Wiener, M.J., Zuccherato, R.J.: Faster attacks on elliptic curve cryptosystems. In: Tavares, S., Meijer, H. (eds.) SAC 1998. LNCS, vol.\u00a01556, pp. 190\u2013200. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38348-9_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,12]],"date-time":"2019-05-12T19:45:07Z","timestamp":1557690307000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38348-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642383472","9783642383489"],"references-count":58,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38348-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}