Euclidean addition chains scalar multiplication on curves with efficient endomorphism - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Cryptographic Engineering Year : 2018

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.
Fichier principal
Vignette du fichier
jcen-preprint-2018.pdf (417.14 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01794402 , version 1 (17-05-2018)

Identifiers

Cite

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⟩
297 View
676 Download

Altmetric

Share

Gmail Facebook X LinkedIn More