计算机应用

• 网络与信息安全 • 上一篇    下一篇

一种GF(2m)上椭圆曲线点运算的混合坐标系

杨先文 李峥   

  1. 中国人民解放军信息工程大学电子技术学院202教研室 中国人民解放军信息工程大学电子技术学院202教研室
  • 收稿日期:2007-06-07 修回日期:2007-07-25 发布日期:2007-12-01 出版日期:2007-12-01
  • 通讯作者: 杨先文

Mixed coordinate for point algorithms on elliptic curve over GF(2m)

Xian-Wen YANG Zheng Li   

  • Received:2007-06-07 Revised:2007-07-25 Online:2007-12-01 Published:2007-12-01
  • Contact: Xian-Wen YANG

摘要: 椭圆曲线密码体制(ECC)是一种基于代数曲线的公钥密码体制。椭圆曲线上点运算是该密码体制核心运算,而坐标系的选取决定了点运算速度。为了提高椭圆曲线标量乘速度,在对已有仿射坐标系、Standard投影坐标系、Jacobian投影坐标系和Lopez & Dahab投影坐标系研究的基础上,提出了一种Lopez & Dahab投影坐标系扩展形式,并基于此构建了一种混合坐标系。算法复杂度分析表明,在该混合坐标系下,椭圆曲线标量乘运算时间复杂度比已有坐标系下运算时间复杂度要小。

关键词: 椭圆曲线密码体制, 有限域, 点运算, 混合坐标系

Abstract: Elliptic Curve Cryptosystem (ECC) is a kind of public-key cryptosystem based on algebraic curve. Point algorithms on elliptic curve are essential operations in ECC and its speed are decided by selected coordinate. On the basis of analyzing existing coordinates such as affine coordinate, Standard projective coordinate, Jacobian projective coordinate and Lopez & Dahab projective coordinate, an extension of Lopez & Dahab projective coordinate was proposed and a mixed projective coordinate was given to improve the speed of scalar multiplication. The result of analysis indicates that the operation time complexity of scalar multiplication under the mixed projective coordinate is more reduced than under any other coordinates.

Key words: Elliptic Curve Cryptosystem (ECC), finite field, point algorithms, mixed coordinates

中图分类号: