A Note on Scalar Multiplication Using Division Polynomials

Binglong Chen; Chuangqiang Hu; Chang-An Zhao

Paper 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.

Metadata

Available format(s): PDF
Category: Implementation
Publication info: Preprint. MINOR revision.
Keywords: elliptic curve cryptosystems division polynomial elliptic net scalar multiplication side channel attack
Contact author(s): zhaochan3 @ mail sysu edu cn
History: 2015-03-26: received
Short URL: https://ia.cr/2015/284
License: CC BY

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},
      note = {\url{https://eprint.iacr.org/2015/284}},
      url = {https://eprint.iacr.org/2015/284}
}