Efficient Regular Modular Exponentiation Using Multiplicative Half-Size Splitting

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 : In this paper, we consider efficient RSA modular exponentiations x^K \mod N which are regular and constant time. We first review the multiplicative splitting of an integer x modulo N into two half-size integers. We then take advantage of this splitting to modify the square-and-multiply exponentiation as a regular sequence of squarings always followed by a multiplication by a half-size integer. The proposed method requires around 16% less word operations compared to Montgomery-ladder, square-always and square-and-multiply-always exponentiations. These theoretical results are validated by our implementation results which show an improvement by more than 12% compared approaches which are both regular and constant time.
Type de document :
Article dans une revue
Journal of Cryptographic Engineering, Springer, 2016, <10.1007/s13389-016-0134-5>
Liste complète des métadonnées


https://hal.archives-ouvertes.fr/hal-01185249
Contributeur : Christophe Negre <>
Soumis le : vendredi 21 août 2015 - 08:39:24
Dernière modification le : vendredi 9 juin 2017 - 10:43:06
Document(s) archivé(s) le : mercredi 26 avril 2017 - 09:43:59

Fichier

regular-expo-with-half-size-mu...
Fichiers produits par l'(les) auteur(s)

Licence


Distributed under a Creative Commons Paternité 4.0 International License

Identifiants

Collections

Citation

Christophe Negre, Thomas Plantard. Efficient Regular Modular Exponentiation Using Multiplicative Half-Size Splitting. Journal of Cryptographic Engineering, Springer, 2016, <10.1007/s13389-016-0134-5>. <hal-01185249>

Partager

Métriques

Consultations de
la notice

141

Téléchargements du document

152