Analysis and Comparison about Elliptic Curves Fast Algorithm Based on Field F(2~m)
Liu Ruiqin · Journal of North China Institute of Science and Technology · 2008
In this paper,we study on the fast implementation of Elliptic Curve Cryptography based on field F(2m),and introduce four kinds of fast optimization algorithms of scalar multiplication,according to the features of them,we did detailed analysis and comparison.The results showed that,the most efficient fast algorithm is combining NAF with variable-length-sliding window algorithm.