关于序列密码相关攻击的注记

About correlation attack on sequence cipher

分析了序列密码的快速相关攻击算法A和算法B,计算出算法A和B中门限,并对两种门限的计算方法进行了比较.门限的计算降低了快速相关攻击算法的计算复杂度,扩大了算法的应用范围.

Analysis algorithm A and B of fast correlation attack, the expression of theshold in algorithm A and B is given, and the compare of computational methods is shown finally. Computation of thresholds decreases the computing complexity of fast correlation attack, and extends the application of algorithms.