Koblitz曲线上的窗口标量乘算法  

Window Algorithm of Scalar Multiplication on Koblitz Curve

作　　者：殷新春[1] 侯红祥[1] 

机构地区：[1]扬州大学计算机科学与工程系,江苏扬州225009

出　　处：《小型微型计算机系统》2008年第10期1828-1831,共4页Journal of Chinese Computer Systems

基　　金：国家自然科学基金项目(NSF:60473012)资助;江苏省六大人才高峰(06-E-025)资助

摘　　要：研究Koblitz曲线上的快速标量乘法,从整数k的TNAF出发,给出一种上层运算:基于Frobenius映射的窗口算法,该算法对一定长度的序列预先计算其对应的椭圆曲线上点保存,累加赋值阶段充分使用该预计算表.由于Frobenius映射的高效,本文算法所需的点加量是传统窗口算法1/5～1/4,当窗口宽度任意时,本文算法的效率在任意坐标下比传统Comb算法高效至少66%.This paper studies fast scalar multiplication on Koblitz curve. An operation algorithm based on Frobenius map is proposed, window algorithm. The algorithm stores some points corresponding to a sequence at a fixed window length firstly, and then employs this pre-compute table at evaluation stage sufficiently. Because of high performance of Frobenius map, the point addition number needed by the algorithm in this paper is about 1/5-1/4 of that by traditional window algorithm. In addition, the algorithm is faster about 66% at least than traditional window with arbitrary window length.

关 键 词：椭圆曲线密码体制 标量乘法 KOBLITZ曲线 Frobenius映射 窗口算法 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]