Published in

Association for Computing Machinery (ACM), ACM Transactions on Embedded Computing Systems, 4(13), p. 1-10, 2014

DOI: 10.1145/2560020

Links

Tools

Export citation

Search in Google Scholar

Message blinding method requiring no multiplicative inversion for RSA

Journal article published in 2014 by Heeseok Kim, Dong-Guk Han, Seokhie Hong, Jaecheol Ha
This paper was not found in any repository, but could be made available legally by the author.
This paper was not found in any repository, but could be made available legally by the author.

Full text: Unavailable

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

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.