Cryptology ePrint Archive: Report 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.
Category / Keywords: Elliptic curve cryptography, (multiple) scalar multiplication, precomputation scheme, Edwards curve, Jacobi quartic
Date: received 16 Dec 2008, last revised 8 Jan 2009
Contact author: plonga at uwaterloo ca
Available format(s): PDF | BibTeX Citation
Note: References have been updated.
Version: 20090108:194827 (All versions of this report)
Short URL: ia.cr/2008/526
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]