A New Algorithm for Double Scalar Multiplication over Koblitz Curves
Cryptography and Security
2018-01-29 v1 Data Structures and Algorithms
Abstract
Koblitz curves are a special set of elliptic curves and have improved performance in computing scalar multiplication in elliptic curve cryptography due to the Frobenius endomorphism. Double-base number system approach for Frobenius expansion has improved the performance in single scalar multiplication. In this paper, we present a new algorithm to generate a sparse and joint -adic representation for a pair of scalars and its application in double scalar multiplication. The new algorithm is inspired from double-base number system. We achieve 12% improvement in speed against state-of-the-art -adic joint sparse form.
Keywords
Cite
@article{arxiv.1801.08589,
title = {A New Algorithm for Double Scalar Multiplication over Koblitz Curves},
author = {J. Adikari and V. S. Dimitrov and R. J. Cintra},
journal= {arXiv preprint arXiv:1801.08589},
year = {2018}
}
Comments
5 pages, 2 figures, 1 table