Sciweavers

Share
CHES
2011
Springer

Modulus Fault Attacks against RSA-CRT Signatures

8 years 1 days ago
Modulus Fault Attacks against RSA-CRT Signatures
RSA-CRT fault attacks have been an active research area since their discovery by Boneh, DeMillo and Lipton in 1997. We present alternative key-recovery attacks on RSA-CRT signatures: instead of targeting one of the sub-exponentiations in RSA-CRT, we inject faults into the public modulus before CRT interpolation, which makes a number of countermeasures against Boneh et al.’s attack ineffective. Our attacks are based on orthogonal lattice techniques and are very efficient in practice: depending on the fault model, between 5 to 45 faults suffice to recover the RSA factorization within a few seconds. Our simplest attack requires that the adversary knows the faulty moduli, but more sophisticated variants work even if the moduli are unknown, under reasonable fault models. All our attacks have been fully validated experimentally with fault-injection laser techniques.
Eric Brier, David Naccache, Phong Q. Nguyen, Mehdi
Added 13 Dec 2011
Updated 13 Dec 2011
Type Journal
Year 2011
Where CHES
Authors Eric Brier, David Naccache, Phong Q. Nguyen, Mehdi Tibouchi
Comments (0)
books