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

对DLWX混沌密码算法的分割攻击
引用本文:张斌,李明,金晨辉. 对DLWX混沌密码算法的分割攻击[J]. 计算机工程, 2009, 35(19): 148-150
作者姓名:张斌  李明  金晨辉
作者单位:解放军信息工程大学电子技术学院,郑州,450004;解放军信息工程大学电子技术学院,郑州,450004;解放军信息工程大学电子技术学院,郑州,450004
基金项目:河南省杰出青年科学基金资助项目 
摘    要:分析基于混沌的视频加密算法的安全性,该算法是由混沌映射构造的移位密码,给出对该移位密码的攻击方法并且恢复出混沌映射产生的量化序列。混沌映射产生的量化序列具有前几个量化值对混沌初始值的低位比特变化不够敏感的性质,提出由量化序列恢复混沌初始值的分割攻击方法。在密钥长度为56bit并且参数k=4和r=4的条件下,分割攻击算法的成功率为0.9171,计算复杂性约为2^28,存储复杂性约为2^20。

关 键 词:混沌密码  密码分析  分割攻击  已知明文攻击
修稿时间: 

Divide-and-Conquer Attack on DLWX Chaotic Cipher Algorithm
ZHANG Bin,LI Ming,JIN Chen-hui. Divide-and-Conquer Attack on DLWX Chaotic Cipher Algorithm[J]. Computer Engineering, 2009, 35(19): 148-150
Authors:ZHANG Bin  LI Ming  JIN Chen-hui
Affiliation:(Institute of Electronic Technology, PLA University of Information Engineering, Zhengzhou 450004)
Abstract:A chaotic cipher is analyzed. This cipher is a shift cipher constructed by chaotic mapping. A known plaintext attack on the shift cipher is presented to recover the quantified sequence generated by chaotic mapping. The first several bits of quantified sequence are not sensitive to the least significant bits of chaos initial state. A divide-and-conquer attack to recover the chaos initial state from the quantified sequence is proposed. When the parameter k=4, r=4 and the length of key is 56 bit, the success probability of the divide-and-conquer attack is 0.917 1, the computational complexity is about 228, and the memory complexity is about 220.
Keywords:chaotic cipher  cryptanalysis  divide-and-conquer attack  known plaintext attack
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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