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

对两个基于混沌的序列密码算法的分析
引用本文:金晨辉,高海英.对两个基于混沌的序列密码算法的分析[J].电子学报,2004,32(7):1066-1070.
作者姓名:金晨辉  高海英
作者单位:解放军信息工程大学电子技术学院,河南郑州 450004
基金项目:河南省杰出青年科学基金
摘    要:本文指出"混沌非线性反馈密码序列的理论设计和有限精度实现"和"一类新型混沌反馈密码序列的理论设计"两文基于混沌设计的两个序列密码算法产生的乱数序列的前若干值对密钥的变化并不敏感,据此在已知混沌变换的条件下,可以利用已知明文采取先攻击高位密钥再攻击低位密钥的方法对这两个密码算法进行分割攻击.本文还提出了在正确密钥的分布已知条件下使平均计算复杂性达到最小的穷举攻击算法,并将它与分割攻击方法结合,提出了对上述两个密码算法的优化分割攻击方案,并分析了这两个攻击方案的计算复杂性和成功率.

关 键 词:混沌序列  序列密码  分割攻击  穷举攻击  优化的分割攻击  
文章编号:0372-2112(2004)07-1066-05
收稿时间:2002-06-28

Analysis of Two Stream Ciphers Based on Chaos
JIN Chen hui,GAO Hai ying.Analysis of Two Stream Ciphers Based on Chaos[J].Acta Electronica Sinica,2004,32(7):1066-1070.
Authors:JIN Chen hui  GAO Hai ying
Affiliation:Electronic Technology Institute,PLA Information Engineering University,Zhengzhou,Henan 450004,China
Abstract:It is pointed out that the two stream ciphers proposed respectively in "Generating nonlinear feedback stream ciphers via chaotic systems" and in "The theoretical design for a class of new chaotic feedback stream ciphers" have the property that the frontal values of the output sequences of the two stream ciphers are not sensitive to the least significant bits of the key.So they can be attacked effectively by the divide-and-conquer attack,which attacks the most significant bits of key at first and the least significant bits of key secondly,with the known chaotic transformations and known plaintexts.An optimal exhaustive attack with the minimum computing complexity is proposed under the condition that the distribution of the key is known.Furthermore,an improved divide-and-conquer attack is proposed and its computing complexity and success probability is analyzed.
Keywords:chaotic sequence  stream cipher  divide  and  conquer attack  exhaustive attacking  improved divide  and  conquer attack
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《电子学报》浏览原始摘要信息
点击此处可从《电子学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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