Skip to Main content Skip to Navigation
Conference papers

Trade-off Approaches for Leak Resistant Modular Arithmetic in RNS

Christophe Negre 1 Guilherme Perin 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 : On an embedded device, an implementation of cryptographic operation, like an RSA modular exponentiation, can be attacked by side channel analysis. In particular, recent improvements on horizontal power analysis render ineffective the usual countermeasures which randomize the data at the very beginning of the computations. To counteract horizontal analysis it is necessary to randomize the computations all along the exponentiation. The leak resistant arithmetic (LRA) proposed in [1] implements modular arithmetic in residue number system (RNS) and randomizes the computations by randomly changing the RNS bases. We propose in this paper a variant of the LRA in RNS: we propose to change only one or a few moduli of the RNS basis. This reduces the cost of the randomization and makes it possible to be executed at each loop of a modular exponentiation.
Document type :
Conference papers
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download
Contributor : Christophe Negre Connect in order to contact the contributor
Submitted on : Friday, April 17, 2015 - 3:03:46 PM
Last modification on : Tuesday, March 15, 2022 - 12:55:42 PM
Long-term archiving on: : Tuesday, April 18, 2017 - 10:52:01 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Christophe Negre, Guilherme Perin. Trade-off Approaches for Leak Resistant Modular Arithmetic in RNS. ACISP: Australasian Conference on Information Security and Privacy, Jun 2015, Brisbane, Australia. pp.107-124, ⟨10.1007/978-3-319-19962-7_7⟩. ⟨hal-01143367⟩



Record views


Files downloads