F_p上p^n-周期序列k-错线性复杂度的期望

On the Expected Value of the k-Error Linear Complexity for a p^n-Periodic Sequence over F_p

线性复杂度和k-错线性复杂度是衡量密钥流序列随机性的两个重要标准。文章运用广义Chan-Games算法,研究了Fp上pn-周期序列k-错线性复杂度,给出其k-错线性复杂度期望的上、下界。

Linear complexity and k-error linear complexity of the stream cipher are two important standards to scale the randomicity of key sequences. For a p^n-periodic sequence over Fp, the upper and lower bounds for the expect value of k-error linear complexity are provided by Generalized Chan- Games algorithm.