素数域椭圆曲线密码系统算法实现研究

Analysis on Implementation of the Elliptic Curve Cryptography over Prime Fields

针对素数域椭圆曲线密码系统的算法高速实现，分别讨论了对椭圆曲线上的点的加法和倍点运算，以及对点的标量乘法运算进行优化的技术，同时给出了测试比较结果，说明了所讨论的优化技术可以大大提高整个椭圆曲线密码系统的算法实现性能。

For the high-speed implementation of elliptic curve cryptography over prime fields, the optimizing techniques of elliptic curve points doubling, points addition and points scalar multiplication have been discussed. Some algorithm performance data about using these techniques is given and compared, and the data shows these optimizing techniques can remarkably improve the performance of elliptic curve cryptography.