Twisted Edwards Curves Revisited

  • Huseyin Hisil
  • Kenneth Koon-Ho Wong
  • Gary Carter
  • Ed Dawson
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5350)

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 \(8\mathrm{\textbf{M}}\) for suitably selected curve constants. In comparison, the fastest point addition algorithms for (twisted) Edwards curves stated in the literature use \(9\mathrm{\textbf{M}} + 1\mathrm{\textbf{S}}\). It is also shown that the new addition algorithm can be implemented with four processors dropping the effective cost to \(2\mathrm{\textbf{M}}\). 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).

Keywords

Efficient elliptic curve arithmetic unified addition side channel attack SPA 

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Huseyin Hisil
    • 1
  • Kenneth Koon-Ho Wong
    • 1
  • Gary Carter
    • 1
  • Ed Dawson
    • 1
  1. 1.Information Security InstituteQueensland University of TechnologyAustralia

Personalised recommendations