一个改进的多点乘算法  

An Improved Multiple Scalar Multiplication Algorithm

作　　者：冯新亚[1] 程一飞[1] 

机构地区：[1]安庆师范学院计算机系,安徽安庆246011

出　　处：《计算机技术与发展》2007年第2期236-238,共3页Computer Technology and Development

基　　金：安徽省教育厅自然科学研究项目(2006KJ079B)

摘　　要：SPA(Simple Power Analysis)攻击可能通过泄露的信息获取内存受限制的设备(如smart卡)中的密钥,它是通过区分一次点乘运算中点加运算和倍点运算进行的。抗SPA攻击的点乘算法较多,但对于多点乘算法相关措施较少。inter-leaving多点乘算法是一个时间和空间效率都非常优秀的多点乘算法。为此提出一种基于interleaving的抗SPA攻击的多点乘算法,新的算法在内存空间消耗和计算速度上较原算法负担增加可以忽略不计,而且能够抗SPA攻击。The Simple Power Analysis（SPA） attack might break the implementation of elliptic curve cryptosystem on memory constraint devices such as smart card. It attacks elliptic curve cryptosystem by distinguishing between point doubling and point addition in a single execution of scalar multiplication. Although there have been many SPA- resistant scalar multiplication algorithms, there are a few countermeasures for multiple scalar multiplication. The interleaving multiple scalar - multiplication algorithm is an excellent algorithm in efficiency and memory. A new SPA - resistant multiple scalar multiplication algorithm is proposed, which is based on the interleaving multiple ＂scalar - multiplication algorithm. The computational and memory overheads of the new algorithm are almost negligible, but it is SPA resistant.

关 键 词：点乘 多点乘 SPA ωNAF 

分 类 号：TP309.7[自动化与计算机技术—计算机系统结构]