摘要
分析了徐淑奖等人提出的一类混沌迭代加密算法的安全性,发现该加密算法由混沌映射产生的量化序列的前几个量化值对混沌初始值低位比特的变化不够敏感,据此提出了在选择明文攻击条件下由量化序列恢复混沌初始值的先攻击高位比特再攻击低位比特的分割攻击方法。在参数r=4已知且密钥长度为64 bit的条件下,分割攻击算法仅需1个选择明密对,其成功率为0.930 5,计算复杂性约为219.7,存储复杂性约为211.6。
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 219.7,the memory complexity is about 211.6 and the data complexity is 1 chosen plaintext-ciphertext pair.
出处
《计算机应用研究》
CSCD
北大核心
2010年第7期2625-2628,共4页
Application Research of Computers
基金
河南省杰出青年科学基金资助项目(0312001800)
关键词
密码学
混沌密码
密码分析
分割攻击
cryptography
chaotic cipher
cryptanalysis
divide-and-conquer attack
