Selection of Base Point of Elliptic Curve over GF(P) Using Distributed Parallel Arithmetic
Jinshan Zhang · Jisuanji fangzhen · 2004
The study and realization of elliptic curve cryptography have become the mainstream of the study on public cryptography ,and the selection of secure elliptic curves in cipher and their base points is the basis of implementing the elliptic curve cryptography.But high efficiency is the important factor to make the elliptic curve cryptosystem widely used. This paper ,firstly introduces the elliptic curve in finite field and algebraic law of its point group,gives the order of the group.Secondly the selection algorithm of the base point about secure elliptic curves over large prime number is discussed, and optimized resorting to distributed parallel algorithm,futher more the algorithm is implemented successfully in C language using the MIRACL system.The actual test results indicate that our work really enhances the selection efficiency of the base point about secure elliptic curves.