{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T12:53:42Z","timestamp":1765976022720},"publisher-location":"Berlin, Heidelberg","reference-count":39,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642546303"},{"type":"electronic","value":"9783642546310"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-642-54631-0_12","type":"book-chapter","created":{"date-parts":[[2014,2,20]],"date-time":"2014-02-20T10:04:17Z","timestamp":1392890657000},"page":"203-220","source":"Crossref","is-referenced-by-count":10,"title":["Elliptic and Hyperelliptic Curves: A Practical Security Analysis"],"prefix":"10.1007","author":[{"given":"Joppe W.","family":"Bos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Craig","family":"Costello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Miele","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-642-20465-4_5","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"D.F. Aranha","year":"2011","unstructured":"Aranha, D.F., Karabina, K., Longa, P., Gebotys, C.H., L\u00f3pez, J.: Faster explicit formulas for computing pairings over ordinary curves. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol.\u00a06632, pp. 48\u201368. Springer, Heidelberg (2011)"},{"key":"12_CR2","unstructured":"Bailey, D.V., Batina, L., Bernstein, D.J., Birkner, P., Bos, J.W., Chen, H.-C., Cheng, C.-M., van Damme, G., de Meulenaer, G., Perez, L.J.D., Fan, J., G\u00fcneysu, T., Gurkaynak, F., Kleinjung, T., Lange, T., Mentens, N., Niederhagen, R., Paar, C., Regazzoni, F., Schwabe, P., Uhsadel, L., Herrewege, A.V., Yang, B.-Y.: Breaking ECC2K-130. Cryptology ePrint Archive, Report 2009\/541 (2009), http:\/\/eprint.iacr.org\/2009\/541"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/11693383_22","volume-title":"Selected Areas in Cryptography","author":"P.S.L.M. Barreto","year":"2006","unstructured":"Barreto, P.S.L.M., Naehrig, M.: Pairing-friendly elliptic curves of prime order. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol.\u00a03897, pp. 319\u2013331. Springer, Heidelberg (2006)"},{"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 the ECC (September 2006), slides at 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":"128","DOI":"10.1007\/978-3-642-19379-8_8","volume-title":"Public Key Cryptography \u2013 PKC 2011","author":"D.J. Bernstein","year":"2011","unstructured":"Bernstein, D.J., Lange, T., Schwabe, P.: On the correct use of the negation map in the Pollard rho method. In: Catalano, D., Fazio, N., Gennaro, R., Nicolosi, A. (eds.) PKC 2011. LNCS, vol.\u00a06571, pp. 128\u2013146. Springer, Heidelberg (2011)"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-642-38348-9_12","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"J.W. Bos","year":"2013","unstructured":"Bos, J.W., Costello, C., Hisil, H., Lauter, K.: Fast cryptography in genus 2. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol.\u00a07881, pp. 194\u2013210. Springer, Heidelberg (2013)"},{"issue":"3","key":"12_CR8","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. International Journal of Applied Cryptography\u00a02(3), 212\u2013228 (2012)","journal-title":"International Journal of Applied Cryptography"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-642-14518-6_9","volume-title":"Algorithmic Number Theory","author":"J.W. Bos","year":"2010","unstructured":"Bos, J.W., Kleinjung, T., Lenstra, A.K.: On the use of the negation map in the Pollard rho method. In: Hanrot, G., Morain, F., Thom\u00e9, E. (eds.) ANTS-IX. LNCS, vol.\u00a06197, pp. 66\u201382. Springer, Heidelberg (2010)"},{"issue":"154","key":"12_CR10","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1090\/S0025-5718-1981-0606520-5","volume":"36","author":"R.P. Brent","year":"1981","unstructured":"Brent, R.P., Pollard, J.M.: Factorization of the eighth Fermat number. Mathematics of Computation\u00a036(154), 627\u2013630 (1981)","journal-title":"Mathematics of Computation"},{"issue":"1","key":"12_CR11","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. Australian Math. Soc.\u00a058(1), 147\u2013154 (1998)","journal-title":"Bull. Australian Math. Soc."},{"key":"12_CR12","unstructured":"Certicom. Press release: Certicom announces elliptic curve cryptosystem (ECC) challenge winner (2002), http:\/\/www.certicom.com\/index.php\/2002-press-releases\/38-2002-press-releases\/340-notre-dame-mathematician-solves-eccp-109-encryption-key-problem-issued-in-1997"},{"key":"12_CR13","unstructured":"Certicom Research. Standards for efficient cryptography 2: Recommended elliptic curve domain parameters. Standard SEC2, Certicom (2000)"},{"key":"12_CR14","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_CR15","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_CR16","doi-asserted-by":"crossref","unstructured":"Galbraith, S.D.: Mathematics of public key cryptography. Cambridge University Press (2012)","DOI":"10.1017\/CBO9781139012843"},{"issue":"3","key":"12_CR17","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_CR18","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_CR19","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_CR20","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. Comput.\u00a047(4), 368\u2013400 (2012)","journal-title":"J. Symb. Comput."},{"issue":"8","key":"12_CR21","doi-asserted-by":"publisher","first-page":"1319","DOI":"10.1016\/j.jss.2011.03.083","volume":"84","author":"C.C.F.P. Geovandro","year":"2011","unstructured":"Geovandro, C.C.F.P., Simpl\u00edcio Jr., M.A., Naehrig, M., Barreto, P.S.L.M.: A family of implementation-friendly BN elliptic curves. Journal of Systems and Software\u00a084(8), 1319\u20131326 (2011)","journal-title":"Journal of Systems and Software"},{"key":"12_CR22","unstructured":"Harley, R.: Elliptic curve discrete logarithms project, http:\/\/pauillac.inria.fr\/~harley\/"},{"key":"12_CR23","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1214\/aoms\/1177705677","volume":"31","author":"B. Harris","year":"1960","unstructured":"Harris, B.: Probability distributions related to random mappings. The Annals of Mathematical Statistics\u00a031, 1045\u20131062 (1960)","journal-title":"The Annals of Mathematical Statistics"},{"key":"12_CR24","unstructured":"Hisil, H.: Elliptic curves, group law, and efficient computation. PhD thesis (2010)"},{"issue":"177","key":"12_CR25","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. Mathematics of Computation\u00a048(177), 203\u2013209 (1987)","journal-title":"Mathematics of Computation"},{"issue":"3","key":"12_CR26","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF02252872","volume":"1","author":"N. Koblitz","year":"1989","unstructured":"Koblitz, N.: Hyperelliptic cryptosystems. Journal of Cryptology\u00a01(3), 139\u2013150 (1989)","journal-title":"Journal of Cryptology"},{"key":"12_CR27","unstructured":"Lange, T.: Elliptic vs. Hyperelliptic, part II. Talk at the ECC (September 2006), slides at http:\/\/www.hyperelliptic.org\/tanja\/vortraege\/ECC_06.ps"},{"key":"12_CR28","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_CR29","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":"177","key":"12_CR30","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. Mathematics of Computation\u00a048(177), 243\u2013264 (1987)","journal-title":"Mathematics of Computation"},{"key":"12_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/10722028_28","volume-title":"Algorithmic Number Theory","author":"K. Nagao","year":"2000","unstructured":"Nagao, K.: Improving group law algorithms for Jacobians of hyperelliptic curves. In: Bosma, W. (ed.) ANTS-IV. LNCS, vol.\u00a01838, pp. 439\u2013447. Springer, Heidelberg (2000)"},{"key":"12_CR32","unstructured":"Nakamoto, S.: Bitcoin: A peer-to-peer electronic cash system (2009), http:\/\/bitcoin.org\/bitcoin.pdf"},{"issue":"143","key":"12_CR33","first-page":"918","volume":"32","author":"J.M. Pollard","year":"1978","unstructured":"Pollard, J.M.: Monte Carlo methods for index computation (mod p). Mathematics of Computation\u00a032(143), 918\u2013924 (1978)","journal-title":"Mathematics of Computation"},{"key":"12_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-642-42033-7_4","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"B.A. Smith","year":"2013","unstructured":"Smith, B.A.: Families of fast elliptic curves from \u211a-curves. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013, Part I. LNCS, vol.\u00a08269, pp. 61\u201378. Springer, Heidelberg (2013)"},{"issue":"234","key":"12_CR35","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1090\/S0025-5718-00-01213-8","volume":"70","author":"E. Teske","year":"2001","unstructured":"Teske, E.: On random walks for Pollard\u2019s rho method. Mathematics of Computation\u00a070(234), 809\u2013825 (2001)","journal-title":"Mathematics of Computation"},{"key":"12_CR36","unstructured":"U.S. Department of Commerce\/National Institute of Standards and Technology. Digital Signature Standard (DSS). FIPS-186-4 (2013), http:\/\/nvlpubs.nist.gov\/nistpubs\/FIPS\/NIST.FIPS.186-4.pdf"},{"issue":"1","key":"12_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/PL00003816","volume":"12","author":"P.C. Oorschot van","year":"1999","unstructured":"van Oorschot, P.C., Wiener, M.J.: Parallel collision search with cryptanalytic applications. Journal of Cryptology\u00a012(1), 1\u201328 (1999)","journal-title":"Journal of Cryptology"},{"issue":"21","key":"12_CR38","doi-asserted-by":"publisher","first-page":"1831","DOI":"10.1049\/el:19991230","volume":"35","author":"C.D. Walter","year":"1999","unstructured":"Walter, C.D.: Montgomery exponentiation needs no final subtractions. Electronics Letters\u00a035(21), 1831\u20131832 (1999)","journal-title":"Electronics Letters"},{"key":"12_CR39","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","Public-Key Cryptography \u2013 PKC 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54631-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,10]],"date-time":"2023-07-10T16:15:45Z","timestamp":1689005745000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54631-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642546303","9783642546310"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54631-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}