k Positions Error Spectrum of Linear Complexity for Periodic Sequences
Ming Su · Jisuanji gongcheng · 2007
The linear complexity of periodic sequences is an important security index of stream cipher systems.It is noticeable that the linear complexity of a periodic sequence will be influenced when the values in some positions change.According to this,this paper proposes the concept of the k positions error spectrum to trace this influence on the linear complexity.Especially for 2n-periodic binary sequences,the periods of the 1position error spectrum for this kind of sequences are discovered and the number of the sequences with the same characteristic of the spectrum is given.These results are generalized to pn-periodic sequences over Fp.