Abstract
Focusing on servers that process many signatures or ciphertexts,this paper proposes two techniques for parallel computing with SIMD, which significantly enhances the speed of elliptic curve scalar multiplication. We also evaluate one of them based on a real implementationon a Pentium III, which incorporates the SIMD architecture. The results show that the proposed method is about 4.4 times faster than the conventional method.
Cite
CITATION STYLE
Aoki, K., Hoshino, F., Kobayashi, T., & Oguro, H. (2001). Elliptic curve arithmetic using SIMD. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2200, pp. 235–247). Springer Verlag. https://doi.org/10.1007/3-540-45439-x_16
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
