对比特搜索生成器的猜测确定攻击.pdfVIP

第 32 卷第 12 期 电 子 与 信 息 学 报 Vol.32No.12 2010 年 12 月 Journal of Electronics Information Technology Dec. 2010 对比特搜索生成器的猜测确定攻击 贾艳艳 胡予濮 高军涛 (西安电子科技大学计算机网络与信息安全教育部重点实验室 西安 710071) 摘 要：针对具有低重量反馈多项式的比特搜索生成器(BSG)，利用猜测确定攻击的思想提出了一种快速密钥恢复 攻击。该算法基于 BSG 序列的差分构造特点，首先由截获的密钥流恢复出候选差分序列，然后用反馈多项式对候 选差分序列进行校验，以此减少需要求解的 L 维线性方程系统的数量，从而大大减少了算法所需的复杂度。理论 分析和仿真结果表明，对于反馈多项式的重量小于 10 的 BSG，该算法明显优于现有的攻击方法。特别地当反馈多 项式的重量为 3 时，该算法能够将最好的攻击结果 O(L320.5L)降低到 O(L20.5L)。 关键词：流密码；密码分析学；比特搜索生成器；猜测确定攻击；复杂度分析 中图分类号：TN918.1 文献标识码： A 文章编号：1009-5896(2010)12-2925-05 DOI: 10.3724/SP.J.1146.2010.00030 Guess-and-determine Attack on the Bit-search Generator Jia Yan-yan Hu Yu-pu Gao Jun-tao (Key Laboratory of Computer Networks and Information Security, Xidian University, Xi’an 710071, China) Abstract: For the Bit-Search-Generators (BSG) with a low weight feedback polynomial, a fast key recovery algorithm is presented using the ideas of the guess-and-determine attack. A candidate differential sequence is recovered firstly from the intercepted keystream sequence based on the differential construction of the BSG sequence. Then the feedback polynomial is used to check the candidate differential sequence, which will reduce the number of the linear equation systems of L dimensions thus to reduce significantly the complexity of the algorithm. Theoretical analysis and simulation experiment results show that, when the weight of the feedback polynomial is less than 10, the complexity of the attack is noticeably better than that of the existing methods. Specially, the attack complexity can be significantly reduce