Permanent fault attack on the parameters of RSA with CRT

  • Authors:
  • Sung-Ming Yen;SangJae Moon;JaeCheol Ha

  • Affiliations:
  • Laboratory of Cryptography and Information Security, Dept of Computer Science and Information Engineering, National Central University, Chung-Li, Taiwan, R.O.C.;Mobile Network Security Technology Research Center, Kyungpook National University, Taegu, Korea;Dept of Computer and Information, Korea Nazarene University, Choong Nam, Korea

  • Venue:
  • ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Chinese remainder theorem has been widely employed to speedup the RSA computation. In this paper, one kind of permanent fault attack on RSA with CRT will be pointed out which exploits a permanent fault on the storage of either p or q. This proposed attack is generic and powerful which can be applicable to both the conventional RSA with CRT and Shamir's fault attack immune design of RSA with CRT. Two popular and one recently proposed CRT recombination algorithms which are necessary for the above two mentioned RSA with CRT will be carefully examined in this paper for their immunity against the proposed parameter permanent fault attack.