Efficient Double Bases for Scalar Multiplication - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue IEEE Transactions on Computers Année : 2015

Efficient Double Bases for Scalar Multiplication

Résumé

In this paper we present efficient algorithms to take advantage of the double-base number system in the context of elliptic curve scalar multiplication. We propose a generalized version of Yao's exponentiation algorithm allowing the use of general double-base expansions instead of the popular double base chains. We introduce a class of constrained double base expansions and prove that the average density of non-zero terms in such expansions is $O\left(\frac{\log k}{\log \log k}\right)$ for any large integer $k$. We also propose an efficient algorithm for computing constrained expansions and finally provide a comprehensive comparison to double-base chain expansions, including a large variety of curve shapes and various key sizes.
Fichier principal
Vignette du fichier
EfficientDoubleBases-24-07-14.pdf (258.71 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01279418 , version 1 (26-02-2016)

Identifiants

Citer

Nicolas Méloni, M. A. Hasan. Efficient Double Bases for Scalar Multiplication. IEEE Transactions on Computers, 2015, 64 (8), pp.2204-2212. ⟨10.1109/TC.2014.2360539⟩. ⟨hal-01279418⟩

Collections

UNIV-TLN IMATH
88 Consultations
615 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More