Lazy Leak Resistant Exponentiation in RNS - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2016

Lazy Leak Resistant Exponentiation in RNS


In [1] the authors introduced the leak resistant arithmetic in RNS 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 lazy version of the approach of [1] 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 [1] after a few number of loop iterations.
Fichier principal
Vignette du fichier
randomized-exponentiation-rns11.pdf (366.85 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01330927 , version 1 (13-06-2016)


  • HAL Id : hal-01330927 , version 1


Andrea Lesavourey, Christophe Negre, Thomas Plantard. Lazy Leak Resistant Exponentiation in RNS. [Research Report] DALI (UPVD); LIRMM (UM, CNRS). 2016. ⟨hal-01330927⟩
195 View
127 Download


Gmail Facebook Twitter LinkedIn More