线性复杂度为2^n-2^m的2^n周期二元序列的4（或5）错误序列

The 4 （or 5）-error sequences of 2n -periodic binary sequences with linear complexity 2n - 2m

线性复杂度和k错误线性复杂度是衡量密钥流序列随机性的两个重要标准.一条安全性强的序列不仅要有较高的线性复杂度和k错线误性复杂度,对数值较小的k,还应有较少的k错误序列.对k=4,5,讨论了线性复杂度为2n-2m的2n周期二元序列s的k错误序列的个数.

The linear complexity and k-error linear complexity of the stream cipher are two importanl standards to scale the randomicity of key sequences. Besides having large linear complexity and k-erroi linear complexity, cryptographically strong sequences should also have fewer error sequences for small k. For k=4,5, the number of k-error sequences of 2^n-periodic binary sequence with linear complexity 2^n-2m was＇discussed.