 |
Free and accessible knowledge |
Conference papers
Efficient Randomized Regular Modular Exponentiation using Combined Montgomery and Barrett Multiplications
Abstract : Cryptographic operations performed on an embedded device are vulnerable to side channel analysis and particularly to differential and correlation power analysis. The basic protection against such attacks is to randomize the data all along the cryptographic computations. In this paper we present a modular multiplication algorithm which can be used for randomization. We show that we can use it to randomize the modular exponentiation of the RSA cryptosystem. The proposed randomization is free of computation and induces a level of randomization from 2 ^10 to 2^15 for practical RSA modulus size.
Cited literature [11 references]
https://hal.archives-ouvertes.fr/hal-01330898
Contributor : Christophe Negre Connect in order to contact the contributor
Submitted on : Monday, June 13, 2016 - 10:54:56 AM
Last modification on : Tuesday, March 15, 2022 - 12:55:43 PM
Contributor : Christophe Negre Connect in order to contact the contributor
Submitted on : Monday, June 13, 2016 - 10:54:56 AM
Last modification on : Tuesday, March 15, 2022 - 12:55:43 PM
File
randomized-barret-montgomery7....
Files produced by the author(s)