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

Fault analysis on elliptic curve cryptosystems with sliding window method

基于符号变换故障攻击原理，针对采用滑动窗口算法实现点乘运算的椭圆曲线密码，当故障位于倍点运算时，给出一种能够解决“零块失效”问题的改进故障分析方法，实验结果表明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.