Efficient Multi-Prime RSA Immune against Hardware Fault Attack
Y. Yang, Z. Abid, Wenjia Wang, Z. Zhang, Ching-Chao Yang · 2005
In this paper, a study on the factorization analysis and improvement of the Chinese remainder theorem (CRT)-based multi-prime RSA against the hardware fault attack is carried out. A novel immune CRT-based multi-prime RSA is proposed and its properties in terms of the factorization complexity and operation speed are compared with those of the extended CRT-2 protocol (S. Yen et al, IEEE Trans. on computers, vol.52, p.461-472, 2003). The proposed multi-prime RSA and the extended CRT-2 protocol applied in a three-prime RSA are implemented using FPGA technology. The implementation results show that the proposed immune multi-prime RSA is 30% faster while requiring only 75% of the hardware resources, compared to the extended CRT-2 RSA protocol.