Efficient Leak Resistant Modular Exponentiation in RNS - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Efficient Leak Resistant Modular Exponentiation in RNS

Résumé

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
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

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

Identifiants

Citer

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⟩
157 Consultations
238 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More