Skip to Main content Skip to Navigation
New interface
Conference papers

Compact variable-base ECC scalar multiplication using Euclidean addition chains

Abstract : 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.
Document type :
Conference papers
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-03210582
Contributor : Pascal Véron Connect in order to contact the contributor
Submitted on : Wednesday, April 28, 2021 - 8:03:58 AM
Last modification on : Tuesday, December 7, 2021 - 4:10:58 PM
Long-term archiving on: : Thursday, July 29, 2021 - 6:18:50 PM

File

secrypt2021-extended (1).pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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⟩

Share

Metrics

Record views

108

Files downloads

168