摘要
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. Novel immune CRTbased multi-prime RSA is proposed and its properties in terms of the factorization complexity and operation speed are compared with those of extended CRT-2 protocol [7]. 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.
| 源语言 | 英语 |
|---|---|
| 文章编号 | 1465669 |
| 页(从-至) | 4649-4652 |
| 页数 | 4 |
| 期刊 | Proceedings - IEEE International Symposium on Circuits and Systems |
| DOI | |
| 出版状态 | 已出版 - 2005 |
| 活动 | IEEE International Symposium on Circuits and Systems 2005, ISCAS 2005 - Kobe, 日本 期限: 23 5月 2005 → 26 5月 2005 |
学术指纹
探究 'Efficient multi-prime RSA immune against hardware fault attack' 的科研主题。它们共同构成独一无二的学术指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver