A parallel base point choosing algorithm of ECC on binary field

In the elliptic curve cryptosystem, the suitability of base point plays an important role in the security of an elliptic curve selected. This paper firstly introduces traditional algorithm (serial algorithm) of the base point choosing in binary field, and we have found that the traditional algorithm had some deficiencies and then give some suggestions of improvement, secondly, we propose a further optimized and improved algorithm of choosing base point with the method of parallelization, and ultimately give the performance analysis of the proposed algorithm. The result shows that the present algorithm will greatly reduce the time consumption and complexity of computing compared to the original algorithm, which will have inspired significance in the time of the increasing popularity of RFID technology.