Euclidean addition chains scalar multiplication on curves with efficient endomorphism

Abstract : Random Euclidean addition chain generation has proven to be an efficient low memory and SPA secure alternative to standard ECC scalar multiplication methods in the context of fixed base point [21]. In this work, we show how to generalize this method to random point scalar multiplication on elliptic curves with an efficiently computable endomorphism. In order to do so we generalize results from [21] on the relation of random Euclidean chains generation and elliptic curve point distribution obtained from those chains. We propose a software implementation of our method on various platforms to illustrate the impact of our approach. For that matter, we provide a comprehensive study of the practical computational cost of the modular multiplication when using Java and C standard libraries developed for the arithmetic over large integers.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [39 references]  Display  Hide  Download

https://hal.inria.fr/hal-01794402
Contributor : Pascal Véron <>
Submitted on : Thursday, May 17, 2018 - 2:57:41 PM
Last modification on : Tuesday, December 4, 2018 - 7:42:05 PM
Document(s) archivé(s) le : Tuesday, September 25, 2018 - 8:21:07 PM

File

jcen-preprint-2018.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Fangan-Yssouf Dosso, Fabien Herbaut, Nicolas Méloni, Pascal Véron. Euclidean addition chains scalar multiplication on curves with efficient endomorphism. Journal of Cryptographic Engineering, Springer, In press, ⟨10.1007/s13389-018-0190-0⟩. ⟨hal-01794402⟩

Share

Metrics

Record views

129

Files downloads

110