{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T07:03:15Z","timestamp":1761807795983,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642330261"},{"type":"electronic","value":"9783642330278"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-33027-8_26","type":"book-chapter","created":{"date-parts":[[2012,9,5]],"date-time":"2012-09-05T12:52:20Z","timestamp":1346849540000},"page":"447-462","source":"Crossref","is-referenced-by-count":11,"title":["Attacking RSA\u2013CRT Signatures with Faults on Montgomery Multiplication"],"prefix":"10.1007","author":[{"given":"Pierre-Alain","family":"Fouque","sequence":"first","affiliation":[]},{"given":"Nicolas","family":"Guillermin","sequence":"additional","affiliation":[]},{"given":"Delphine","family":"Leresteux","sequence":"additional","affiliation":[]},{"given":"Mehdi","family":"Tibouchi","sequence":"additional","affiliation":[]},{"given":"Jean-Christophe","family":"Zapalowicz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","unstructured":"Bellare, M., Rogaway, P.: Probabilistic signature scheme. US Patent 6266771 (2001)"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"Bl\u00f6mer, J., Otto, M., Seifert, J.-P.: A new CRT-RSA algorithm secure against Bellcore attacks. In: Jajodia, S., Atluri, V., Jaeger, T. (eds.) ACM Conference on Computer and Communications Security, pp. 311\u2013320. ACM (2003)","DOI":"10.1145\/948148.948151"},{"key":"26_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/3-540-69053-0_4","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"D. Boneh","year":"1997","unstructured":"Boneh, D., DeMillo, R.A., Lipton, R.J.: On the Importance of Checking Cryptographic Protocols for Faults. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 37\u201351. Springer, Heidelberg (1997)"},{"key":"26_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-642-23951-9_13","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2011","author":"\u00c9. Brier","year":"2011","unstructured":"Brier, \u00c9., Naccache, D., Nguyen, P.Q., Tibouchi, M.: Modulus Fault Attacks against RSA-CRT Signatures. In: Preneel, B., Takagi, T. (eds.) CHES 2011. LNCS, vol.\u00a06917, pp. 192\u2013206. Springer, Heidelberg (2011)"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-642-29011-4_30","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"Y. Chen","year":"2012","unstructured":"Chen, Y., Nguyen, P.Q.: Faster Algorithms for Approximate Common Divisors: Breaking Fully-Homomorphic-Encryption Challenges over the Integers. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 502\u2013519. Springer, Heidelberg (2012)"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Chow, G.C.T., Eguro, K., Luk, W., Leong, P.: A Karatsuba-based Montgomery multiplier. In: FPL 2010, pp. 434\u2013437 (2010)","DOI":"10.1109\/FPL.2010.89"},{"key":"26_CR7","unstructured":"Ciet, M., Joye, M.: Practical fault countermeasures for Chinese remaindering based cryptosystems. In: Breveglieri, L., Koren, I. (eds.) FDTC, pp. 124\u2013131 (2005)"},{"key":"26_CR8","unstructured":"Cohn, H., Heninger, N.: Approximate common divisors via lattices. Cryptology ePrint Archive, Report 2011\/437, (2011), http:\/\/eprint.iacr.org\/ (to appear at ANTS-X)"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Coron, J.-S., Giraud, C., Morin, N., Piret, G., Vigilant, D.: Fault attacks and countermeasures on Vigilant\u2019s RSA-CRT algorithm. In: Breveglieri et al. [4], pp. 89\u201396","DOI":"10.1109\/FDTC.2010.9"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1007\/978-3-642-04138-9_31","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2009","author":"J.-S. Coron","year":"2009","unstructured":"Coron, J.-S., Joux, A., Kizhvatov, I., Naccache, D., Paillier, P.: Fault Attacks on RSA Signatures with Partially Unknown Messages. In: Clavier, C., Gaj, K. (eds.) CHES 2009. LNCS, vol.\u00a05747, pp. 444\u2013456. Springer, Heidelberg (2009)"},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/978-3-642-10366-7_38","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"J.-S. Coron","year":"2009","unstructured":"Coron, J.-S., Mandal, A.: PSS Is Secure against Random Fault Attacks. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol.\u00a05912, pp. 653\u2013666. Springer, Heidelberg (2009)"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-642-11925-5_15","volume-title":"Topics in Cryptology - CT-RSA 2010","author":"J.-S. Coron","year":"2010","unstructured":"Coron, J.-S., Naccache, D., Tibouchi, M.: Fault Attacks Against emv Signatures. In: Pieprzyk, J. (ed.) CT-RSA 2010. LNCS, vol.\u00a05985, pp. 208\u2013220. Springer, Heidelberg (2010)"},{"key":"26_CR13","doi-asserted-by":"crossref","unstructured":"Fouque, P.-A., Guillermin, N., Leresteux, D., Tibouchi, M., Zapalowicz, J.-C.: Attacking RSA\u2013CRT signatures with faults on Montgomery multiplication. Cryptology ePrint Archive, Report 2012\/172 (2012), http:\/\/eprint.iacr.org\/ (Full version of this paper)","DOI":"10.1007\/978-3-642-33027-8_26"},{"issue":"9","key":"26_CR14","doi-asserted-by":"publisher","first-page":"1116","DOI":"10.1109\/TC.2006.135","volume":"55","author":"C. Giraud","year":"2006","unstructured":"Giraud, C.: An RSA implementation resistant to fault attacks and to simple power analysis. IEEE Trans. Computers\u00a055(9), 1116\u20131120 (2006)","journal-title":"IEEE Trans. Computers"},{"key":"26_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-44670-2_6","volume-title":"Cryptography and Lattices","author":"N. Howgrave-Graham","year":"2001","unstructured":"Howgrave-Graham, N.: Approximate Integer Common Divisors. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol.\u00a02146, pp. 51\u201366. Springer, Heidelberg (2001)"},{"key":"26_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-540-78440-1_13","volume-title":"Public Key Cryptography \u2013 PKC 2008","author":"M. Huang","year":"2008","unstructured":"Huang, M., Gaj, K., Kwon, S., El-Ghazawi, T.: An Optimized Hardware Architecture for the Montgomery Multiplication Algorithm. In: Cramer, R. (ed.) PKC 2008. LNCS, vol.\u00a04939, pp. 214\u2013228. Springer, Heidelberg (2008)"},{"issue":"3","key":"26_CR17","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1109\/40.502403","volume":"16","author":"\u00c7.K. Ko\u00e7","year":"1996","unstructured":"Ko\u00e7, \u00c7.K., Acar, T.: Analyzing and comparing Montgomery multiplication algorithms. IEEE Micro\u00a016(3), 26\u201333 (1996)","journal-title":"IEEE Micro"},{"issue":"6","key":"26_CR18","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1049\/ip-cdt:20040791","volume":"151","author":"C. McIvor","year":"2004","unstructured":"McIvor, C., McLoone, M., McCanny, J.: Modified Montgomery modular multiplication and RSA exponentiation techniques. IEE Proceedings - Computers and Digital Techniques\u00a0151(6), 402\u2013408 (2004)","journal-title":"IEE Proceedings - Computers and Digital Techniques"},{"key":"26_CR19","doi-asserted-by":"publisher","first-page":"534","DOI":"10.1145\/1228784.1228911","volume-title":"Proceedings of the 17th ACM Great Lakes Symposium on VLSI, GLSVLSI 2007","author":"N. Mentens","year":"2007","unstructured":"Mentens, N., Sakiyama, K., Preneel, B., Verbauwhede, I.: Efficient pipelining for modular multiplication architectures in prime fields. In: Proceedings of the 17th ACM Great Lakes Symposium on VLSI, GLSVLSI 2007, pp. 534\u2013539. ACM, New York (2007)"},{"key":"26_CR20","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1090\/S0025-5718-1985-0777282-X","volume":"44","author":"P.L. Montgomery","year":"1985","unstructured":"Montgomery, P.L.: Modular multiplication without trial division. Mathematics of Computation\u00a044, 519\u2013521 (1985)","journal-title":"Mathematics of Computation"},{"key":"26_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/3-540-44709-1_30","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2001","author":"H. Nozaki","year":"2001","unstructured":"Nozaki, H., Motoyama, M., Shimbo, A., Kawamura, S.-I.: Implementation of RSA Algorithm Based on RNS Montgomery Multiplication. In: Ko\u00e7, \u00c7.K., Naccache, D., Paar, C. (eds.) CHES 2001. LNCS, vol.\u00a02162, pp. 364\u2013376. Springer, Heidelberg (2001)"},{"key":"26_CR22","unstructured":"Oracle. JavaCard 3.0.1 Platform Specification, http:\/\/www.oracle.com\/technetwork\/java\/javacard\/overview\/"},{"key":"26_CR23","doi-asserted-by":"crossref","unstructured":"Orup, H.: Simplifying quotient determination in high-radix modular multiplication. In: IEEE Symposium on Computer Arithmetic 1995, pp. 193\u2013193 (1995)","DOI":"10.1109\/ARITH.1995.465359"},{"key":"26_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/978-3-642-00862-7_31","volume-title":"Topics in Cryptology \u2013 CT-RSA 2009","author":"M. Rivain","year":"2009","unstructured":"Rivain, M.: Securing RSA against Fault Analysis by Double Addition Chain Exponentiation. In: Fischlin, M. (ed.) CT-RSA 2009. LNCS, vol.\u00a05473, pp. 459\u2013480. Springer, Heidelberg (2009)"},{"key":"26_CR25","unstructured":"Shamir, A.: Improved method and apparatus for protecting public key schemes from timing and fault attacks. Patent Application, WO 1998\/052319 A1 (1998)"},{"key":"26_CR26","doi-asserted-by":"crossref","unstructured":"Skorobogatov, S.: Optical fault masking attacks. In: Breveglieri et al. [4], pp. 23\u201329","DOI":"10.1109\/FDTC.2010.18"},{"key":"26_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/3-540-36400-5_2","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2002","author":"S.P. Skorobogatov","year":"2003","unstructured":"Skorobogatov, S.P., 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":"26_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/978-3-540-74735-2_19","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2007","author":"D. Suzuki","year":"2007","unstructured":"Suzuki, D.: How to Maximize the Potential of FPGA Resources for Modular Exponentiation. In: Paillier, P., Verbauwhede, I. (eds.) CHES 2007. LNCS, vol.\u00a04727, pp. 272\u2013288. Springer, Heidelberg (2007)"},{"key":"26_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/3-540-48059-5_10","volume-title":"Cryptographic Hardware and Embedded Systems","author":"A.F. Tenca","year":"1999","unstructured":"Tenca, A.F., Ko\u00e7, \u00c7.K.: A Scalable Architecture for Montgomery Multiplication. In: Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 1999. LNCS, vol.\u00a01717, pp. 94\u2013108. Springer, Heidelberg (1999)"},{"key":"26_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/978-3-540-85053-3_9","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2008","author":"D. Vigilant","year":"2008","unstructured":"Vigilant, D.: RSA with CRT: A New Cost-Effective Solution to Thwart Fault Attacks. In: Oswald, E., Rohatgi, P. (eds.) CHES 2008. LNCS, vol.\u00a05154, pp. 130\u2013145. Springer, Heidelberg (2008)"},{"key":"26_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/3-540-36552-4_26","volume-title":"Information Security and Cryptology - ICISC 2002","author":"S.-M. Yen","year":"2003","unstructured":"Yen, S.-M., Moon, S.-J., Ha, J.C.: Hardware Fault Attackon RSA with CRT Revisited. In: Lee, P.J., Lim, C.H. (eds.) ICISC 2002. LNCS, vol.\u00a02587, pp. 374\u2013388. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Cryptographic Hardware and Embedded Systems \u2013 CHES 2012"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33027-8_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T22:19:05Z","timestamp":1744064345000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33027-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642330261","9783642330278"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33027-8_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}