一类周期序列的3错线性复杂度期望的界

Bounds of the expected value of 3-error linear complexity of a specific periodic sequence

周期序列的线性复杂度和k错线性复杂度是衡量流密码系统的安全性能的重要指标;文章主要研究二元域F2上的线性复杂度等于2n的2n-周期序列,对这一类周期序列的3错线性复杂度值的分布进行了分析,同时给出了这类周期序列的3错线性复杂度期望的上界和下界。

Linear complexity and k -error linear complexity of periodic sequences are important security indices of stream cipher systems. For the 2＂ -periodic binary sequences with linear complexity 2＂ , the distribution of the 3-error linear complexity of the specific periodic sequences is researched, and the upper and lower bounds of the expected value of the 3-error linear complexity of the specific periodic sequences are established.