DocumentCode :
3265269
Title :
CRT-based three-prime RSA with immunity against hardware fault attack
Author :
Yang, Yonghong ; Abid, Z. ; Wang, Wei
Author_Institution :
Dept. of Electr. & Comput. Eng., Western Ontario Univ., London, Ont., Canada
fYear :
2004
fDate :
19-21 July 2004
Firstpage :
73
Lastpage :
76
Abstract :
In this paper, we carry out the study of the Chinese remainder theorem based three-prime RSA cryptosystem. The hardware fault attack on three-prime RSA cryptosystem is analyzed and it is proven that the three-prime RSA is more difficult to be broken than two-prime RSA by the hardware fault attack. Then, Shamir´s checking procedure is extended from two-prime to three-prime RSA to increase its immunity against such attack. Finally an immune method for three-prime RSA without checking procedure is proposed in this paper, which is more efficient than the previous methods. It is expected that this proposed system will play an important role in the future cryptography applications.
Keywords :
arithmetic; cryptography; fault tolerance; CRT-based three-prime RSA; Chinese remainder theorem; Shamir checking procedure; cryptography; hardware fault attack; three-prime RSA cryptosystem; Cathode ray tubes; Communication system security; Conferences; Field programmable gate arrays; Handwriting recognition; Hardware; Modems; Protocols; Public key; Public key cryptography;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
System-on-Chip for Real-Time Applications, 2004.Proceedings. 4th IEEE International Workshop on
Print_ISBN :
0-7695-2182-7
Type :
conf
DOI :
10.1109/IWSOC.2004.1319853
Filename :
1319853
Link To Document :
بازگشت