Efficient Fixed Base Exponentiation and Scalar Multiplication based on a Multiplicative Splitting Exponent Recoding - Archive ouverte HAL Access content directly
Journal Articles Journal of Cryptographic Engineering Year : 2019

Efficient Fixed Base Exponentiation and Scalar Multiplication based on a Multiplicative Splitting Exponent Recoding

(1) , (1) , (2)
1
2

Abstract

Digital Signature Algorithm (DSA) (resp. ECDSA) involves modular exponentiation (resp. scalar multiplication) of a public and known base by a random one-time exponent. In order to speed-up this operation, well-known methods take advantage of the memorization of base powers (resp. base multiples). Best approaches are the Fixed-base Radix-R method and the Fixed-base Comb method. In this paper we present a new approach for storage/online computation trade-off, by using a multiplicative splitting of the digits of the exponent radix-R representation. We adapt classical algorithms for modular exponentiation and scalar multiplication in order to take advantage of the proposed exponent recoding. An analysis of the complexity for practical size shows that our proposed approach involves a lower storage for a given level of online computation. This is confirmed by implementation results showing significant memory saving, up to 3 times for the largest NIST standardized key sizes, compared to the state of the art approaches.
Fichier principal
Vignette du fichier
fixed-base-expo-and-scalar-mult-v19.pdf (682.54 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-01926767 , version 1 (19-11-2018)

Identifiers

Cite

Jean-Marc Robert, Christophe Negre, Thomas Plantard. Efficient Fixed Base Exponentiation and Scalar Multiplication based on a Multiplicative Splitting Exponent Recoding. Journal of Cryptographic Engineering, 2019, 9 (2), pp.115-136. ⟨10.1007/s13389-018-0196-7⟩. ⟨lirmm-01926767⟩
201 View
731 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More