Compact variable-base ECC scalar multiplication using Euclidean addition chains - Archive ouverte HAL
Communication Dans Un Congrès Année : 2021

Compact variable-base ECC scalar multiplication using Euclidean addition chains

Résumé

The random generation of Euclidean addition chains fits well with a GLV context (Dosso et al., 2018) and provides a method with decent performance despite the growth of the base field required to get the same level of security. The aim of this paper is to reduce the size of the base field required. Combined with an algorithmic improvement, we obtain a reduction of 21% of the memory usage. Hence, our method appears to be one of the most compact scalar multiplication procedure and is particularly suitable for lightweight applications.
Fichier principal
Vignette du fichier
secrypt2021-extended (1).pdf (217.64 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03210582 , version 1 (28-04-2021)

Identifiants

Citer

Fabien Herbaut, Nicolas Méloni, Pascal Véron. Compact variable-base ECC scalar multiplication using Euclidean addition chains. 18th International Conference on Security and Cryptography (SECRYPT 2021), Jul 2021, Online Event, Italy. pp.531-539, ⟨10.5220/0010551705310539⟩. ⟨hal-03210582⟩
136 Consultations
285 Téléchargements

Altmetric

Partager

More