Skip to Main content Skip to Navigation
New interface
Journal articles

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
Complete list of metadata

Cited literature [39 references]  Display  Hide  Download
Contributor : Pascal Véron Connect in order to contact the contributor
Submitted on : Thursday, May 17, 2018 - 2:57:41 PM
Last modification on : Friday, August 5, 2022 - 9:24:11 AM
Long-term archiving on: : Tuesday, September 25, 2018 - 8:21:07 PM


Files produced by the author(s)




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, In press, ⟨10.1007/s13389-018-0190-0⟩. ⟨hal-01794402⟩



Record views


Files downloads