{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T12:00:44Z","timestamp":1773835244197,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540004097","type":"print"},{"value":"9783540364009","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-36400-5_22","type":"book-chapter","created":{"date-parts":[[2007,9,2]],"date-time":"2007-09-02T19:59:37Z","timestamp":1188763177000},"page":"291-302","source":"Crossref","is-referenced-by-count":236,"title":["The Montgomery Powering Ladder"],"prefix":"10.1007","author":[{"given":"Marc","family":"Joye","sequence":"first","affiliation":[]},{"given":"Sung-Ming","family":"Yen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,2,17]]},"reference":[{"key":"22_CR1","unstructured":"IEEE Std 1363-2000. IEEE Standard Specifications for Public-Key Cryptography. IEEE Computer Society, August 29, 2000."},{"issue":"5","key":"22_CR2","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1109\/49.223883","volume":"11","author":"G.B. Agnew","year":"1993","unstructured":"G.B. Agnew, R.C. Mullin, and S.A. Vanstone. An implementation of elliptic curve cryptosystems over F2155. IEEE Journal on Selected Areas in Communications, 11(5):804\u2013813, June 1993.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"22_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/3-540-45664-3_24","volume-title":"Public Key Cryptography","author":"\u00c9ric Brier","year":"2002","unstructured":"\u00c9ric Brier and Marc Joye. Weierstra\\ elliptic curves and side-channel attacks. In D. Naccache and P. Paillier, editors, Public Key Cryptography, volume 2274 of Lecture Notes in Computer Science, pages 335\u2013345. Springer-Verlag, 2002."},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Richard Crandall and Carl Pomerance. Prime Numbers: A Computational Perspective. Springer-Verlag, 2001.","DOI":"10.1007\/978-1-4684-9316-0"},{"key":"22_CR5","unstructured":"Wieland Fischer, Christophe Giraud, Erik Woodward Knudsen, and Jean-Pierre Seifert. Parallel scalar multiplication on general elliptic curves over Fp hedged against non-differential side-channel attacks. Report 2002\/007, Cryptology ePrint Archive, January 2002."},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1006\/jagm.1997.0913","volume":"27","author":"D. M. Gordon","year":"1998","unstructured":"Daniel M. Gordon. A survey of fast exponentiation methods. Journal of Algorithms, 27:129\u2013146, 1998.","journal-title":"Journal of Algorithms"},{"key":"22_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/3-540-45664-3_20","volume-title":"Public Key Cryptography","author":"T. Izu","year":"2002","unstructured":"Tetsuya Izu and Tsuyoshi Takagi. A fast parallel elliptic curve multiplication resistant against side channel attacks. In D. Naccache and P. Paillier, editors, Public Key Cryptography, volume 2274 of Lecture Notes in Computer Science, pages 280\u2013296. Springer-Verlag, 2002."},{"issue":"6","key":"22_CR8","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1049\/el:19960359","volume":"32","author":"M. Joye","year":"1996","unstructured":"Marc Joye and Jean-Jacques Quisquater. Efficient computation of full Lucas sequences. Electronics Letters, 32(6):537\u2013538, March 1996.","journal-title":"Electronics Letters"},{"key":"22_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/3-540-45760-7_2","volume-title":"Topics in Cryptology-CT-RSA 2002","author":"M. Joye","year":"2002","unstructured":"Marc Joye, Jean-Jacques Quisquater, Sung-Ming Yen, and Moti Yung. Observability analysis: Detecting when improved cryptosystems fail. In B. Preneel, editor, Topics in Cryptology-CT-RSA 2002, volume 2271 of Lecture Notes in Computer Science, pages 17\u201329. Springer-Verlag, 2002."},{"key":"22_CR10","series-title":"Lect Notes Comput Sci","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":"Paul Kocher, Joshua Jaffe, and Benjamin Jun. Differential power analysis. In M. Wiener, editor, Advances in Cryptology-CRYPTO\u201999, volume 1666 of Lecture Notes in Computer Science, pages 388\u2013397. Springer-Verlag, 1999."},{"key":"22_CR11","series-title":"Lect Notes Comput Sci","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":"Paul C. Kocher. Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. In N. Koblitz, editor, Advances in Cryptology-CRYPTO\u201996, volume 1109 of Lecture Notes in Computer Science, pages 104\u2013113. Springer-Verlag, 1996."},{"key":"22_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-48059-5_27","volume-title":"Cryptographic Hardware and Embedded Systems","author":"J. L\u00f3pez","year":"1999","unstructured":"Julio L\u00f3pez and Ricardo Dahab. Fast multiplication on elliptic curves over GF(2m) without precomputation. In \u00c7.K. Ko\u00e7 and C. Paar, editors, Cryptographic Hardware and Embedded Systems, volume 1717 of Lecture Notes in Computer Science, pages 316\u2013327. Springer-Verlag, 1999."},{"key":"22_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/3-540-48059-5_14","volume-title":"Cryptographic Hardware and Embedded Systems (CHES\u2019 99)","author":"T. S. Messerges","year":"1999","unstructured":"Thomas S. Messerges, Ezzy A. Dabbish, and Robert H. Sloan. Power analysis attacks of modular exponentiation in smartcards. In \u00c7.K. Ko\u00e7 and C. Paar, editors, Cryptographic Hardware and Embedded Systems (CHES\u2019 99), volume 1717 of Lecture Notes in Computer Science, pages 144\u2013157. Springer-Verlag, 1999."},{"key":"22_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/BFb0028484","volume-title":"Information and Communications Security (ICICS\u2019 97)","author":"A. Miyaji","year":"1997","unstructured":"Atsuko Miyaji, Takatoshi Ono, and Henri Cohen. Efficient elliptic curve exponentiation. In Y. Han, T. Okamoto, and S. Qing, editors, Information and Communications Security (ICICS\u2019 97), volume 1334 of Lecture Notes in Computer Science, pages 282\u2013290. Springer-Verlag, 1997."},{"issue":"177","key":"22_CR15","doi-asserted-by":"publisher","first-page":"243","DOI":"10.2307\/2007888","volume":"48","author":"P. L. Montgomery","year":"1987","unstructured":"Peter L. Montgomery. Speeding the Pollard and elliptic curve methods of factorization. Mathematics of Computation, 48(177):243\u2013264, January 1987.","journal-title":"Mathematics of Computation"},{"key":"22_CR16","unstructured":"Peter L. Montgomery. Evaluating recurrences of form Xm+n = f(Xm,Xn,Xm-n) via Lucas chains. Unpublished manuscript, January 1992."},{"key":"22_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/978-3-540-46588-1_17","volume-title":"Public Key Cryptography","author":"K. Okeya","year":"2000","unstructured":"Katsuyuki Okeya, Hiroyuki Kurumatani, and Kouichi Sakurai. Elliptic curves with the Montgomery form and their cryptographic applications. In H. Imai and Y. Zheng, editors, Public Key Cryptography, volume 1751 of Lecture Notes in Computer Science, pages 238\u2013257. Springer-Verlag, 2000."},{"key":"22_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/3-540-44709-1_12","volume-title":"Cryptographic Hardware and Embedded Systems-CHES 2001","author":"K. Okeya","year":"2001","unstructured":"Katsuyuki Okeya and Kouichi Sakurai. Efficient elliptic curve cryptosystems from a scalar multiplication algorithm with recovery of the y-coordinate on a Montgomeryform elliptic curve. In \u00c7.K. Ko\u00e7, D. Naccache, and C. Paar, editors, Cryptographic Hardware and Embedded Systems-CHES 2001, volume 2162 of Lecture Notes in Computer Science, pages 126\u2013141. Springer-Verlag, 2001."},{"key":"22_CR19","unstructured":"P. Smith. Cryptography without exponentiation. Dr. Dobb\u2019s Journal, (4):26\u201330, April 1994."},{"key":"22_CR20","unstructured":"Peter J. Smith and Michael J.J. Lennon. LUC: A new public key system. In E.G. Douglas, editor, Ninth IFIP Symposium on Computer Security, pages 103\u2013117. Elsevier Science Publishers, 1993."},{"issue":"20","key":"22_CR21","doi-asserted-by":"publisher","first-page":"1738","DOI":"10.1049\/el:19951189","volume":"31","author":"T.-C. Wu","year":"1995","unstructured":"Tzong-Chen Wu and Yuh-Shihng Chang. Improved generalisation of commonmultiplicand algorithm of Yen and Laih. Electronics Letters, 31(20):1738\u20131739, September 1995.","journal-title":"Electronics Letters"},{"issue":"6","key":"22_CR22","first-page":"1160","volume":"E80-A","author":"S.-M. Yen","year":"1997","unstructured":"Sung-Ming Yen. Improved common-multiplicand multiplication and fast exponentiation by exponent decomposition. IEICE Trans. Fundamentals, E80-A(6):1160\u20131163, June 1997.","journal-title":"IEICE Trans. Fundamentals"},{"issue":"9","key":"22_CR23","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1109\/12.869328","volume":"49","author":"S.-M. Yen","year":"2000","unstructured":"Sung-Ming Yen and Marc Joye. Checking before output may not be enough against fault-based cryptanalysis. IEEE Trans. on Computers, 49(9):967\u2013970, September 2000.","journal-title":"IEEE Trans. on Computers"},{"key":"22_CR24","series-title":"Lect Notes Comput Sci","first-page":"414","volume-title":"Information Security and Cryptology-ICISC 2001","author":"S.-M. Yen","year":"2002","unstructured":"Sung-Ming Yen, Seung-Joo Kim, Seon-Gan Lim, and Sang-Jae Moon. A countermeasure against one physical cryptanalysis may benefit another attack. In K. Kim, editor, Information Security and Cryptology-ICISC 2001, volume 2288 of Lecture Notes in Computer Science, pages 414\u2013427. Springer-Verlag, 2002."},{"issue":"17","key":"22_CR25","doi-asserted-by":"publisher","first-page":"1583","DOI":"10.1049\/el:19931055","volume":"29","author":"S.-M. Yen","year":"1993","unstructured":"Sung-Ming Yen and Chi-Sung Laih. Common-multiplicand multiplication and its application to public-key cryptography. Electronics Letters, 29(17):1583\u20131584, August 1993.","journal-title":"Electronics Letters"},{"issue":"2","key":"22_CR26","first-page":"165","volume":"142","author":"S.-M. Yen","year":"1995","unstructured":"Sung-Ming Yen and Chi-Sung Laih. Fast algorithms for LUC digital signature computation. IEE Proc.-Comput. Digit Tech., 142(2):165\u2013169, March 1995.","journal-title":"Fast algorithms for LUC digital signature computation"}],"container-title":["Lecture Notes in Computer Science","Cryptographic Hardware and Embedded Systems - CHES 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36400-5_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,23]],"date-time":"2019-02-23T05:36:07Z","timestamp":1550900167000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36400-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540004097","9783540364009"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-36400-5_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2003]]}}}