This paper describes a simpler attack, whose complexity is polynomial in the number of faults; consequently, the new attack can handle much larger UMPs. The new technique can factor N in a fraction of a second using ten faulty EMV signatures -- a target beyond CJKNP's reach.
We show how to apply the attack even when N is unknown, a frequent situation in real-life attacks.
Category / Keywords: public-key cryptography / Fault Attacks, Digital Signatures, RSA, ISO/IEC 9796-2, EMV Date: received 18 Oct 2009 Contact author: mehdi tibouchi at ens fr Available format(s): PDF | BibTeX Citation Version: 20091020:114650 (All versions of this report) Short URL: ia.cr/2009/503 Discussion forum: Show discussion | Start new discussion