Twisted Edwards Curves Revisited

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

Paper 2008/522

Twisted Edwards Curves Revisited

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

Abstract

This paper introduces fast algorithms for performing group operations on twisted Edwards curves, pushing the recent speed limits of Elliptic Curve Cryptography (ECC) forward in a wide range of applications. Notably, the new addition algorithm uses 8M for suitably selected curve constants. In comparison, the fastest point addition algorithms for (twisted) Edwards curves stated in the literature use 9M+1S. It is also shown that the new addition algorithm can be implemented with four processors dropping the effective cost to 2M. This implies an effective speed increase by the full factor of 4 over the sequential case. Our results allow faster implementation of elliptic curve scalar multiplication. In addition, the new point addition algorithm can be used to provide a natural protection from side channel attacks based on simple power analysis (SPA). (M: Multiplication, S: Squaring)

Metadata

Available format(s): PDF
Category: Public-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Keywords: Effcient elliptic curve arithmetic unified addition side channel attack SPA.
Contact author(s): h hisil @ isi qut edu au
History: 2008-12-16: received
Short URL: https://ia.cr/2008/522
License: CC BY

BibTeX

@misc{cryptoeprint:2008/522,
      author = {Huseyin Hisil and Kenneth Koon-Ho Wong and Gary Carter and Ed Dawson},
      title = {Twisted Edwards Curves Revisited},
      howpublished = {Cryptology {ePrint} Archive, Paper 2008/522},
      year = {2008},
      url = {https://eprint.iacr.org/2008/522}
}