Efficient randomized regular modular exponentiation using combined Montgomery and Barrett multiplications

Authors

Andrea Lesavourey, Universite de Perpignan
Christophe Negre, University of Montpellier, France
Thomas Plantard, University of WollongongFollow

RIS ID

111429

Publication Details

Lesavourey, A., Negre, C. & Plantard, T. (2016). Efficient randomized regular modular exponentiation using combined Montgomery and Barrett multiplications. Proceedings of the 13th International Joint Conference on e-Business and Telecommunications (ICETE 2016) (pp. 368-375). United States: Science and Technology Publications, Lda..

Abstract

Copyright 2016 by SCITEPRESS - Science and Technology Publications, Lda. All rights reserved.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 210 to 215 for practical RSA modulus size.