{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T18:06:17Z","timestamp":1791223577441,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642174001","type":"print"},{"value":"9783642174018","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-17401-8_18","type":"book-chapter","created":{"date-parts":[[2010,12,1]],"date-time":"2010-12-01T06:36:50Z","timestamp":1291185410000},"page":"238-261","source":"Crossref","is-referenced-by-count":9,"title":["Random Euclidean Addition Chain Generation and Its Application to Point Multiplication"],"prefix":"10.1007","author":[{"given":"Fabien","family":"Herbaut","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pierre-Yvan","family":"Liardet","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicolas","family":"M\u00e9loni","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yannick","family":"T\u00e9glia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pascal","family":"V\u00e9ron","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"18_CR1","unstructured":"Bernstein, D.J., Lange, T.: Explicit-formulas database, \n                    \n                      http:\/\/hyperelliptic.org\/EFD"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/978-3-540-76900-2_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2007","author":"D.J. Bernstein","year":"2007","unstructured":"Bernstein, D.J., Lange, T.: Faster addition and doubling on elliptic curves. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol.\u00a04833, pp. 29\u201350. Springer, Heidelberg (2007)"},{"key":"18_CR3","unstructured":"Bos, J.W., Kaihara, M.E., Kleinjung, T., Lenstra, A.K., Montgomery, P.L.: On the security of 1024-bit rsa and 160-bit elliptic curve cryptography. Technical report, EPFL IC LACAL and Alcatel-Lucent Bell Laboratories and Microsoft Research (2009)"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Boyko, V., Peinado, M., Venkatesan, R.: Speeding up discrete log and factoring based schemes via precomputations (1998)","DOI":"10.1007\/BFb0054129"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/3-540-45664-3_24","volume-title":"Public Key Cryptography","author":"E. Brier","year":"2002","unstructured":"Brier, E., Joye, M.: Weierstra\u00df elliptic curves and side-channel attacks. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol.\u00a02274, pp. 335\u2013345. Springer, Heidelberg (2002)"},{"key":"18_CR6","unstructured":"Certicom Research. Sec 2: Recommended elliptic curve domain parameters standards for efficient cryptography. Technical report, Certicom (2000)"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Cohen, H., Frey, G., Avanzi, R., Doche, C., Lange, T., Nguyen, K., Vercauteren, F.: Handbook of Elliptic and Hyperelliptic Cryptography, Discrete Mathematics and its Applications, vol.\u00a034. Chapman & Hall\/CRC (2005)","DOI":"10.1201\/9781420034981"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-49649-1_6","volume-title":"Advances in Cryptology - ASIACRYPT\u201998","author":"H. Cohen","year":"1998","unstructured":"Cohen, H., Miyaji, A., Ono, T.: Efficient elliptic curve exponentiation using mixed coordinates. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol.\u00a01514, pp. 51\u201365. Springer, Heidelberg (1998)"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/3-540-48285-7_37","volume-title":"Advances in Cryptology - EUROCRYPT \u201993","author":"P. Rooij de","year":"1994","unstructured":"de Rooij, P.: On Schnorr\u2019s preprocessing for digital signature schemes. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol.\u00a0765, pp. 435\u2013439. Springer, Heidelberg (1994)"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/11593447_4","volume-title":"Advances in Cryptology - ASIACRYPT 2005","author":"V. Dimitrov","year":"2005","unstructured":"Dimitrov, V., Imbert, L., Mishra, P.K.: Efficient and secure elliptic curve point multiplication using double-base chains. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol.\u00a03788, pp. 59\u201378. Springer, Heidelberg (2005)"},{"key":"18_CR11","volume-title":"Concrete Mathematics: A Foundation for Computer Science","author":"R.L. Graham","year":"1989","unstructured":"Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics: A Foundation for Computer Science. Addison-Wesley, Reading (1989)"},{"key":"18_CR12","volume-title":"Guide to Elliptic Curve Cryptography","author":"D. Hankerson","year":"2004","unstructured":"Hankerson, D., Menezes, A., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer, Heidelberg (2004)"},{"key":"18_CR13","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., Koon-Ho Wong, K., Carter, G., Dawson, E.: Twisted Edwards curves revisited. In: Pieprzyk, J. (ed.) ASIACRYPT 2008. LNCS, vol.\u00a05350, pp. 326\u2013343. Springer, Heidelberg (2008)"},{"issue":"1","key":"18_CR14","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0166-218X(02)00588-7","volume":"130","author":"J. Hoffstein","year":"2003","unstructured":"Hoffstein, J., Silverman, J.H.: Random small hamming weight products with applications to cryptography. Discrete Appl. Math.\u00a0130(1), 37\u201349 (2003)","journal-title":"Discrete Appl. Math."},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/3-540-45537-X_12","volume-title":"Selected Areas in Cryptography","author":"D. M\u2019Ra\u00efhi","year":"2001","unstructured":"M\u2019Ra\u00efhi, D., Coron, J.-S., Tymen, C.: Fast generation of pairs (k, [k]p) for koblitz elliptic curves. In: Vaudenay, S., Youssef, A.M. (eds.) SAC 2001. LNCS, vol.\u00a02259, pp. 151\u2013174. Springer, Heidelberg (2001)"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/3-540-44709-1_33","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2001","author":"M. Joye","year":"2001","unstructured":"Joye, M., Quisquater, J.-J.: Hessian elliptic curves and side-channel attacks. In: Ko\u00e7, \u00c7.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol.\u00a02162, pp. 402\u2013410. Springer, Heidelberg (2001)"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Kleinjung, T., Aoki, K., Franke, J., Lenstra, A.K., Thom\u00e9, E., Bos, J.W., Gaudry, P., Kruppa, A., Montgomery, P.L., Osvik, D.A., te Riele, H., Timofeev, A., Zimmermann, P.: Factorization of a 768-bit rsa modulus. Technical report, EPFL IC LACAL and NTT and University of Bonn and INRIA CNRS LORIA and Microsoft Research and CWI (2010)","DOI":"10.1007\/978-3-642-14623-7_18"},{"issue":"12","key":"18_CR18","doi-asserted-by":"publisher","first-page":"4720","DOI":"10.1073\/pnas.72.12.4720","volume":"72","author":"D. Knuth","year":"1975","unstructured":"Knuth, D., Yao, A.: Analysis of the subtractive algorithm for greater common divisors. Proc. Nat. Acad. Sci. USA\u00a072(12), 4720\u20134722 (1975)","journal-title":"Proc. Nat. Acad. Sci. USA"},{"key":"18_CR19","volume-title":"The Art of Computer Programming: Fundamental Algorithms","author":"D.E. Knuth","year":"1997","unstructured":"Knuth, D.E.: The Art of Computer Programming: Fundamental Algorithms, 3rd edn, vol.\u00a02. Addison Wesley, Reading (July 1997)","edition":"3"},{"key":"18_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/3-540-46766-1_22","volume-title":"Advances in Cryptology - CRYPTO \u201991","author":"N. Koblitz","year":"1992","unstructured":"Koblitz, N.: CM-curves with good cryptographic properties. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol.\u00a0576, pp. 279\u2013287. Springer, Heidelberg (1992)"},{"key":"18_CR21","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/40.502403","volume":"16","author":"C.K. Koc","year":"1996","unstructured":"Koc, C.K., Acar, T.: Analyzing and comparing montgomery multiplication algorithms. IEEE Micro\u00a016, 26\u201333 (1996)","journal-title":"IEEE Micro"},{"key":"18_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/3-540-48405-1_25","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"P. Kocher","year":"1999","unstructured":"Kocher, P., Jaffe, J., Jun, B.: Differential power analysis. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 388\u2013397. Springer, Heidelberg (1999)"},{"key":"18_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/3-540-44709-1_32","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2001","author":"P.-Y. Liardet","year":"2001","unstructured":"Liardet, P.-Y., Smart, N.P.: Preventing SPA\/DPA in ECC systems using the Jacobi form. In: Ko\u00e7, \u00c7.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol.\u00a02162, pp. 391\u2013401. Springer, Heidelberg (2001)"},{"key":"18_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/978-3-642-00468-1_25","volume-title":"Public Key Cryptography \u2013 PKC 2009","author":"P. Longa","year":"2009","unstructured":"Longa, P., Gebotys, C.: Setting speed records with the (fractional) multibase non-adjacent form method for efficient elliptic curve scalar multiplication. In: Jarecki, S., Tsudik, G. (eds.) Public Key Cryptography \u2013 PKC 2009. LNCS, vol.\u00a05443, pp. 443\u2013462. Springer, Heidelberg (2009)"},{"key":"18_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/978-3-540-78440-1_14","volume-title":"Public Key Cryptography \u2013 PKC 2008","author":"P. Longa","year":"2008","unstructured":"Longa, P., Miri, A.: New composite operations and precomputation scheme for elliptic curve cryptosystems over prime fields. In: Cramer, R. (ed.) PKC 2008. LNCS, vol.\u00a04939, pp. 229\u2013247. Springer, Heidelberg (2008)"},{"key":"18_CR26","unstructured":"Meloni, N.: Arithm\u00e9tique pour la Cryptographie bas\u00e9e sur les Courbes Elliptiques. PhD thesis, Universit\u00e9 de Montpellier, France (2007)"},{"key":"18_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-540-73074-3_15","volume-title":"Arithmetic of Finite Fields","author":"N. Meloni","year":"2007","unstructured":"Meloni, N.: New point addition formulae for ECC applications. In: Carlet, C., Sunar, B. (eds.) WAIFI 2007. LNCS, vol.\u00a04547, pp. 189\u2013201. Springer, Heidelberg (2007)"},{"key":"18_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1007\/11792086_41","volume-title":"Algorithmic Number Theory","author":"I. Mironov","year":"2006","unstructured":"Mironov, I., Mityagin, A., Nissim, K.: Hard instances of the constrained discrete logarithm problem. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol.\u00a04076, pp. 582\u2013598. Springer, Heidelberg (2006)"},{"key":"18_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/3-540-45439-X_22","volume-title":"Information Security","author":"B. M\u00f6ller","year":"2001","unstructured":"M\u00f6ller, B.: Securing elliptic curve point multiplication against side-channel attacks. In: Davida, G.I., Frankel, Y. (eds.) ISC 2001. LNCS, vol.\u00a02200, pp. 324\u2013334. Springer, Heidelberg (2001)"},{"key":"18_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/3-540-36552-4_21","volume-title":"Information Security and Cryptology - ICISC 2002","author":"B. M\u00f6ller","year":"2003","unstructured":"M\u00f6ller, B.: Improved techniques for fast exponentiation. In: Lee, P.J., Lim, C.H. (eds.) ICISC 2002. LNCS, vol.\u00a02587, pp. 298\u2013312. Springer, Heidelberg (2003)"},{"key":"18_CR31","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1090\/S0025-5718-1987-0866113-7","volume":"48","author":"P. Montgomery","year":"1987","unstructured":"Montgomery, P.: Speeding the pollard and elliptic curve methods of factorization. Mathematics of Computation\u00a048, 243\u2013264 (1987)","journal-title":"Mathematics of Computation"},{"key":"18_CR32","unstructured":"Montgomery, P.L.: Evaluating recurrences of form X\n                  \n                    m\u2009+\u2009n\n                  \u2009=\u2009f(X\n                  \n                    m\n                  ,X\n                  \n                    n\n                  ,X\n                  \n                    m\u2009\u2212\u2009n\n                  ) via Lucas chains (1992), \n                    \n                      http:\/\/ftp.cwi.nl\/pub\/pmontgom\/Lucas.ps.gz"},{"key":"18_CR33","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s00200-005-0187-7","volume":"16","author":"J.A. Mui","year":"2006","unstructured":"Mui, J.A., Stinson, D.R.: On the low hamming weight discrete logarithm problem for nonadjacent representations. Applicable Algebra in Engineering, Communication and Computing\u00a016, 461\u2013472 (2006)","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"key":"18_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/3-540-48405-1_3","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"P.Q. Nguy\u00ean","year":"1999","unstructured":"Nguy\u00ean, P.Q., Stern, J.: The hardness of the hidden subset sum problem and its cryptographic implications. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 31\u201346. Springer, Heidelberg (1999)"},{"key":"18_CR35","unstructured":"Reznick, B.: Regularity properties of the stern enumeration of the rationals. Journal of Integer Sequences\u00a011 (2008)"},{"key":"18_CR36","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C.P. Schnorr","year":"1991","unstructured":"Schnorr, C.P.: Efficient signature generation by smart cards. Journal of Cryptology\u00a04, 161\u2013174 (1991)","journal-title":"Journal of Cryptology"},{"key":"18_CR37","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1515\/crll.1858.55.193","volume":"55","author":"M.A. Stern","year":"1858","unstructured":"Stern, M.A.: \u00fcber eine zahlentheoretische funktion. Journal f\u00fcr die reine und angewandte Mathematik\u00a055, 193\u2013220 (1858)","journal-title":"Journal f\u00fcr die reine und angewandte Mathematik"},{"key":"18_CR38","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1090\/S0025-5718-01-01310-2","volume":"71","author":"D.R. Stinson","year":"2000","unstructured":"Stinson, D.R.: Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. Mathematics of Computation\u00a071, 379\u2013391 (2000)","journal-title":"Mathematics of Computation"},{"key":"18_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/11693383_24","volume-title":"Selected Areas in Cryptography","author":"N. Theriault","year":"2006","unstructured":"Theriault, N.: Spa resistant left-to-right integer recodings. In: Preneel, B., Tavares, S. (eds.) SAC 2005. LNCS, vol.\u00a03897, pp. 345\u2013358. Springer, Heidelberg (2006)"},{"key":"18_CR40","unstructured":"U.S. Department of Commerce and National Intitute of Standards and Technology. Digital signature standard (DSS). Technical report (2009)"},{"key":"18_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-46877-3_20","volume-title":"Advances in Cryptology - EUROCRYPT \u201990","author":"Y. Yacobi","year":"1991","unstructured":"Yacobi, Y.: Exponentiating faster with addition chains. In: Damg\u00e5rd, I.B. (ed.) EUROCRYPT 1990. LNCS, vol.\u00a0473, pp. 222\u2013229. Springer, Heidelberg (1991)"},{"issue":"2","key":"18_CR42","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1137\/S0097539792234974","volume":"28","author":"Y. Yacobi","year":"1999","unstructured":"Yacobi, Y.: Fast exponentiation using data compression. SIAM J. Comput.\u00a028(2), 700\u2013703 (1999)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology - INDOCRYPT 2010"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-17401-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T19:20:00Z","timestamp":1558293600000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-17401-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642174001","9783642174018"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-17401-8_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}