Skip to Main content Skip to Navigation
Conference papers

Efficient Randomized Regular Modular Exponentiation using Combined Montgomery and Barrett Multiplications

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 : Cryptographic operations performed on an embedded device are vulnerable to side channel analysis and particularly to differential and correlation power analysis. The basic protection against such attacks is to randomize the data all along the cryptographic computations. In this paper we present a modular multiplication algorithm which can be used for randomization. We show that we can use it to randomize the modular exponentiation of the RSA cryptosystem. The proposed randomization is free of computation and induces a level of randomization from 2 ^10 to 2^15 for practical RSA modulus size.
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01330898
Contributor : Christophe Negre <>
Submitted on : Monday, June 13, 2016 - 10:54:56 AM
Last modification on : Wednesday, June 26, 2019 - 3:10:55 PM

File

randomized-barret-montgomery7....
Files produced by the author(s)

Identifiers

Collections

Citation

Andrea Lesavourey, Christophe Negre, Thomas Plantard. Efficient Randomized Regular Modular Exponentiation using Combined Montgomery and Barrett Multiplications. ICETE: International Joint Conference on e-Business and Telecommunications, Jul 2016, Lisbon, Portugal. pp.368-375, ⟨10.5220/0005998503680375⟩. ⟨hal-01330898⟩

Share

Metrics

Record views

384

Files downloads

566