| GF(2m)域中椭圆曲线密码体制最省时的射影坐标变换 |
| |
| 引用本文： | 彭建芬.GF(2m)域中椭圆曲线密码体制最省时的射影坐标变换[J].北京石油化工学院学报,2004,12(3):46-49. |
| |
| 作者姓名： | 彭建芬 |
| |
| 作者单位： | 北京石油化工学院数理部,北京,102617 |
| |
| 摘 要： | 为了提高椭圆曲线密码体制的加、解密速度,需要对模逆运算算法进行改进或省出求模逆运算来节省时间.通过射影坐标变换而省去求模逆运算,选取GF(2m)中3种代表性的射影坐标变换进行理论分析,得到的结果与在计算机上运行结果一致,从而得出x=X/Z,,y=y/Z2是最省时的射影坐标变换.
|
| 关 键 词： | 椭圆曲线密码体制 射影坐标变换 GF(2m)域 |
| 修稿时间： | 2004年2月18日 |
The Fastest Projective Coordinate Transformation for Elliptic Curve Cryptography in GF(2m) |
| |
| Peng Jianfen.The Fastest Projective Coordinate Transformation for Elliptic Curve Cryptography in GF(2m)[J].Journal of Beijing Institute of Petro-Chemical Technology,2004,12(3):46-49. |
| |
| Authors: | Peng Jianfen |
| |
| Abstract: | 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. |
| |
| Keywords: | Elliptic Curve Cryptography projective coordinate transformation GF(2m) field |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
