GF（2^m）域椭圆曲线密码体制中改进的省时算法

Better Fast Algorithm for Elliptic Curve Cryptography in GF （2^m） Field

为了提高椭圆曲线加解密速度,需要对模逆运算算法进行改进或省出求模逆运算来节省时间。以GF(2m)中三类代表性射影坐标变换中c=1,d=2时的射影坐标变换为GF(2m)域中椭圆密码体制最为省时的事实,通过c=1,d=2时的射影坐标和仿射坐标混合坐标点加进行运算,结果会比x=X/Z,y=Y/Z2射影坐标变换更为省时。

In order to speed up encryption and decryption in Elliptic curve cryptography, Module inverse algorithm is improved or committed to save time. In this paper, according to the fact that it is the fastest projective coordinate transformation when c=1, d=2 among three representative projective coordinate transformations, through mixed coordinate additions of affine coordinate and projective coordinate, we conclude that it is faster than the condition of projective coordinate transformations.