Fast Sequential and Parallel Algorithms for Computing Scalar Multiplication in Elliptic Curve Cryptosystems
The scalar multiplication is a key operation in the elliptic curve cryptosystem. The two fast sequential algorithms for computing scalar multiplication are presented and implemented by applying the dual partitioning principle and representing the key as a vector respectively; and a new parallel computing scalar multiplication algorithm is proposed and implemented by the divide-conquer principle and the balance tree technique. The experiment results show that the presented sequential algorithms are efficient and the parallel algorithm can obtain a good speedup.
Elliptic Curve Cryptosystem Scalar Multiplication Sequential and Parallel Algorithms Cluster Computing System
Cheng Zhong Runhua Shi Lina Ge Zhi Li
School of Computer and Electronics and Information, Guangxi University, Nanning, Guangxi, 530004, Ch Guangxi Science and Technology Information Network Center Nanning, Guangxi 530012, China
国际会议
杭州
英文
50-53
2006-10-12(万方平台首次上网日期,不代表论文的发表时间)