International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Efficient Quintuple Formulas for Elliptic Curves and Efficient Scalar Multiplication Using Multibase Number Representation

Authors:
Vassil Dimitrov
Pradeep Kumar Mishra
Download:
URL: http://eprint.iacr.org/2007/040
Search ePrint
Search Google
Abstract: In the current work we propose two efficient formulas for computing the $5$-fold ($5P$) of an elliptic curve point $P$. One formula is for curves over finite fields of even characteristic and the other is for curves over prime fields. Double base number systems (DBNS) have been gainfully exploited to compute scalar multiplication efficiently in ECC. Using the proposed point quintupling formulas one can use 2,5 and 3,5 (besides 3,5) as bases of the double base number system. In the current work we propose a scalar multiplication algorithm, which expands the scalar using three bases 2, 3 and 5 and computes the scalar multiplication very efficiently. The proposed scheme is faster than all sequential scalar multiplication algorithms reported in literature.
BibTeX
@misc{eprint-2007-13322,
  title={Efficient Quintuple Formulas for Elliptic Curves and Efficient Scalar Multiplication Using Multibase Number Representation},
  booktitle={IACR Eprint archive},
  keywords={Elliptic Curve Cryptosystems, Scalar Multiplication, Quintupling, Efficient Curve Arithmetic},
  url={http://eprint.iacr.org/2007/040},
  note={ pradeep@math.ucalgary.ca 13613 received 7 Feb 2007, last revised 10 Apr 2007},
  author={Vassil Dimitrov and Pradeep Kumar Mishra},
  year=2007
}