GF（2^m）域上椭圆曲线点积算法的一种改进

Improvement of the algorithm of point multiplication on elliptic curves over GF（2^m）

提高椭圆曲线点积运算的效率是椭圆曲线研究的一个核心问题。文章对有限域GF(2m)上的椭圆曲线的点积运算作了较为深入的研究,并利用正则的二进制冗余序列构造了一种新的窗口算法,从算法的效率比较来看,本算法有一定的提高。

To improve the efficiency of the algorithm of point multiplication on elliptic curves is a key problem. In this paper, florae published fast algorithms for the point multiplication on elliptic curves are studied,and a new window method based on binary redundant representation is presented. Compared with previous point multiplication algorithms, the new method has higher efficiency.