k-error linear complexity of 2~n-periodic sequences with linear complexity 2~n-2~m
Shixin Zhu · Jisuanji yingyong yanjiu · 2010
Linear complexity and k-error linear complexity are two important standards to scale the randomicity of key sequences. For a 2n-periodic binary sequence with linear complexity 2n-2m. This paper obtained all the possible values of the k-error linear complexity using Chan-Games algorithm, LC_ k ( s )=0 or 2 n -2 m -2 r+1 +c,2 n -2 r+1 +c. The result presented of stream cipher is so important that it can be used to analyze the safety of periodic key sequences more deeply.