Computing the error linear complexity spectrum of a binary sequence of period 2n

Binary sequences with high linear complexity are of interest in cryptography. The linear complexity should remain high even when a small number of changes are made to the sequence. The error linear complexity spectrum of a sequence reveals how the linear complexity of the sequence varies as an increasing number of the bits of the sequence are changed. We present an algorithm which computes the error linear complexity for binary sequences of period /spl lscr/=2/sup n/ using O(/spl lscr/(log/spl lscr/)/sup 2/) bit operations. The algorithm generalizes both the Games-Chan (1983) and Stamp-Martin (1993) algorithms, which compute the linear complexity and the k-error linear complexity of a binary sequence of period /spl lscr/=2/sup n/, respectively. We also discuss an application of an extension of our algorithm to decoding a class of linear subcodes of Reed-Muller codes.

[1]  Peter A. Hines.  Characterising the Linear Complexity of Span 1 de Bruijn Sequences over Finite Fields , 1998, J. Comb. Theory, Ser. A.

[2]  Matthew J. B. Robshaw.  On evaluating the linear complexity of a sequence of least period 2n , 1994, Des. Codes Cryptogr..

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

[4]  Cai Mian.  A fast algorithm for determining the linear complexity of a pseudo-random sequence with a period n2~v , 2001 .

[5]  Simon R. Blackburn,et al.  A generalisation of the discrete Fourier transform: determining the minimal polynomial of a periodic sequence , 1994, IEEE Trans. Inf. Theory.

[6]  Satoshi Uehara,et al.  Computation of the k-Error Linear Complexity of Binary Sequences with Period 2n , 1996, ASIAN.

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

[8]  Daniel J. Costello,et al.  Polynomial weights and code constructions , 1973, IEEE Trans. Inf. Theory.

[9]  Kenneth G. Paterson,et al.  Permutation Polynomials, de Bruijn Sequences, and Linear Complexity , 1996, J. Comb. Theory, Ser. A.

[10]  Tuvi Etzion,et al.  Constructions for perfect maps and pseudorandom arrays , 1988, IEEE Trans. Inf. Theory.

[11]  Tuvi Etzion,et al.  Construction of de Bruijn sequences of minimal complexity , 1984, IEEE Trans. Inf. Theory.

[12]  Cunsheng Ding,et al.  Lower Bounds on the Weight Complexities of Cascaded Binary Sequences , 1990, AUSCRYPT.

[13]  Kenneth G. Paterson.  Perfect maps , 1994, IEEE Trans. Inf. Theory.

[14]  Kaoru Kurosawa,et al.  A relationship between linear complexity and kapa-error linear complexity , 2000, IEEE Trans. Inf. Theory.

[15]  James L. Massey,et al.  Linear Complexity of Periodic Sequences: A General Theory , 1996, CRYPTO.

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

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

[18]  Richard A. Games,et al.  On the Complexities of de Bruijn Sequences , 1982, J. Comb. Theory, Ser. A.

[19]  James L. Massey,et al.  Shift-register synthesis and BCH decoding , 1969, IEEE Trans. Inf. Theory.

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

[21]  Peter A. Hines.  On the Minimum Linear Complexity of de Bruijn Sequences over Non-prime Finite Fields , 1999, J. Comb. Theory, Ser. A.