{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T22:47:03Z","timestamp":1794350823510,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540767879","type":"print"},{"value":"9783540767886","type":"electronic"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-76788-6_22","type":"book-chapter","created":{"date-parts":[[2007,11,12]],"date-time":"2007-11-12T09:24:16Z","timestamp":1194859456000},"page":"273-281","source":"Crossref","is-referenced-by-count":12,"title":["Safe-Error Attack on SPA-FA Resistant Exponentiations Using a HW Modular Multiplier"],"prefix":"10.1007","author":[{"given":"Chong Hee","family":"Kim","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jong Hoon","family":"Shin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Jacques","family":"Quisquater","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pil Joong","family":"Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"22_CR1","unstructured":"Advanced Crypto Engine, Infineon. available at, \n                      \n                        http:\/\/www.infin"},{"key":"22_CR2","unstructured":"Fame XE, NXD. available at, \n                      \n                        http:\/\/www.nxp.com"},{"key":"22_CR3","unstructured":"TORNATO, Samsung. available at \n                      \n                        http:\/\/www.samsung.com\/"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1007\/3-540-36400-5_20","volume-title":"CHES 2002","author":"C. Aum\u00fcller","year":"2003","unstructured":"Aum\u00fcller, C., Bier, P., Fischer, W., Hofreiter, P., Seifert, J.-P.: Fault attacks on RSA with CRT: Concrete results and practical countermeasures. In: Kaliski Jr., B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2002. LNCS, vol.\u00a02523, pp. 260\u2013275. Springer, Heidelberg (2003)"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BFb0028164","volume-title":"Security Protocols","author":"F. Bao","year":"1998","unstructured":"Bao, F., Deng, R., Han, Y., Jeng, A., Narasimhalu, A., Ngair, T.: Breaking public key cryptosystems on tamper resistant devices in the presence of transient faults. In: Christianson, B., Lomas, M. (eds.) Security Protocols. LNCS, vol.\u00a01361, pp. 115\u2013124. Springer, Heidelberg (1998)"},{"key":"22_CR6","unstructured":"Bar-El, H., Choukri, H., Naccache, D., Tunstall, M., Whelan, C.: The sorcerer\u2019s apprentice guide to fault attacks. In: Fault Diagnosis and Tolerance in Cryptography in association with DSN 2004 \u2013 The International Conference on Dependable Systems and Networks, pp. 330\u2013342 (2004)"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/11889700_2","volume-title":"Fault Diagnosis and Tolerance in Cryptography","author":"J. Bl\u00f6mer","year":"2006","unstructured":"Bl\u00f6mer, J., Otto, M.: Wagner\u2019s attack on a secure crt-rsa algorithm reconsidered. In: Breveglieri, L., Koren, I., Naccache, D., Seifert, J.-P. (eds.) FDTC 2006. LNCS, vol.\u00a04236, pp. 13\u201323. Springer, Heidelberg (2006)"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/3-540-69053-0_4","volume-title":"EUROCRYPT 1997","author":"D. Boneh","year":"1997","unstructured":"Boneh, D., DeMillo, R., Lipton, R.: On the importance of checking cryptographic protocols for faults. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 37\u201351. Springer, Heidelberg (1997)"},{"issue":"2","key":"22_CR9","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s001450010016","volume":"14","author":"D. Boneh","year":"2001","unstructured":"Boneh, D., DeMillo, R., Lipton, R.: On the importance of eliminating errors in cryptographic computations. Journal of Cryptology\u00a014(2), 101\u2013119 (2001) An earlier version appears in [8]","journal-title":"Journal of Cryptology"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/978-3-540-69338-3","volume-title":"WISTP 2007","author":"A. Boscher","year":"2007","unstructured":"Boscher, A., Naciri, R., Prouff, E.: CRT RSA algorithm protected against fault attacks. In: Sauveron, D., Markantonakis, K., Bilas, A., Quisquater, J.J. (eds.) WISTP 2007. LNCS, vol.\u00a04462, pp. 237\u2013252. Springer, Heidelberg (2007)"},{"key":"22_CR11","first-page":"1","volume-title":"Proceedings of the 17th International Symposium on Parallel and Distributed Processing","author":"S.B. \u00d6rs","year":"2003","unstructured":"\u00d6rs, S.B., Batina, L., Preneel, B., Vandewalle, J.: Hardware implementation of a Montgomery modular multiplier in a systolic array. In: Proceedings of the 17th International Symposium on Parallel and Distributed Processing, pp. 1\u20138. IEEE Computer Society, Los Alamitos (2003)"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","first-page":"142","volume-title":"CHES 2003","author":"C. Giraud","year":"2003","unstructured":"Giraud, C.: Fault resistant RSA implementation. In: D.Walter, C., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2003. LNCS, vol.\u00a02779, pp. 142\u2013151. Springer, Heidelberg (2003)"},{"key":"22_CR13","unstructured":"Joye, M., Pailler, P., Yen, S.-M.: Secure evaluation of modular functions. In: International Workshop on Cryptology and Network Security 2001, pp. 227\u2013229 (2001)"},{"key":"22_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/3-540-36400-5_22","volume-title":"CHES 2002","author":"M. Joye","year":"2003","unstructured":"Joye, M., Yen, S.-M.: The montgomery powering ladder. In: Kaliski Jr., B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2002. LNCS, vol.\u00a02523, pp. 291\u2013302. Springer, Heidelberg (2003)"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1007\/3-540-68697-5_9","volume-title":"CRYPTO 1996","author":"P. Kocher","year":"1996","unstructured":"Kocher, P.: Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 104\u2013113. Springer, Heidelberg (1996)"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Manochehri, K., Pourmozafari, S.: Modified radix-2 montgomery modular multiplication to make it faster and simpler. In: International Conference on Coding and Computing \u2013 ITCC 2005, vol.\u00a01, pp. 598\u2013602 (2005)","DOI":"10.1109\/ITCC.2005.204"},{"issue":"5","key":"22_CR17","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/TC.2002.1004593","volume":"51","author":"T. Messerges","year":"2002","unstructured":"Messerges, T., Dabbish, E., Sloan, R.: Examining smart-card security under the threat of power analysis attack. IEEE Transactions on Computers\u00a051(5), 541\u2013552 (2002)","journal-title":"IEEE Transactions on Computers"},{"key":"22_CR18","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1145\/1102120.1102138","volume-title":"Proc. of ACM conference on computer and communications security 2005","author":"J.-P. Seifert","year":"2005","unstructured":"Seifert, J.-P.: On authenticated computing and RSA-based authentication. In: Proc. of ACM conference on computer and communications security 2005, pp. 122\u2013127. ACM Press, New York (2005)"},{"key":"22_CR19","unstructured":"Shamir, A.: Method and apparatus for protecting public key schemes from timing and fault attacks. United States Patent \n                      \n                        \n                      \n                      $\\sharp$\n                    5,991,415 (November 23, 1999) Also presented at the rump session of EUROCRYPT 1997"},{"key":"22_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/3-540-36400-5_2","volume-title":"CHES 2002","author":"S. Skorobogatov","year":"2003","unstructured":"Skorobogatov, S., Anderson, R.-J.: Optical fault induction attacks. In: Kaliski Jr., B.S., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2002. LNCS, vol.\u00a02523, pp. 2\u201312. Springer, Heidelberg (2003)"},{"key":"22_CR21","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/1030083.1030097","volume-title":"11th ACM Conference on Computers and Communications Security","author":"D. Wagner","year":"2004","unstructured":"Wagner, D.: Cryptanalysis of a provably secure CRT-RSA algorithm. In: 11th ACM Conference on Computers and Communications Security, pp. 92\u201397. ACM Press, New York (2004)"},{"issue":"9","key":"22_CR22","doi-asserted-by":"publisher","first-page":"967","DOI":"10.1109\/12.869328","volume":"49","author":"S.-M. Yen","year":"2000","unstructured":"Yen, S.-M., Joye, M.: Checking before output may not be enough against fault based cryptanalysis. IEEE Transactions on Computers\u00a049(9), 967\u2013970 (2000)","journal-title":"IEEE Transactions on Computers"},{"key":"22_CR23","series-title":"Lecture Notes in Computer Science","first-page":"397","volume-title":"ICISC 2001","author":"S.-M. Yen","year":"2002","unstructured":"Yen, S.-M., Kim, S., Lim, S., Moon, S.: RSA speedup with residue number system immune against hardware fault cryptanalysis. In: Kim, K.-c. (ed.) ICISC 2001. LNCS, vol.\u00a02288, pp. 397\u2013413. Springer, Heidelberg (2002)"},{"issue":"4","key":"22_CR24","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1109\/TC.2003.1190587","volume":"52","author":"S.-M. Yen","year":"2003","unstructured":"Yen, S.-M., Kim, S., Lim, S., Moon, S.: RSA speedup with chinese remainder theorem immune against hardware fault cryptanalysis. IEEE Transactions on Computers\u00a052(4), 461\u2013472 (2003) An earlier version appears in [23]","journal-title":"IEEE Transactions on Computers"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology - ICISC 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76788-6_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T10:44:07Z","timestamp":1558262647000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76788-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540767879","9783540767886"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76788-6_22","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-540-76788-6","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}