An efficient CRT-RSA algorithm secure against power and fault attacks
- Authors
- Kim, Sung-Kyoung; Kim, Tae Hyun; Han, Dong-Guk; Hong, Seokhie
- Issue Date
- 10월-2011
- Publisher
- ELSEVIER SCIENCE INC
- Keywords
- Chinese Remainder Theorem (CRT); Factorization attack; Fault attack; Checking procedure; Simple power analysis; Differential power analysis
- Citation
- JOURNAL OF SYSTEMS AND SOFTWARE, v.84, no.10, pp.1660 - 1669
- Indexed
- SCIE
SCOPUS
- Journal Title
- JOURNAL OF SYSTEMS AND SOFTWARE
- Volume
- 84
- Number
- 10
- Start Page
- 1660
- End Page
- 1669
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/111502
- DOI
- 10.1016/j.jss.2011.04.026
- ISSN
- 0164-1212
- Abstract
- RSA digital signatures based on the Chinese Remainder Theorem (CRT) are subject to power and fault attacks. In particular, modular exponentiation and CRT recombination are prone to both attacks. However, earlier countermeasures are susceptible to the possibility of advanced and sophisticated attacks. In this paper, we investigate state-of-the-art countermeasures against power and fault attacks from the viewpoint of security and efficiency. Then, we show possible vulnerabilities to fault attacks. Finally, we propose new modular exponentiation and CRT recombination algorithms secure against all known power and fault attacks. Our proposal improves efficiency by replacing arithmetic operations with logical ones to check errors in the CRT recombination step. In addition, since our CRT-RSA algorithm does not require knowledge of the public exponent, it guarantees a more versatile implementation. (C) 2011 Elsevier Inc. All rights reserved.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - School of Cyber Security > Department of Information Security > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.