Cryptology ePrint Archive: Report 2007/441

Faster Group Operations on Elliptic Curves

Huseyin Hisil and Kenneth Koon-Ho Wong and Gary Carter and Ed Dawson

Abstract: This paper improves implementation techniques of Elliptic Curve Cryptography. We introduce new formulae and algorithms for the group law on Jacobi quartic, Jacobi intersection, Edwards, and Hessian curves. The proposed formulae and algorithms can save time in suitable point representations. To support our claims, a cost comparison is made with classic scalar multiplication algorithms using previous and current operation counts. Most notably, the best speedup is obtained in the case of Jacobi quartic curves which also lead to one of the most efficient scalar multiplications benefiting from the proposed 2M + 5S + 1D (i.e. 2 multiplications, 5 squarings, and 1 multiplication by a curve constant) point doubling and 7M + 3S + 1D point addition algorithms. Furthermore, the new addition algorithm provides an efficient way to protect against side channel attacks which are based on simple power analysis (SPA).

Category / Keywords: Efficient elliptic curve arithmetic, unified addition, side channel attack.

Date: received 26 Nov 2007, last revised 11 Mar 2009

Contact author: h hisil at isi qut edu au

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20090311:203250 (All versions of this report)

Short URL: ia.cr/2007/441

Discussion forum: Show discussion | Start new discussion