Message Blinding Method Requiring No Multiplicative Inversion for RSA

Citations

WEB OF SCIENCE

3
Citations

SCOPUS

5

초록

This article proposes a new message blinding methods requiring no multiplicative inversion for RSA. Most existing message blinding methods for RSA additionally require the multiplicative inversion, even though computational complexity of this operation is O(n(3)) which is equal to that of the exponentiation. Thus, this additional operation is known to be the main drawback of the existing message blinding methods for RSA. In addition to requiring no additional multiplicative inversion, our new countermeasure provides the security against various power analysis attacks as well as general differential power analysis.

키워드

DesignAlgorithmsPerformanceSecuritySide channel attackspower analysismessage blinding methodPOWER ANALYSIS
제목
Message Blinding Method Requiring No Multiplicative Inversion for RSA
저자
Kim, HeeseokHan, Dong-GukHong, SeokhieHa, Jaecheol
DOI
10.1145/2560020
발행일
2014-11
유형
Article
저널명
Transactions on Embedded Computing Systems
13
4