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.
Type de document :
Communication dans un congrès
SECRYPT: Security and Cryptography, Jul 2016, Lisbon, Portugal. 13th International Conference on Security and Cryptography, 2016, <http://www.secrypt.icete.org/?y=2016>
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-01330898
Contributeur : Christophe Negre <>
Soumis le : lundi 13 juin 2016 - 10:54:56
Dernière modification le : vendredi 9 juin 2017 - 10:41:45

Fichier

randomized-barret-montgomery7....
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01330898, version 1

Collections

Citation

Andrea Lesavourey, Christophe Negre, Thomas Plantard. Efficient Randomized Regular Modular Exponentiation using Combined Montgomery and Barrett Multiplications. SECRYPT: Security and Cryptography, Jul 2016, Lisbon, Portugal. 13th International Conference on Security and Cryptography, 2016, <http://www.secrypt.icete.org/?y=2016>. <hal-01330898>

Partager

Métriques

Consultations de
la notice

145

Téléchargements du document

123