针对滑动窗口算法的椭圆曲线密码故障分析  

Fault analysis on elliptic curve cryptosystems with sliding window method

作　　者：张金中[1] 寇应展[1] 王韬[1] 郭世泽[2] 赵新杰[1] 

机构地区：[1]军械工程学院计算机工程系,河北石家庄050003 [2]北方电子设备研究所,北京100083

出　　处：《通信学报》2012年第1期71-78,共8页Journal on Communications

基　　金：国家自然科学基金资助项目(60772082);河北省自然科学基金资助项目(08M010)~~

摘　　要：基于符号变换故障攻击原理，针对采用滑动窗口算法实现点乘运算的椭圆曲线密码，当故障位于倍点运算时，给出一种能够解决“零块失效”问题的改进故障分析方法，实验结果表明15次故障注入即可恢复192bit完整密钥；当故障位于加法运算时，提出一种新的故障分析方法，实验结果表明1次故障注入可将密钥搜索空间降低2^7～2^15。该方法对其他使用滑动窗口算法的密码算法故障攻击具有借鉴意义。Based on the principle of sign change fault attacks, an improved fault analysis method was presented against elliptic curve cryptosystems with sliding window method for point multiplication. When faults on double instruction it could effectively solve the ＂zero block failure＂ problem. Experiment results demonstrate that 15 times fault injections are enough to recover full 192bit key. When faults on add instruction, a new fault analysis method was proposed. Experiment results demonstrate one fault injection can reduce searching space 27-215. The method presented here can provide some ideas for fault attack on other cryptosystems using sliding window method.

关 键 词：公钥密码 椭圆曲线密码 故障攻击 点乘运算 滑动窗口算法 零块失效 

分 类 号：TP393.08[自动化与计算机技术—计算机应用技术]