Compact Variable-base ECC Scalar Multiplication using Euclidean Addition Chains

Fabien Herbaut, Nicolas Méloni, Pascal Véron

2021

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.

Paper Citation

in Harvard Style

Herbaut F., Méloni N. and Véron P. (2021). Compact Variable-base ECC Scalar Multiplication using Euclidean Addition Chains. In Proceedings of the 18th International Conference on Security and Cryptography - Volume 1: SECRYPT, ISBN 978-989-758-524-1, pages 531-539. DOI: 10.5220/0010551705310539

in Bibtex Style

@conference{secrypt21,
author={Fabien Herbaut and Nicolas Méloni and Pascal Véron},
title={Compact Variable-base ECC Scalar Multiplication using Euclidean Addition Chains},
booktitle={Proceedings of the 18th International Conference on Security and Cryptography - Volume 1: SECRYPT,},
year={2021},
pages={531-539},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0010551705310539},
isbn={978-989-758-524-1},
}

in EndNote Style

TY - CONF

JO - Proceedings of the 18th International Conference on Security and Cryptography - Volume 1: SECRYPT,
TI - Compact Variable-base ECC Scalar Multiplication using Euclidean Addition Chains
SN - 978-989-758-524-1
AU - Herbaut F.
AU - Méloni N.
AU - Véron P.
PY - 2021
SP - 531
EP - 539
DO - 10.5220/0010551705310539