首页 | 本学科首页   官方微博 | 高级检索  
     

针对滑动窗口算法的椭圆曲线密码故障分析
引用本文:张金中,寇应展,王 韬,郭世泽,赵新杰.针对滑动窗口算法的椭圆曲线密码故障分析[J].通信学报,2012(1):71-78.
作者姓名:张金中  寇应展  王 韬  郭世泽  赵新杰
作者单位:军械工程学院计算机工程系;北方电子设备研究所
基金项目:国家自然科学基金资助项目(60772082);河北省自然科学基金资助项目(08M010)~~
摘    要:基于符号变换故障攻击原理,针对采用滑动窗口算法实现点乘运算的椭圆曲线密码,当故障位于倍点运算时,给出一种能够解决"零块失效"问题的改进故障分析方法,实验结果表明15次故障注入即可恢复192bit完整密钥;当故障位于加法运算时,提出一种新的故障分析方法,实验结果表明1次故障注入可将密钥搜索空间降低27~215。该方法对其他使用滑动窗口算法的密码算法故障攻击具有借鉴意义。

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

Fault analysis on elliptic curve cryptosystems with sliding window method
ZHANG Jin-zhong,KOU Ying-zhan,WANG Tao,GUO Shi-ze,ZHAO Xin-jie.Fault analysis on elliptic curve cryptosystems with sliding window method[J].Journal on Communications,2012(1):71-78.
Authors:ZHANG Jin-zhong  KOU Ying-zhan  WANG Tao  GUO Shi-ze  ZHAO Xin-jie
Affiliation:1(1.Department of Computer Engineering,Ordnance Engineering College,Shijiazhuang 050003,China; 2.The Institute of North Electronic Equipment,Beijing 100083,China)
Abstract: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.
Keywords:public key cryptography  elliptic curve cryptosystems  fault attacks  point multiplication  sliding window method  zero block failure
本文献已被 CNKI 等数据库收录!
点击此处可从《通信学报》浏览原始摘要信息
点击此处可从《通信学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号