{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T12:59:31Z","timestamp":1772283571349,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540002635","type":"print"},{"value":"9783540362319","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36231-2_24","type":"book-chapter","created":{"date-parts":[[2007,7,2]],"date-time":"2007-07-02T11:21:45Z","timestamp":1183375305000},"page":"296-313","source":"Crossref","is-referenced-by-count":39,"title":["Improved Elliptic Curve Multiplication Methods Resistant against Side Channel Attacks"],"prefix":"10.1007","author":[{"given":"Tetsuya","family":"Izu","sequence":"first","affiliation":[]},{"given":"Bodo","family":"M\u00f6ller","sequence":"additional","affiliation":[]},{"given":"Tsuyoshi","family":"Takagi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,12,18]]},"reference":[{"key":"24_CR1","unstructured":"ANSI X9.62-1998, Public Key Cryptography for the Financial ServicesI ndustry: The Elliptic Curve Digital Signature Algorithm (ECDSA), 1998."},{"key":"24_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/3-540-45664-3_24","volume-title":"PKC 2002","author":"E. Brier","year":"2002","unstructured":"E. Brier and M. Joye, \u201cWeierstra\u03b2 Elliptic Curves and Side-Channel Attacks\u201d, PKC 2002, LNCS 2274, pp. 335\u2013345, Springer-Verlag, 2002."},{"key":"24_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1007\/3-540-44709-1_25","volume-title":"CHES 2001","author":"C. Clavier","year":"2001","unstructured":"C. Clavier and M. Joye, \u201cUniversal exponentiation algorithm-A first step towards provable SPA-resistance-\u201d, CHES 2001, LNCS 2162, pp. 300\u2013308, 2001."},{"key":"24_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/3-540-49649-1_6","volume-title":"ASIACRYPT\u2019 98","author":"H. Cohen","year":"1998","unstructured":"H. Cohen, A. Miyaji and T. Ono, \u201cEfficient elliptic curve exponentiation using mixed coordinates\u201d, ASIACRYPT\u2019 98, LNCS 1514, pp. 51\u201365, 1998."},{"key":"24_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/3-540-48059-5_25","volume-title":"CHES\u2019 99","author":"J. Coron","year":"1999","unstructured":"J. Coron, \u201cResistance against differential power analysis for elliptic curve cryptosystems\u201d, CHES\u2019 99, LNCS 1717, pp. 292\u2013302, 1999."},{"key":"24_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/3-540-48059-5_7","volume-title":"CHES\u2019 99","author":"K. Itoh","year":"1999","unstructured":"K. Itoh, et al. \u201cFast Implementation of Public-Key Cryptography on a DSP TMS320C6201\u201d, CHES\u2019 99, LNCS 1717, pp. 61\u201372, 1999."},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"K. Itoh, J. Yajima, M. Takenaka, and N. Torii, \u201cDPA Countermeasures by improving the Window Method\u201d, to appear in CHES 2002,, 2002","DOI":"10.1007\/3-540-36400-5_23"},{"key":"24_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1007\/3-540-45664-3_20","volume-title":"PKC 2002","author":"T. Izu","year":"2002","unstructured":"T. Izu and T. Takagi, \u201cA Fast Parallel Elliptic Curve Multiplication Resistant against Side Channel Attacks\u201d, PKC 2002, LNCS 2274, pp. 280\u2013296, 2002."},{"key":"24_CR9","doi-asserted-by":"crossref","unstructured":"T. Izu and T. Takagi, \u201cA Fast Parallel Elliptic Curve Multiplication Resistant against Side Channel Attacks\u201d, Technical Report CORR 2002-03, University of Waterloo, 2002. Available from http:\/\/www.cacr.math.uwaterloo.ca\/ .","DOI":"10.1007\/3-540-45664-3_20"},{"key":"24_CR10","unstructured":"T. Izu and T. Takagi, \u201cOn the Security of Brier-Joye\u2019sA ddition Formula for Weierstrass-form Elliptic Curves\u201d, TR No. TI-3\/02, Technische Universit\u00e4t Darmstadt, 2002. Available from http:\/\/www.informatik.tu-darmstadt.de\/TI\/ ."},{"key":"24_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1007\/3-540-44709-1_33","volume-title":"CHES 2001","author":"M. Joye","year":"2001","unstructured":"M. Joye and J. Quisquater, \u201cHessian elliptic curves and side-channel attacks\u201d, CHES 2001, LNCS 2162, pp. 402\u2013410, 2001."},{"key":"24_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/3-540-44709-1_31","volume-title":"CHES 2001","author":"M. Joye","year":"2001","unstructured":"M. Joye and C. Tymen, \u201cProtections against differential analysis for elliptic curve cryptography\u201d, CHES 2001, LNCS 2162, pp. 377\u2013390, 2001."},{"key":"24_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/3-540-68697-5_9","volume-title":"CRYPTO\u2019 96","author":"C. Kocher","year":"1996","unstructured":"C. Kocher, \u201cTiming Attackson Implementations of Diffle-Hellman, RSA, DSS, and Other Systems\u201d, CRYPTO\u2019 96, LNCS 1109, pp. 104\u2013113, 1996."},{"key":"24_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"388","DOI":"10.1007\/3-540-48405-1_25","volume-title":"CRYPTO\u2019 99","author":"C. Kocher","year":"1999","unstructured":"C. Kocher, J. Jaffe and B. Jun, \u201cDifferential power analysis\u201d, CRYPTO\u2019 99, LNCS 1666, pp. 388\u2013397, 1999."},{"key":"24_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/3-540-44709-1_32","volume-title":"CHES 2001","author":"P. Liardet","year":"2001","unstructured":"P. Liardet and N. Smart, \u201cPreventing SPA\/DPA in ECC systems using the Jacobi form\u201d, CHES 2001, LNCS 2162, pp. 391\u2013401, 2001."},{"key":"24_CR16","unstructured":"A. J. Menezes, P.C. van Oorschot, and S. A. Vanstone. Handbook of applied cryptography, CRC Press, 1997."},{"key":"24_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1007\/3-540-45439-X_22","volume-title":"ISC 2001","author":"B. M\u00f6ller","year":"2001","unstructured":"B. M\u00f6ller, \u201cSecuring elliptic curve point multiplication against side-channel attacks\u201d, ISC 2001, LNCS 2200. pp. 324\u2013334, Springer-Verlag, 2001."},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"B. M\u00f6ller, \u201cSecuring elliptic curve point multiplication against side-channel attacks\u201d, Addendum: efficiency improvement, http:\/\/www.informatik.tu-darmstadt.de\/TI\/Mitarbeiter\/moeller\/ecc-sca-isc01.pdf , 2001.","DOI":"10.1007\/3-540-45439-X_22"},{"key":"24_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1007\/3-540-45811-5_31","volume-title":"ISC 2002","author":"B. M\u00f6ller","year":"2002","unstructured":"B. M\u00f6ller, \u201cParallelizable elliptic curve point multiplication method with resistance against side-channel attacks\u201d, ISC 2002, LNCS 2433. pp. 402\u2013413, 2002."},{"key":"24_CR20","doi-asserted-by":"publisher","first-page":"243","DOI":"10.2307\/2007888","volume":"48","author":"P. Montgomery","year":"1987","unstructured":"P. Montgomery, \u201cSpeeding the Pollard and elliptic curve methodsfor factorizations\u201d, Math. Comp., vol. 48, pp. 243\u2013264, 1987.","journal-title":"Math. Comp."},{"key":"24_CR21","unstructured":"National Institute of Standards and Technology, Recommended Elliptic Curvesfor Federal Government Use, Appendix to FIPS 186-2, 2000."},{"key":"24_CR22","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/3-540-44709-1_5","volume-title":"CHES 2001","author":"E. Oswald","year":"2001","unstructured":"E. Oswald, M. Aigner, \u201cRandomized Addition-Subtraction Chains as a Countermeasure against Power Attacks\u201d, CHES 2001, LNCS2162, pp. 39\u201350, 2001."},{"key":"24_CR23","unstructured":"H. Oguro and T. Kobayashi, \u201cEfficient Window Method on Elliptic Curve Cryptosystems\u201d, Proceedings of the 2002 Symposium on Cryptography and Information Security, SCIS 2002, pp. 687\u2013692, 2002 (in Japanese)."},{"key":"24_CR24","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1007\/3-540-45861-1_32","volume-title":"ICISC 2001","author":"K. Okeya","year":"2002","unstructured":"K. Okeya, K. Miyazaki, and K. Sakurai, \u201cA Fast Scalar Multiplication Method with Randomized Projective Coordinateson a Montgomeryform Elliptic Curve Secure against Side Channel Attacks\u201d, ICISC 2001, LNCS 2288, pp.428\u2013439, Springer-Verlag, 2002."},{"key":"24_CR25","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1007\/3-540-44495-5_16","volume-title":"INDOCRYPT 2000","author":"K. Okeya","year":"2000","unstructured":"K. Okeya and K. Sakurai, \u201cPower analysis breaks elliptic curve cryptosystems even secure against the timing attack\u201d, INDOCRYPT 2000, LNCS 1977, pp. 178\u2013190, Springer-Verlag, 2000."},{"key":"24_CR26","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1007\/3-540-44709-1_12","volume-title":"CHES 2001","author":"K. Okeya","year":"2001","unstructured":"K. Okeya and K. Sakurai, \u201cEfficient elliptic curve cryptosystems from a scalar multiplication algorithm with recovery of the y-coordinate on a Montgomery-form elliptic curve\u201d, CHES 2001, LNCS 2162, pp. 126\u2013141, Springer-Verlag, 2001."},{"key":"24_CR27","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1007\/3-540-45450-0_32","volume-title":"ACISP 2002","author":"K. Okeya","year":"2002","unstructured":"K. Okeya, and K. Sakurai, \u201cOn Insecurity of the Side Channel Attack Countermeasure using Addition-Subtraction Chains under Distinguishability between Addition and Doubling\u201d, ACISP 2002, LNCS2384, pp. 420\u2013435, 2002."},{"key":"24_CR28","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/3-540-45811-5_30","volume-title":"ISC 2002","author":"K. Okeya","year":"2002","unstructured":"K. Okeya, and K. Sakurai, \u201cA Second-Order DPA Attack Breaksa Windowmethod based Countermeasure against Side Channel Attacks\u201d, ISC 2002, LNCS 2433, pp. 389\u2013401, 2002."},{"key":"24_CR29","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/3-540-45664-3_19","volume-title":"PKC 2002","author":"W. Schindler","year":"2002","unstructured":"W. Schindler, \u201cA Combined Timing and Power Attack\u201d, PKC 2002, LNCS 2274, pp. 263\u2013279, Springer-Verlag, 2002. 304"},{"key":"24_CR30","unstructured":"M. Seysen, \u201cDPA-Gegenma\u00dfnahmen bei einer ECDSA-Implementierung auf Chipkarten\u201d, presented at DPA Workshop, Bonn (BSI), ECC Brainpool, 2001."},{"key":"24_CR31","unstructured":"Standards for Efficient Cryptography Group\/Certicom Research, SEC 1: Elliptic Curve Cryptography, Version 1.0, 2000. Available from http:\/\/www.secg.org\/ ."},{"key":"24_CR32","unstructured":"Standards for Efficient Cryptography Group\/Certicom Research, SEC 2: Recommended Elliptic Curve Cryptography Domain Parameters, Version 1.0, 2000."},{"key":"24_CR33","doi-asserted-by":"crossref","unstructured":"K. Vedder and F. Weikmann, \u201cSmart Cards-Requirements, Properties and Applications-\u201d, Chipkarten, Vieweg, pp. 1\u201323, 1998.","DOI":"10.1007\/978-3-322-89203-4_1"},{"key":"24_CR34","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1007\/3-540-45353-9_15","volume-title":"CT-RSA 2001","author":"C. D. Walter","year":"2001","unstructured":"C. D. Walter and S. Thompson, \u201cDistinguishing Exponent Digits by Observing Modular Subtractions\u201d, CT-RSA 2001, LNCS 2020, pp. 192\u2013207, 2001."},{"key":"24_CR35","unstructured":"C.D. Walter, \u201cBreaking the Liardet-Smart Randomized Exponentiation Algorithm\u201d, to appear in CARDIS\u2019 02."}],"container-title":["Lecture Notes in Computer Science","Progress in Cryptology \u2014 INDOCRYPT 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36231-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T21:26:33Z","timestamp":1556573193000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36231-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540002635","9783540362319"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/3-540-36231-2_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}