首页 | 官方网站   微博 | 高级检索  
     

对混沌序列密码的相关密钥攻击
引用本文:金晨辉,杨阳,祁传达.对混沌序列密码的相关密钥攻击[J].电子与信息学报,2006,28(3):410-414.
作者姓名:金晨辉  杨阳  祁传达
作者单位:解放军信息工程大学电子技术学院,郑州,450004
基金项目:河南省杰出青年科学基金
摘    要:该文首次提出了对混沌序列密码的相关密钥攻击方法。该方法将线性密码分析的思想与对混沌密码的分割攻击方法相结合,利用多个相关密钥产生的乱数序列对混沌密码实施分割攻击,从而大大提高了分割攻击方法的效率。克服了当混沌密码吻合度分布泄漏的信息较小或密钥规模较大时,分割攻击方法难以将攻击方案的计算复杂性降低在可实现范围内的局限。作为例子,该文实现了对具有64bit密钥的ZLL混沌密码的相关密钥攻击,在主频为2.5GHz的Pentium4-PC机上,整个攻击时间平均为154s,成功率为0.96。

关 键 词:混沌密码  相关密钥攻击  ZLL混沌密码算法  分割攻击  已知明文攻击
文章编号:1009-5896(2006)03-0410-05
收稿时间:2005-01-26
修稿时间:2005-08-04

A Related-Key Attack on Chaotic Stream Ciphers
Jin Chen-hui,Yang Yang,Qi Chuan-da.A Related-Key Attack on Chaotic Stream Ciphers[J].Journal of Electronics & Information Technology,2006,28(3):410-414.
Authors:Jin Chen-hui  Yang Yang  Qi Chuan-da
Affiliation:Electronic Technology Institute, PLA Information Engineering University, Zhengzhou 450004, China
Abstract:In this paper the authors first present a related-key attack on chaotic stream ciphers. Combining the idea of linear cryptanalysis and divide-and-conquer attack on chaotic ciphers, the attack uses the output sequences created by multiple related keys, hence enhances the efficiency of divide-and-conquer attacks. The related-key attack breaks the confinements that it is difficult to reduce the computing complexity of divide-and-conquer attacks to a realizable range when the information amount leaked by the distribution of coincidence degree of a chaotic cipher is small or the size of key is large. As an example, the related-key attack on the ZLL chaotic cipher with 64 bits key on a Pentium 4/2.5GHz personal computer was realized and it took about 154s to recover key at a success rate 0.96.
Keywords:Chaotic cipher  Related-key attack  ZLL chaotic cipher algorithm  Divide-and-conquer attack  Known plain texts attack
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《电子与信息学报》浏览原始摘要信息
点击此处可从《电子与信息学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号