2^n周期平衡二元序列的8错线性复杂度

摘要

线性复杂度和k错线性复杂度分别是流密码密钥流序列强度和稳定性的重要度量指标.通过研究周期为2n的二元序列线性复杂度,基于Games-Chan算法,讨论了线性复杂度小于2n的2n-周期二元序列的8错线性复杂度的分布,给出其对应8错线性复杂度为2n-2,2n-3,2n-4和2n-3-2n-j的原始二元序列计数公式.%The linear complexity and the k-error linear complexity of a sequence have been used as the important measurement of keystream sequence strength.By studying linear complexity of binary sequences with period 2n,based on Games-Chan algorithm,8-error linear complexity distribution of 2n-periodic binary sequences with linear complexity less than 2n is discussed.The complete counting functions on 2n-periodic balanced binary sequences with 8-error linear complexity 2n-2,2n-3,2n-4 and 2n-3-2n-j are derived respectively.