Welcome to the resource topic for 2015/284
Title:
A Note on Scalar Multiplication Using Division Polynomials
Authors: Binglong Chen, Chuangqiang Hu, Chang-An Zhao
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.
ePrint: https://eprint.iacr.org/2015/284
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .