GF(2~m)域中椭圆曲线密码体制最省时的射影坐标变换  

The Fastest Projectsve Coordinate Transformation for Elliptic Curve Cryptography in GF(2~m)

作　　者：彭建芬[1] 

机构地区：[1]北京石油化工学院数理部,北京102617

出　　处：《北京石油化工学院学报》2004年第3期46-49,共4页Journal of Beijing Institute of Petrochemical Technology

摘　　要：为了提高椭圆曲线密码体制的加、解密速度,需要对模逆运算算法进行改进或省出求模逆运算来节省时间。通过射影坐标变换而省去求模逆运算,选取GF(2m)中3种代表性的射影坐标变换进行理论分析,得到的结果与在计算机上运行结果一致,从而得出x=X/z,y=y/Z2是最省时的射影坐标变换。In order to speed up encryption and decryption in Elliptic Curve Cryptography, Module Inverse Algorithm is improved or omitted to save time. In this paper, Module Inverse Algorithm is omitted by using projective coordinate transformation. Three representative projective coordinate transformations in GF(2m) are theoretically analyzed, and the result is in accordance with that obtained from computer, so we conclude that transformation x = X/Z, y = Y/Z2 is the fastest.

关 键 词：模逆 椭圆曲线密码体制 解密 计算机 坐标变换 算法 节省 射影 省时 逆运算 

分 类 号：TE973.92[石油与天然气工程—石油机械设备] G633.7[文化科学—教育学]