CRT-based three-prime RSA with immunity against hardware fault attack
Yonghong Yang,Z. Abid,Wei Wang +2 more
- pp 73-76
Reads0
Chats0
TLDR
An immune method for three-prime RSA without checking procedure is proposed in this paper, which is more efficient than the previous methods.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.read more
Citations
More filters
Proceedings ArticleDOI
Error Prevention, Detection and Diffusion Algorithms for Cryptographic Hardware
TL;DR: It is urgent to propose hardware implementation of cryptographic algorithms that will be immune to this type of attack and a large number of algorithms that are susceptible to fault analysis are proposed.
References
More filters
Journal ArticleDOI
A method for obtaining digital signatures and public-key cryptosystems
TL;DR: An encryption method is presented with the novel property that publicly revealing an encryption key does not thereby reveal the corresponding decryption key.
Journal ArticleDOI
RSA speedup with Chinese remainder theorem immune against hardware fault cryptanalysis
TL;DR: This article considers the problem of how to prevent RSA signature and decryption computation with a residue number system (CRT-based approach) speedup from a hardware fault cryptanalysis in a highly reliable and efficient approach and proposes two novel protocols that have comparable performance to Shamir's scheme.
Proceedings ArticleDOI
RSA cryptosystem design based on the Chinese remainder theorem
TL;DR: The design and implementation of a systolic RSA cryptosystem based on a modified Montgomery's algorithm and the Chinese Remainder Theorem technique and the CRT technique is presented, which improves the throughput rate up to 4 times in the best case.