Paper 2020/144
Double-Base Chains for Scalar Multiplications on Elliptic Curves
Wei Yu, Saud Al Musa, and Bao Li
Abstract
Double-base chains (DBCs) are widely used to speed up scalar multiplications on elliptic curves. We present three results of DBCs. First, we display a structure of the set containing all DBCs and propose an iterative algorithm to compute the number of DBCs for a positive integer. This is the first polynomial time algorithm to compute the number of DBCs for positive integers. Secondly, we present an asymptotic lower bound on average Hamming weights of DBCs
Metadata
- Available format(s)
-
PDF
- Category
- Implementation
- Publication info
- A minor revision of an IACR publication in EUROCRYPT 2020
- Keywords
- Elliptic curve cryptographyScalar multiplicationDouble-base chainHamming weight
- Contact author(s)
-
yuwei_1_yw @ 163 com
yuwei @ iie ac cn - History
- 2021-02-19: last of 2 revisions
- 2020-02-10: received
- See all versions
- Short URL
- https://ia.cr/2020/144
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2020/144, author = {Wei Yu and Saud Al Musa and Bao Li}, title = {Double-Base Chains for Scalar Multiplications on Elliptic Curves}, howpublished = {Cryptology {ePrint} Archive, Paper 2020/144}, year = {2020}, url = {https://eprint.iacr.org/2020/144} }