GF(2~n)上椭圆曲线标量乘法快速算法的改进  

An Improvement of Fast Scalar Multiplication Algorithm on Elliptic Curves Over GF(2~n)

作　　者：张建[1] 斯勤夫[1] 

机构地区：[1]内蒙古大学计算机学院,呼和浩特010021

出　　处：《内蒙古大学学报（自然科学版）》2012年第4期398-401,共4页Journal of Inner Mongolia University：Natural Science Edition

摘　　要：利用椭圆曲线密码体制上点乘运算改进的m进制方法,对一种标量乘法快速算法作了进一步改进,结果表明改进后的算法减少了椭圆曲线点乘运算的计算量及存储空间,并提高了运算效率.Using the idea of the improved m-ary method over elliptic curve cryptography,a further improvement of a fast scalar multiplication algorithm is given.Results show that the computational of scalar multiplication and the storage space are reduced by the improved algorithm,and the computation efficiency is improved.

关 键 词：椭圆曲线密码体制 点乘运算 点加 M进制 二进制域 

分 类 号：TN91[电子电信—通信与信息系统]