@inproceedings{BOS.CCS.2003,
       AUTHOR = {Johannes Bl{\"o}mer and Martin Otto and Jean-Pierre Seifert},
        TITLE = {A New CRT-RSA Algorithm Secure Against Bellcore Attacks},
    BOOKTITLE = {Proceedings of the 10th ACM Conference on Computer and 
		Communications Security (CCS 2003)},
         YEAR = {2003},
       EDITOR = {Vijay Atluri and Peng Liu},
        PAGES = {311--320},
 ORGANIZATION = {ACM},
    PUBLISHER = {ACM Press},
        MONTH = {Oct},
     ABSTRACT = {In this paper we describe a new algorithm to prevent fault attacks 
	on RSA signature algorithms using the Chinese Remainder Theorem 
	(CRT-RSA).  This variant of the RSA signature algorithm is widely used 
	on smartcards.  Smartcards on the other hand are particularly 
	susceptible to fault attacks like the one described in [7]. Recent 
	results have shown that fault attacks are practical and easy to 
	accomplish ([21], [17]).  Therefore, they establish a practical need for 
	fault attack protected CRT-RSA schemes.  Starting from a careful 
	derivation and classification of fault models, we describe a new variant 
	of the CRT-RSA algorithm.  For the most realistic fault model described, 
	we rigorously analyze the success probability of an adversary.  Thereby, 
	we prove that our new algorithm is secure against the Bellcore attack.  
	Only once in the analysis do we need to refer to a plausible number 
	theoretic assumption.}
}