计算机工程与应用2016，Vol.52Issue(1)：29-32,156,5.DOI:10.3778/j.issn.1002-8331.1312-0413
椭圆曲线中一种计算7P和7kP的改进算法
Improved algorithms for computing 7P and 7k P on elliptic curves
摘要
Abstract
To raise the efficiency of field operations on elliptic curve, based on the idea of trading multiplications for squares, two improved algorithms are proposed to compute 7P and 7k P directly over GFP in terms of affine coordinates, their computational complexity is I+18M+12S and I+(17k+2)M+(14k+1)S respectively, and the new algorithm's efficiency is improved by 8.3% and 13.5% respectively compared with the best algorithms at present. In addition, based on the same idea, a modified method is given to compute 5k P directly over GFP in terms of affine coordinates, its com-putational complexity is I+(9k+2)M+(14k+1)S , and the efficiency of the new method is improved by 17.2%and 35.7%respectively compared with Xu Kaiping's and MISHRA's method.关键词
椭圆曲线密码体制/标量乘法/乘法/底层域运算/仿射坐标Key words
Elliptic Curve Cryptosystem(ECC)/scalar multiplication/multiplications/field operations/affine coordinate分类
信息技术与安全科学引用本文复制引用
赖忠喜,张安洁,张占军..椭圆曲线中一种计算7P和7kP的改进算法[J].计算机工程与应用,2016,52(1):29-32,156,5.基金项目
浙江省教育厅科研项目资助(No.Y201533946). （No.Y201533946）
