Cryptology ePrint Archive: Report 2015/284

A Note on Scalar Multiplication Using Division Polynomials

Binglong~Chen, Chuangqiang~Hu and~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.

Category / Keywords: implementation / elliptic curve cryptosystems, division polynomial, elliptic net, scalar multiplication, side channel attack

Date: received 25 Mar 2015

Contact author: zhaochan3 at mail sysu edu cn

Available format(s): PDF | BibTeX Citation

Version: 20150326:094921 (All versions of this report)

Short URL: ia.cr/2015/284

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]