Cryptanalysis of a provably secure CRT-RSA algorithm

We study a countermeasure proposed to protect Chinese remainder theorem (CRT) computations for RSA against fault attacks. The scheme was claimed to be provably secure. However, we demonstrate that the proposal is in fact insecure: it can be broken with a simple and practical fault attack. We conclude that the proposed countermeasure is not safe for use in its present form. Categories and Subject Descriptors E.3 [Data]: Encryption General Terms Security Keywords Fault attacks, RSA, Chinese remainder theorem, cryptanalysis

• Type: Conference
• Year: 2004
• Where: CCS
• Authors: David Wagner
• Keywords: CCS 2004, Chinese Remainder Theorem, Fault Attacks, Practical Fault Attack, Security Privacy