Analysis on Implementation of the Elliptic Curve Cryptography over Prime Fields
Liyong Tang · Jisuanji gongcheng · 2003
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.