Koblitz曲线密码体制中一种可抵抗边带信道攻击的标量乘算法  

Efficient scalar multiplication algorithm against SCA for Koblitz curve cryptosystems

作　　者：李明[1] 秦宝东[1] 李大兴[1] 

机构地区：[1]山东大学网络信息安全研究所,济南250100

出　　处：《计算机应用》2007年第8期1926-1928,共3页journal of Computer Applications

基　　金：国家863计划资助项目(2003AA141120)

摘　　要：分析了如何改造Doubling攻击来攻击Koblitz曲线上的标量乘算法,提出了一种利用半点操作对输入的点进行随机化的方法,并将其与Koblitz曲线上的固定窗口算法结合起来,以抵抗边带信道攻击。分析表明,该算法不仅具备了可以抵抗简单功耗分析、差分功耗分析、改进的差分功耗分析、零值攻击和Doubling攻击的性质,而且保持了运算的高效,具有实际意义。Analysis of how to transform Doubling attack to attack Koblitz curve of the scalar multiplication was given. A randomized method for input points by using point halving was proposed, which was integrated with Koblitz curve of fixed window algorithm, to resist the side channel attack. The analysis demonstrates that the method can not only resist Simple Power Analysis （SPA）, Differential Power Analysis （ DPA）, Refined Differential Power Analysis （RPA）, Zero-value Power Attack （ZPA） and Doubling attack, but also has efficient and practical significance.

关 键 词：椭圆曲线密码体制 标量乘 边带信道攻击 KOBLITZ曲线 

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