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. © 2009 Springer Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Longa, P., & Gebotys, C. (2009). Novel precomputation schemes for elliptic curve cryptosystems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5536 LNCS, pp. 71–88). https://doi.org/10.1007/978-3-642-01957-9_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
