Novel Precomputation Schemes for Elliptic Curve Cryptosystems
- Cite this paper as:
- Longa P., Gebotys C. (2009) Novel Precomputation Schemes for Elliptic Curve Cryptosystems. In: Abdalla M., Pointcheval D., Fouque PA., Vergnaud D. (eds) Applied Cryptography and Network Security. ACNS 2009. Lecture Notes in Computer Science, vol 5536. Springer, Berlin, Heidelberg
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.
KeywordsElliptic curve cryptosystem scalar multiplication multiple scalar multiplication precomputation scheme conjugate addition
Unable to display preview. Download preview PDF.