The Comparisons of Point Multiplication in Elliptic Curve Cryptography

Six algorithms for scalar multiplication in elliptic curve are introduced. The computation complexities of the algorithms are analyzed. They are implemented using Java programming language. The algorithms are tested extensively, including the running time and the complexity. In different parameter K, the relations between window length r and computation complexity in the sliding window method are analyzed. The best window width is proposed. Finally, the complexity and test results of six algorithms are compared and analyzed.