We improve several elliptic curve multiplication algorithms secure against side channel attacks (SCA). While some efficient SCA resistant algorithms were developed that apply only to special classes of curves, we are interested in algorithms that are suitable for general elliptic curves and can be applied to the recommended curves found in various standards. We compare the running time and memory usage of the improved schemes.
CITATION STYLE
Izu, T., Möller, B., & Takagi, T. (2002). Improved elliptic curve multiplication methods resistant against side channel attacks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2551, pp. 296–313). Springer Verlag. https://doi.org/10.1007/3-540-36231-2_24
Mendeley helps you to discover research relevant for your work.