Efficient Randomized Regular Modular Exponentiation using Combined Montgomery and Barrett Multiplications - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Efficient Randomized Regular Modular Exponentiation using Combined Montgomery and Barrett Multiplications

Résumé

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.
Fichier principal
Vignette du fichier
randomized-barret-montgomery7.pdf (297.3 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01330898 , version 1 (13-06-2016)

Identifiants

Citer

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⟩
243 Consultations
694 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More