论文信息 - On the stability of 2/sup n/-periodic binary sequences

On the stability of 2/sup n/-periodic binary sequences

The k-error linear complexity of a periodic binary sequence is defined to be the smallest linear complexity that can be obtained by changing k or fewer bits per period. This contribution focuses on the case of 2n-periodic binary sequences. For k=1,2, the exact formula for the expected k-error linear complexity of a sequence having maximal possible linear complexity 2n, and the exact formula of the expected 1-error linear complexity of a random 2n-periodic binary sequence are provided. For k ges 2, lower and upper bounds on the expected value of the k-error linear complexity of a random 2n-periodic binary sequence are established

Wilfried Meidl

[1] Richard A. Games,et al. A fast algorithm for determining the complexity of a binary sequence with period 2n , 1983, IEEE Trans. Inf. Theory.

[2] Harald Niederreiter,et al. On the expected value of the linear complexity and the k-error linear complexity ofperiodic sequences , 2002, IEEE Trans. Inf. Theory.

[3] Cunsheng Ding,et al. The Stability Theory of Stream Ciphers , 1991, Lecture Notes in Computer Science.

[4] Harald Niederreiter,et al. Counting Functions and Expected Values for the k-Error Linear Complexity , 2002 .

[5] Harald Niederreiter,et al. Counting Functions and Expected Values in the Stability Theory of Stream Ciphers , 1998, SETA.

[6] Jacobus H. van Lint,et al. Introduction to Coding Theory , 1982 .

[7] Mark Stamp,et al. An algorithm for the k-error linear complexity of binary sequences with period 2n , 1993, IEEE Trans. Inf. Theory.

[8] Kenneth G. Paterson,et al. Computing the error linear complexity spectrum of a binary sequence of period 2n , 2003, IEEE Trans. Inf. Theory.

[9] Harald Niederreiter,et al. Some Computable Complexity Measures for Binary Sequences , 1998, SETA.

[10] Wilfried Meidl,et al. Linear Complexity, k-Error Linear Complexity, and the Discrete Fourier Transform , 2002, J. Complex..

[11] Adi Shamir,et al. Cryptographic Applications of T-Functions , 2003, Selected Areas in Cryptography.

[12] Kaoru Kurosawa,et al. A Relationship Between Linear Complexity and-Error Linear Complexity , 2022 .