Sciweavers

ACNS
2009
Springer

Novel Precomputation Schemes for Elliptic Curve Cryptosystems

14 years 6 months ago
Novel Precomputation Schemes for Elliptic Curve Cryptosystems
We present an innovative technique to add elliptic curve points with the form P Q± , and discuss its application to the generation of precomputed tables for the scalar multiplication. Our analysis shows that the proposed schemes offer, to the best of our knowledge, the lowest costs for precomputing points on both single and multiple scalar multiplication and for various elliptic curve forms, including the highly efficient Jacobi quartics and Edwards curves.
Patrick Longa, Catherine H. Gebotys
Added 25 May 2010
Updated 25 May 2010
Type Conference
Year 2009
Where ACNS
Authors Patrick Longa, Catherine H. Gebotys
Comments (0)