摘要
文章从有限域的基本运算和有限域上多倍点运算两个方面讨论分析了GF(2m)域SM2多倍点运算的实现算法和优化技巧,并给出了一个模一般三项式求余式的算法。实践表明运用这些算法和技巧,可以有效地提高多倍点运算的运行速度。
In this paper,algorithms and techniques for computing SM2 point multiplication over GF（2m） are discussed from two aspects,i.e.the underlying field operation and the elliptic curve point operation.A algorithm for reducing a general trinomial polynomial is given.The results indicate that the use of these algorithms and techniques,can effectively improve the speed for computing point multiplication.
出处
《信息网络安全》
2012年第1期36-39,共4页
Netinfo Security
关键词
多倍点运算
三项式
欧几里得算法变体
混合坐标系
加减法
point multiplication
trinomial polynomial
variant of the classical euclidean algorithm
mixed coordinates
addition-subtraction method
