摘要
研究了文献[2]提出的基于混沌伪随机序列设计的流密码算法,分析了其信息泄漏规律。利用该算法所产生的乱数序列具有前几个比特对密钥的低位比特变化不够敏感的性质,提出了能够有效降低该流密码算法密钥熵的分割攻击方法。在密钥长度为128比特时,该分割攻击方法的成功率为0.9498,平均计算复杂性至多为279。
A chaotic stream cipher, presented by reference [2], is studied. It is found that the firstly several key stream bits are not sensitive to the least significant bits of the key. A divide-and-conquer attack on the stream cipher which could decrease entropy of the key efficiently is proposed, When the length of key is 128, the success rate of the divide-and-conquer attack is 0.9498 and the average complexity is less than 279.
出处
《计算机工程与设计》
CSCD
北大核心
2008年第15期3831-3833,3837,共4页
Computer Engineering and Design
基金
国家自然科学基金项目(60503012)