Efficient Leak Resistant Modular Exponentiation in RNS - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

Efficient Leak Resistant Modular Exponentiation in RNS

(1) , (1) , (2)
1
2

Abstract

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.
Fichier principal
Vignette du fichier
s11-negre.pdf (564.13 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-01925642 , version 1 (16-11-2018)

Identifiers

Cite

Andrea Lesavourey, Christophe Negre, Thomas Plantard. Efficient Leak Resistant Modular Exponentiation in RNS. ARITH: Computer Arithmetic, Jul 2017, London, United Kingdom. pp.156-163, ⟨10.1109/ARITH.2017.39⟩. ⟨lirmm-01925642⟩
151 View
218 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More