arXiv · 1801.08589
A New Algorithm for Double Scalar Multiplication over Koblitz Curves
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 $\tau$-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 $\tau$-adic joint sparse form.
Explore related subjects
Keep this discovery
J. Adikari, V. S. Dimitrov, R. J. Cintra. 2018-01-25. A New Algorithm for Double Scalar Multiplication over Koblitz Curves. https://doi.org/10.1109/iscas.2011.5937664
Cite the original work for its findings. Save a collection to share your selection of sources.