计算机工程与应用Issue(3)：67-70,4.DOI:10.3778/j.issn.1002-8331.1307-0383
椭圆曲线底层域快速算法的研究
Study on fast method of field operation in elliptic curves
赖忠喜 1张占军 1陶东娅1
作者信息
- 1. 台州职业技术学院 机电工程学院，浙江 台州 318000
- 折叠
摘要
Abstract
To raise the efficiency of field operation on elliptic curve, based on the idea of trading inversions for multiplica-tions, two efficient algorithms are proposed to compute 4P and 5P directly over prime field FP in terms of affine coordi-nates. Their computational complexity are I+7M+8S and I+12M+10S respectively, which are improved to 4.6%and 2.6%respectively than those of Duc-Phong’s and Xu Kaiping’s method. Moreover, a fast method is given to compute 5k P directly in terms of affine coordinates. Its computational complexity is I+(15k+1)M+(10k-1)S、 and the efficiency of the new method is improved to 5.7%and 26.8%respectively than those of Xu Kaiping’s and Mishra’s method.关键词
椭圆曲线密码体制/标量乘法/底层域运算/仿射坐标/求逆Key words
elliptic curve cryptosystem/scalar multiplication/field operation/affine coordinate/field inversion分类
信息技术与安全科学引用本文复制引用
赖忠喜,张占军,陶东娅..椭圆曲线底层域快速算法的研究[J].计算机工程与应用,2014,(3):67-70,4.
