Skip to Main content Skip to Navigation

Lazy Leak Resistant Exponentiation in RNS

Andrea Lesavourey 1 Christophe Negre 1 Thomas Plantard 2
1 DALI - Digits, Architectures et Logiciels Informatiques
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier, UPVD - Université de Perpignan Via Domitia
Abstract : 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.
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download
Contributor : Christophe Negre <>
Submitted on : Monday, June 13, 2016 - 11:07:35 AM
Last modification on : Thursday, April 18, 2019 - 7:21:37 PM


Files produced by the author(s)


  • 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⟩



Record views


Files downloads