Trade-off Approaches for Leak Resistant Modular Arithmetic in RNS - Archive ouverte HAL Access content directly
Conference Papers Year : 2015

Trade-off Approaches for Leak Resistant Modular Arithmetic in RNS

Guilherme Perin
  • Function : Author

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.
Fichier principal
Vignette du fichier
lra-randomise-rns10.pdf (349.71 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01143367 , version 1 (17-04-2015)

Licence

Attribution

Identifiers

Cite

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⟩
402 View
254 Download

Altmetric

Share

Gmail Facebook X LinkedIn More