Efficient Regular Modular Exponentiation Using Multiplicative Half-Size Splitting - Archive ouverte HAL Access content directly
Journal Articles Journal of Cryptographic Engineering Year : 2017

Efficient Regular Modular Exponentiation Using Multiplicative Half-Size Splitting

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.
Fichier principal
Vignette du fichier
regular-expo-with-half-size-mult7.pdf (279.8 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01185249 , version 1 (21-08-2015)

Licence

Identifiers

Cite

Christophe Negre, Thomas Plantard. Efficient Regular Modular Exponentiation Using Multiplicative Half-Size Splitting. Journal of Cryptographic Engineering, 2017, 7 (3), pp.245-253. ⟨10.1007/s13389-016-0134-5⟩. ⟨hal-01185249⟩
294 View
3531 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More