基域F（2m）上椭圆曲线快速算法的分析与比较

Analysis and Comparison about Elliptic Curves Fast Algorithm Based on Field F（2m）

研究了域F(2m)上椭圆曲线算法的快速实现,介绍了标量乘法的四种快速优化算法,并对这四种快速算法的特点进行了详细的分析与比较,分析与比较表明,最高效的快速算法是将NAF与变长滑动窗口算法结合起来。

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.