基于线性多项式重构的快速相关攻击算法研究

Research on the Algorithm of Fast Correlation Attacks through Reconstruction of Linear Polynomials

T.Johansson和E.Joensson提出了不同于二元对称信道（BSC）模型的线性多项式重构的快速相关攻击算法。本文对该算法进行了改进，改进后的算法的计算复杂度比原算法降低了一半以上。

T. Johansson and E Jonsson proposed an algorithm of fast correlation attacks through reconstruction of linear polynomials, which differs from Binary Symmetry Channel Model. The algorithm is improved in this paper. The complexity of the improved algorithm is less than half of the primal one.