Skip to main navigation Skip to search Skip to main content

Efficient multi-prime RSA immune against hardware fault attack

  • Y. Yang*
  • , Z. Abid
  • , W. Wang
  • , Z. Zhang
  • , C. Yang
  • *Corresponding author for this work
  • Western University
  • Beihang University

Research output: Contribution to journalConference articlepeer-review

Abstract

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.

Original languageEnglish
Article number1465669
Pages (from-to)4649-4652
Number of pages4
JournalProceedings - IEEE International Symposium on Circuits and Systems
DOIs
StatePublished - 2005
EventIEEE International Symposium on Circuits and Systems 2005, ISCAS 2005 - Kobe, Japan
Duration: 23 May 200526 May 2005

Fingerprint

Dive into the research topics of 'Efficient multi-prime RSA immune against hardware fault attack'. Together they form a unique fingerprint.

Cite this