特征3有限域上椭圆曲线的Montgomery算法  

Montgomery algorithm on elliptic curves over finite fields of character three

作　　者：汪宏[1] 李宝[1] 于伟[2] 

机构地区：[1]中国科学院研究生院信息安全国家重点实验室,北京100049 [2]中国科学技术大学电子工程与信息科学系,安徽合肥230026

出　　处：《通信学报》2008年第10期25-29,36,共6页Journal on Communications

基　　金：国家重点基础研究发展计划(“973”计划)基金资助项目(2007CB311201);国家高技术研究发展计划(“863”计划)基金资助项目(2006AA01Z427)~~

摘　　要：研究了Montgomery算法在特征3有限域上椭圆曲线的应用。根据Montgomery算法的结构,省去y坐标的计算,提出新的点加和倍点计算公式,加快点乘计算速度。经过理论分析和实验验证,提出的点加和倍点计算公式可节省约15%的运算时间。Application of Montgomery algorithm on elliptic curves defined over finite fields of character three was researched. Due to the structure of Montgomery algorithm, y-coordinate was ignored, a new formula to compute point addition and point doubling was proposed to accelerate the scalar point multiplication. According to theoretical analysis and experimental verification, new formula saves about 15 percent running time.

关 键 词：椭圆曲线 MONTGOMERY算法 GF(3^m) 点乘 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]