International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Novel Precomputation Schemes for Elliptic Curve Cryptosystems

Authors:
Catherine Gebotys
Patrick Longa
Download:
URL: http://eprint.iacr.org/2008/526
Search ePrint
Search Google
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.
BibTeX
@misc{eprint-2008-18173,
  title={Novel Precomputation Schemes for Elliptic Curve Cryptosystems},
  booktitle={IACR Eprint archive},
  keywords={Elliptic curve cryptography, (multiple) scalar multiplication, precomputation scheme, Edwards curve, Jacobi quartic},
  url={http://eprint.iacr.org/2008/526},
  note={ plonga@uwaterloo.ca 14252 received 16 Dec 2008, last revised 8 Jan 2009},
  author={Catherine Gebotys and Patrick Longa},
  year=2008
}