BROWSE
Detail
Journal Article
A Secure Exponentiation Algorithm Resistant to a Combined Attack on RSA Implementation
Cited 11 time in 
Share 
Share
- Authors
- HyeongDong Kim, YongJe Choi, DooHo Choi, JaeCheol Ha
- Issue Date
- 2016-02
- Citation
- International Journal of Computer Mathematics, v.93, no.2, pp.258-272
- ISSN
- 0020-7160
- Publisher
- Taylor and Francis
- Language
- English
- Type
- Journal Article
- Abstract
- Because two types of side-channel attacks, namely passive information leakages and active fault injections, are considered separate implementation threats to cryptographic modules, most countermeasures against these attacks have been independently developed. However, Amiel et al. demonstrated that a fault injection combined with a simple power analysis (SPA) can break such a classical Rivest, Shamir, and Adelman (RSA) system implementation. In this paper, we show that this combined attack (CA) can be applied to the Boscher, Naciri, and Prouff algorithm, which is an SPA/fault attack (FA)-resistant exponentiation method for RSA implementation. Furthermore, this paper proposes a novel exponentiation algorithm resistant to power analysis and an FA as well as to the CA. The proposed exponentiation algorithm can be employed for secure Chinese remainder theorem-RSA implementation. In addition, the paper presents some experimental results of an SPA under the assumption of a successful fault injection.
- KSP Keywords
- Chinese remainder theorem(CRT), Fault Attacks, Fault Injection, Side Channel Attacks, combined attack on RSA, simple power analysis, system implementation