基于多基数系统的优化多标量乘快速算法  

Optimized fast multi-scalar multiplication algorithm based on MBNS

作　　者：殷新春[1] 张海灵[1] 杨婷[1] 

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

出　　处：《通信学报》2010年第S1期122-126,共5页Journal on Communications

基　　金：国家高技术研究发展计划("863"计划)基金资助项目(2007AA0124487);国家自然科学基金资助项目(60473012)~~

摘　　要：多基数链作为双基数链的一个推广,具有标量表示长度更短、非零比特数目更少的特点,较适用于椭圆曲线标量乘的快速计算。结合现有的5倍点公式,同时以2、3和5作为基底,给出了利用多基系统计算椭圆曲线多标量乘的高效算法。与传统Shamir算法与交错NAF算法相比,所提算法计算量更少。As a generalization of double base chains,multi-base number system were very suitable for efficient computa-tion of scalar multiplications of elliptic curves because of shorter representation length and less Hamming weight.Com-bined with the given formulas for computing the 5-fold of an elliptic curve point P,the efficient scalar multiplication al-gorithms of elliptic curve was proposed using 2,3 and 5 as bases of the multi-base number system.The algorithms cost less compared with Shamir’s trick and interleaving with NAF’s method.

关 键 词：椭圆曲线 公钥密码体制 多标量乘 多基数系统 

分 类 号：TN918.1[电子电信—通信与信息系统]