Research on Parallel Algorithm of Selecting Base Points of Elliptic Curve Cryptography over GF(p)
GF(p)上椭圆曲线密码的并行基点选取算法研究

This paper proposed a parallel algorithm of selecting base points of elliptic curve cryptography(ECC) over GF(p).The proposed parallel algorithm was composed of two sub-algorithms: parallel finding the random points of the elliptic curve(EC) cryptography and parallel judging whether or not the random point was the base point.Next the performances were theoretically analyzed and the experiment results were also given.The results show: all processors have better load balance;when the ratio of the execution time of a point addition to that of a point doubling is 3 during computing the scalar multiplication,the parallel efficiency of the proposed algorithm is up to 90%.Therefore,the proposed parallel algorithm can be applied to speed the selection of the base point of the elliptic curve cryptography over GF(p),improving the speed of encryption and decryption of ECC.