{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:59:30Z","timestamp":1772283570284,"version":"3.50.1"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319167145","type":"print"},{"value":"9783319167152","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-16715-2_23","type":"book-chapter","created":{"date-parts":[[2015,3,10]],"date-time":"2015-03-10T07:27:37Z","timestamp":1425972457000},"page":"431-448","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["Exploiting Collisions in Addition Chain-Based Exponentiation Algorithms Using a Single Trace"],"prefix":"10.1007","author":[{"given":"Neil","family":"Hanley","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"HeeSeok","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Tunstall","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,11]]},"reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"R Rivest","year":"1978","unstructured":"Rivest, R., Shamir, A., Adleman, L.M.: Method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM 21, 120\u2013126 (1978)","journal-title":"Communications of the ACM"},{"key":"23_CR2","unstructured":"National Institute of Standards and Technology (NIST): Recommended elliptic curves for federal government use. In the appendix of FIPS 186\u20133, available from http:\/\/csrc.nist.gov\/publications\/fips\/fips186-3\/fips_186-3.pdf (2009) (online; accessed January 2015)"},{"key":"23_CR3","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":"PC Kocher","year":"1999","unstructured":"Kocher, P.C., Jaffe, J., Jun, B.: Differential Power Analysis. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 388\u2013397. Springer, Heidelberg (1999)"},{"key":"23_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-642-02384-2_21","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2009","author":"M Joye","year":"2009","unstructured":"Joye, M., Tunstall, M.: Exponent Recoding and Regular Exponentiation Algorithms. In: Preneel, B. (ed.) AFRICACRYPT 2009. LNCS, vol. 5580, pp. 334\u2013349. Springer, Heidelberg (2009)"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/3-540-44709-1_24","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2001","author":"CD Walter","year":"2001","unstructured":"Walter, C.D.: Sliding Windows Succumbs to Big Mac Attack. In: Ko\u00e7, \u00c7.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol. 2162, pp. 286\u2013299. Springer, Heidelberg (2001)"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1007\/978-3-540-79966-5_10","volume-title":"Information Security Theory and Practices","author":"F Amiel","year":"2008","unstructured":"Amiel, F., Feix, B.: On the BRIP Algorithms Security for RSA. In: Onieva, J.A., Sauveron, D., Chaumette, S., Gollmann, D., Markantonakis, K. (eds.) WISTP 2008. LNCS, vol. 5019, pp. 136\u2013149. Springer, Heidelberg (2008)"},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"102","DOI":"10.4218\/etrij.10.0109.0249","volume":"32","author":"H Kim","year":"2010","unstructured":"Kim, H., Kim, T.H., Yoon, J.C., Hong, S.: Practical second-order correlation power analysis on the message blinding method and its novel countermeasure for RSA. ETRI Journal 32, 102\u2013111 (2010)","journal-title":"ETRI Journal"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-540-28632-5_25","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2004","author":"H Mamiya","year":"2004","unstructured":"Mamiya, H., Miyaji, A., Morimoto, H.: Efficient Countermeasures against RPA, DPA, and SPA. In: Joye, M., Quisquater, J.-J. (eds.) CHES 2004. LNCS, vol. 3156, pp. 343\u2013356. Springer, Heidelberg (2004)"},{"key":"23_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-642-19074-2_6","volume-title":"Topics in Cryptology \u2013 CT-RSA 2011","author":"MF Witteman","year":"2011","unstructured":"Witteman, M.F., van Woudenberg, J.G.J., Menarini, F.: Defeating RSA Multiply-Always and Message Blinding Countermeasures. In: Kiayias, A. (ed.) CT-RSA 2011. LNCS, vol. 6558, pp. 77\u201388. Springer, Heidelberg (2011)"},{"key":"23_CR10","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 48, 243\u2013264 (1987)","journal-title":"Mathematics of Computation"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Joye, M., Yen, S.M.: The montgomery powering ladder. In: Kaliski Jr., B.S., \u00c7. K. Ko\u00e7, Paar, C., (eds.) CHES 2002. LNCS, vol. 2523, 291\u2013302. Springer, Heidelberg (2003)","DOI":"10.1007\/3-540-36400-5_22"},{"key":"23_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/3-540-45811-5_30","volume-title":"Information Security","author":"K Okeya","year":"2002","unstructured":"Okeya, K., Sakurai, K.: A Second-Order DPA Attack Breaks a Window-Method Based Countermeasure against Side Channel Attacks. In: Chan, A.H., Gligor, V.D. (eds.) ISC 2002. LNCS, vol. 2433, pp. 389\u2013401. Springer, Heidelberg (2002)"},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1007\/978-3-642-34931-7_9","volume-title":"Progress in Cryptology - INDOCRYPT 2012","author":"C Clavier","year":"2012","unstructured":"Clavier, C., Feix, B., Gagnerot, G., Giraud, C., Roussellet, M., Verneuil, V.: ROSETTA for Single Trace Analysis. In: Galbraith, S., Nandi, M. (eds.) INDOCRYPT 2012. LNCS, vol. 7668, pp. 140\u2013155. Springer, Heidelberg (2012)"},{"key":"23_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-540-74735-2_10","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2007","author":"M Joye","year":"2007","unstructured":"Joye, M.: Highly Regular Right-to-Left Algorithms for Scalar Multiplication. In: Paillier, P., Verbauwhede, I. (eds.) CHES 2007. LNCS, vol. 4727, pp. 135\u2013147. Springer, Heidelberg (2007)"},{"key":"23_CR15","unstructured":"Wireless Application Protocol (WAP) Forum: Wireless transport layer security (WTLS) specification. http:\/\/www.wapforum.org"},{"key":"23_CR16","unstructured":"X9.62, A.: Public key cryptography for the financial services industry, the elliptic curve digital signature algorithm (ECDSA) (1999)"},{"key":"23_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/3-540-48059-5_25","volume-title":"Cryptographic Hardware and Embedded Systems","author":"J-S Coron","year":"1999","unstructured":"Coron, J.-S.: Resistance against Differential Power Analysis for Elliptic Curve Cryptosystems. In: Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 1999. LNCS, vol. 1717, pp. 292\u2013302. Springer, Heidelberg (1999)"},{"key":"23_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/978-3-662-43414-7_28","volume-title":"Selected Areas in Cryptography \u2013 SAC 2013","author":"A Bauer","year":"2014","unstructured":"Bauer, A., Jaulmes, E., Prouff, E., Wild, J.: Horizontal Collision Correlation Attack on Elliptic Curves. In: Lange, T., Lauter, K., Lison\u011bk, P. (eds.) SAC 2013. LNCS, vol. 8282, pp. 553\u2013570. Springer, Heidelberg (2014)"},{"key":"23_CR19","doi-asserted-by":"publisher","first-page":"760","DOI":"10.1109\/TC.2004.13","volume":"53","author":"B Chevallier-Mames","year":"2004","unstructured":"Chevallier-Mames, B., Ciet, M., Joye, M.: Low-cost solutions for preventing simple side-channel analysis: Side-channel atomicity. IEEE Transactions on Computers 53, 760\u2013768 (2004)","journal-title":"IEEE Transactions on Computers"},{"key":"23_CR20","doi-asserted-by":"crossref","unstructured":"Brier, E., Joye, M.: Weierstra\u00dfelliptic curve and side-channel attacks. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol. 2274, pp. 335\u2013345. Springer, Heidelberg (2002)","DOI":"10.1007\/3-540-45664-3_24"},{"key":"23_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-642-13190-5_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"A Biryukov","year":"2010","unstructured":"Biryukov, A., Dunkelman, O., Keller, N., Khovratovich, D., Shamir, A.: Key Recovery Attacks of Practical Complexity on AES-256 Variants with up to 10 Rounds. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 299\u2013319. Springer, Heidelberg (2010)"},{"key":"23_CR22","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1090\/S0025-5718-01-01310-2","volume":"71","author":"D Stinson","year":"2002","unstructured":"Stinson, D.: Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. Mathematics of Computation 71, 379\u2013391 (2002)","journal-title":"Mathematics of Computation"},{"key":"23_CR23","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s12095-014-0110-9","volume":"7","author":"M Tunstall","year":"2015","unstructured":"Tunstall, M., Joye, M.: The distributions of individual bits in the output of multiplicative operations. Cryptography and Communications 7, 71\u201390 (2015)","journal-title":"Cryptography and Communications"},{"key":"23_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/BFb0054867","volume-title":"Algorithmic Number Theory","author":"E De Win","year":"1998","unstructured":"De Win, E., Mister, S., Preneel, B., Wiener, M.: On the Performance of Signature Schemes Based on Elliptic Curves. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 252\u2013266. Springer, Heidelberg (1998)"},{"key":"23_CR25","doi-asserted-by":"crossref","unstructured":"Izu, T., Takagi, T.: Fast elliptic curve multiplications resistant against side channel attacks. IEICE Transactions 88-A, 161\u2013171 (2005)","DOI":"10.1093\/ietfec\/E88-A.1.161"},{"key":"23_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/978-3-642-14423-3_13","volume-title":"Information, Security and Cryptology \u2013 ICISC 2009","author":"J Gro\u00dfsch\u00e4dl","year":"2010","unstructured":"Gro\u00dfsch\u00e4dl, J., Oswald, E., Page, D., Tunstall, M.: Side-Channel Analysis of Cryptographic Software via Early-Terminating Multiplications. In: Lee, D., Hong, S. (eds.) ICISC 2009. LNCS, vol. 5984, pp. 176\u2013192. Springer, Heidelberg (2010)"},{"key":"23_CR27","unstructured":"Research Center for Information Security: Side-channel Attack Standard Evaluation Board (SASEBO). http:\/\/www.risec.aist.go.jp\/project\/sasebo\/ (2002) (Online; accessed January 2015)"},{"key":"23_CR28","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/40.502403","volume":"16","author":"CK Koc","year":"1996","unstructured":"Koc, C.K., Acar, T., Kaliski Jr., B.S.: Analyzing and comparing montgomery multiplication algorithms. IEEE Micro 16, 26\u201333 (1996)","journal-title":"IEEE Micro"},{"key":"23_CR29","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. 1514, pp. 51\u201365. Springer, Heidelberg (1998)"},{"key":"23_CR30","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":"DJ Bernstein","year":"2007","unstructured":"Bernstein, D.J., Lange, T.: Faster Addition and Doubling on Elliptic Curves. In: Kurosawa, K. (ed.) ASIACRYPT 2007. LNCS, vol. 4833, pp. 29\u201350. Springer, Heidelberg (2007)"},{"key":"23_CR31","doi-asserted-by":"crossref","unstructured":"Keller, M., Byrne, A., Marnane, W.P.: Elliptic curve cryptography on fpga for low-power applications. TRETS 2 (2009)","DOI":"10.1145\/1502781.1502783"},{"key":"23_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-642-17650-0_5","volume-title":"Information and Communications Security","author":"C Clavier","year":"2010","unstructured":"Clavier, C., Feix, B., Gagnerot, G., Roussellet, M., Verneuil, V.: Horizontal Correlation Analysis on Exponentiation. In: Soriano, M., Qing, S., L\u00f3pez, J. (eds.) ICICS 2010. LNCS, vol. 6476, pp. 46\u201361. Springer, Heidelberg (2010)"},{"key":"23_CR33","unstructured":"Mangard, S., Oswald, E., Popp, T.: Power Analysis Attacks \u2013 Revealing the Secrets of Smart Cards. Springer (2007)"},{"key":"23_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/3-540-44709-1_5","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2001","author":"E Oswald","year":"2001","unstructured":"Oswald, E., Aigner, M.: Randomized Addition-Subtraction Chains as a Countermeasure against Power Attacks. In: Ko\u00e7, \u00c7.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol. 2162, pp. 39\u201350. Springer, Heidelberg (2001)"},{"key":"23_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-642-28368-0_18","volume-title":"Cryptography and Security: From Theory to Applications","author":"J Fan","year":"2012","unstructured":"Fan, J., Verbauwhede, I.: An Updated Survey on Secure ECC Implementations: Attacks, Countermeasures and Cost. In: Naccache, D. (ed.) Cryphtography and Security: From Theory to Applications. LNCS, vol. 6805, pp. 265\u2013282. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Topics in Cryptology \u2013- CT-RSA 2015"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-16715-2_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,28]],"date-time":"2023-01-28T11:14:03Z","timestamp":1674904443000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-16715-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319167145","9783319167152"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-16715-2_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"11 March 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}