Paper 2015/284 Original: eprint.iacr.org/2015/284 ↗
A Note on Scalar Multiplication Using Division Polynomials
Abstract
Scalar multiplication is the most important and expensive operation in elliptic curve cryptosystems. In this paper we improve the efficiency of the Elliptic Net algorithm to compute scalar multiplication by using the equivalence of elliptic nets. The proposed method saves $four$ multiplications in each iteration loop. Experimental results also indicates that our algorithm will be more efficient than the previously known results in this line.
Metadata
- Available format(s)
PDF- Category
- Implementation
- Publication info
- Preprint.
- History
- 2015-03-26: last updated
- 2015-03-26: published
- Short URL
- https://ia.cr/2015/284
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2015/284,
author = {Binglong Chen and Chuangqiang Hu and Chang-An Zhao},
title = {A Note on Scalar Multiplication Using Division Polynomials},
howpublished = {Cryptology {ePrint} Archive, Paper 2015/284},
year = {2015},
url = {https://eprint.iacr.org/2015/284}
}