论文部分内容阅读
线性复杂度和k错线性复杂度是度量密钥流序列的密码强度的重要指标。通过研究周期为2n的二元序列线性复杂度,提出将k错线性复杂度的计算转化为求Hamming重量最小的错误序列。基于Games-Chan算法,讨论了线性复杂度为2n-1的2n周期二元序列的4错线性复杂度分布情况。在大多数情况下,给出了对应4错线性复杂度序列的计数公式。
Linear complexity and k-error linear complexity are important indicators of cryptographic strength of keystream sequences. By studying the linear complexity of binary sequence with 2n period, it is proposed that the calculation of k-error linear complexity be transformed into the error sequence with the lowest Hamming weight. Based on the Games-Chan algorithm, the 4-error linear complexity distributions of 2n-period binary sequences with linear complexity 2n-1 are discussed. In most cases, the formula of counting corresponding to the 4-error linear complexity sequence is given.