ETRI-Knowledge Sharing Plaform

ENGLISH

성과물

논문 검색
구분 SCI
연도 ~ 키워드

상세정보

학술지 Improved Shamir's CRT-RSA Algorithm: Revisit with the Modulus Chaining Method
Cited 8 time in scopus Download 6 time Share share facebook twitter linkedin kakaostory
저자
이승광, 최두호, 최용제
발행일
201406
출처
ETRI Journal, v.36 no.3, pp.469-478
ISSN
1225-6463
출판사
한국전자통신연구원 (ETRI)
DOI
https://dx.doi.org/10.4218/etrij.14.0113.0317
초록
RSA signature algorithms using the Chinese remainder theorem (CRT-RSA) are approximately four-times faster than straightforward implementations of an RSA cryptosystem. However, the CRT-RSA is known to be vulnerable to fault attacks; even one execution of the algorithm is sufficient to reveal the secret keys. Over the past few years, several countermeasures against CRT-RSA fault attacks have tended to involve additional exponentiations or inversions, and in most cases, they are also vulnerable to new variants of fault attacks. In this paper, we review how Shamir's countermeasure can be broken by fault attacks and improve the countermeasure to prevent future fault attacks, with the added benefit of low additional costs. In our experiment, we use the sidechannel analysis resistance framework system, a fault injection testing and verification system, which enables us to inject a fault into the right position, even to within 1 μs. We also explain how to find the exact timing of the target operation using an Atmega128 software board. © 2014 ETRI.
키워드
Countermeasure, CRT-RSA, Fault attack
KSP 제안 키워드
CRT-RSA, Chinese remainder theorem(CRT), Fault Attacks, Fault injection testing, RSA Algorithm, RSA Cryptosystem, Verification system, secret key, testing and verification