互联网 qkzz.net
全刊杂志网:首页 > 女性 > 文章正文
刊社推荐

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


  摘 要:分析了徐淑奖等人提出的一类混沌迭代加密算法的安全性,发现该加密算法由混沌映射产生的量化序列的前几个量化值对混沌初始值低位比特的变化不够敏感,据此提出了在选择明文攻击条件下由量化序列恢复混沌初始值的先攻击高位比特再攻击低位比特的分割攻击方法。在参数r= 4已知且密钥长度为64 bit的条件下,分割攻击算法仅需1个选择明密对,其成功率为0.930 5,计算复杂性约为219.7,存储复杂性约为211.6。

  关键词:密码学; 混沌密码; 密码分析; 分割攻击

  中图分类号:TP309.7文献标志码:A

  文章编号:1001-3695(2010)07-2625-04

  doi:10.3969/j.issn.1001-3695.2010.07.063

  Divide-and-conquer attack on XW chaotic cipher

  WANG Hai-ming, Li Ming, JIN Chen-hui

  (Institute of Electronic Technology, PLA Information Engineering University, Zhengzhou 450004, China)

  Abstract:For a block cryptosystem based on iterating chaotic map proposed by Xu Shu-jiang et al., this paper found that the first several bits in quantified sequence generated by chaotic sequence were not sensitive to the least significant bits of chaos initial state. Under the chosen plaintexts attack, based on this information leakage, this paper proposed a divide-and-conquer attack to recover the chaos initial state from the consecutive segment of quantified sequence via attacking the higher significant bits first and the lower significant bits second. When the parameter r= 4 and the length of key is of 64-bit length, the success probability of the divide-and-conquer attack is 0.930 5 and the computational complexity is about 219.7, the memory complexity is about 211.6 and the data complexity is 1 chosen plaintext-ciphertext pair.

......
很抱歉,暂无全文,若需要阅读全文或喜欢本刊物请联系《计算机应用研究》杂志社购买。
欢迎作者提供全文,请点击编辑
分享:
 

了解更多资讯,请关注“木兰百花园”
分享:
 
精彩图文


关键字
支持中国杂志产业发展,请购买、订阅纸质杂志,欢迎杂志社提供过刊、样刊及电子版。
关于我们 | 网站声明 | 刊社管理 | 网站地图 | 联系方式 | 中图分类法 | RSS 2.0订阅 | IP查询
全刊杂志赏析网 2017