作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2009, Vol. 35 ›› Issue (19): 148-150. doi: 10.3969/j.issn.1000-3428.2009.19.049

• 安全技术 • 上一篇    下一篇

对DLWX混沌密码算法的分割攻击

张 斌,李 明,金晨辉   

  1. (解放军信息工程大学电子技术学院,郑州 450004)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-10-05 发布日期:2009-10-05

Divide-and-Conquer Attack on DLWX Chaotic Cipher Algorithm

ZHANG Bin, LI Ming, JIN Chen-hui   

  1. (Institute of Electronic Technology, PLA University of Information Engineering, Zhengzhou 450004)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-10-05 Published:2009-10-05

摘要: 分析基于混沌的视频加密算法的安全性,该算法是由混沌映射构造的移位密码,给出对该移位密码的攻击方法并且恢复出混沌映射产生的量化序列。混沌映射产生的量化序列具有前几个量化值对混沌初始值的低位比特变化不够敏感的性质,提出由量化序列恢复混沌初始值的分割攻击方法。在密钥长度为56 bit并且参数k=4和r=4的条件下,分割攻击算法的成功率为0.917 1,计算复杂性约为 ,存储复杂性约为 。

关键词: 混沌密码, 密码分析, 分割攻击, 已知明文攻击

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.

Key words: chaotic cipher, cryptanalysis, divide-and-conquer attack, known plaintext attack

中图分类号: