Efficient leak resistant modular exponentiation in RNS

Authors

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

RIS ID

117034

Publication Details

Lesavourey, A., Negre, C. & Plantard, T. (2017). Efficient leak resistant modular exponentiation in RNS. 24th IEEE Symposium on Computer Arithmetic (ARITH 2017) (pp. 156-163). IEEE Xplore: IEEE.

Abstract

2017 IEEE. The leak resistant arithmetic in RNS was introduced in 2004 to randomize RSA modular exponentiation. This randomization is meant to protect implementations on embedded device from side channel analysis. We propose in this paper a faster version of the approach of Bajard et al. in the case of right-to-left square-and-multiply exponentiation. We show that this saves roughly 30% of the computation when the randomization is done at each loop iteration. We also show that the level of randomization of the proposed approach is better than the one of Bajard et al. after a few number of loop iterations.