Efficient Leak Resistant Modular 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 : 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.
Document type :
Conference papers
Liste complète des métadonnées

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01925642
Contributor : Isabelle Gouat <>
Submitted on : Friday, November 16, 2018 - 8:26:55 PM
Last modification on : Saturday, November 17, 2018 - 1:15:27 AM
Document(s) archivé(s) le : Sunday, February 17, 2019 - 3:35:50 PM

File

s11-negre.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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

Share

Metrics

Record views

117

Files downloads

28