Novel Precomputation Schemes for Elliptic Curve Cryptosystems

Patrick Longa; Catherine Gebotys

Paper 2008/526

Novel Precomputation Schemes for Elliptic Curve Cryptosystems

Patrick Longa and Catherine Gebotys

Abstract

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.

Note: References have been updated.

Metadata

Available format(s): PDF
Publication info: Published elsewhere. Unknown where it was published
Keywords: Elliptic curve cryptography (multiple) scalar multiplication precomputation scheme Edwards curve Jacobi quartic
Contact author(s): plonga @ uwaterloo ca
History: 2009-01-08: revised; 2008-12-19: received; See all versions
Short URL: https://ia.cr/2008/526
License: CC BY

BibTeX

@misc{cryptoeprint:2008/526,
      author = {Patrick Longa and Catherine Gebotys},
      title = {Novel Precomputation Schemes for Elliptic Curve Cryptosystems},
      howpublished = {Cryptology {ePrint} Archive, Paper 2008/526},
      year = {2008},
      url = {https://eprint.iacr.org/2008/526}
}