Counting Functions and Expected Values for the k-Error Linear Complexity

In cryptology, complexity measures for sequences of elements of a finite field, such as the linear complexity, play an important role. Cryptographically strong sequences or finite strings must not only have a large linear complexity, but also the change of a few terms must not cause a significant decrease of the linear complexity. This requirement leads to the concept of the k-error linear complexity Ln,k(S) of a string S with terms in a finite field Fq and length n. In this article, bounds for the number of strings S of length n with k-error linear complexity Ln,k(S)=c or Ln,k(S)?c for a given c are established. Under certain conditions on n, k, and c, exact formulas are also determined. On the basis of these results we derive bounds for the expected value of Ln,k(S) for random strings S of length n.

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

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

[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]  H. Niederreiter,et al.  Counting Functions and Expected Values in the Stability Theory of Stream Ciphers , 1998, SETA.

[5]  Harald Niederreiter,et al.  The Linear Complexity Profile and the Jump Complexity of Keystream Sequences , 1991, EUROCRYPT.

[6]  Satoshi Uehara,et al.  A New Algorithm for the k -Error Linear Complexity of Sequences over GF(p m) with Period p n , 1998, SETA.

[7]  Gustavus J. Simmons,et al.  Contemporary Cryptology: The Science of Information Integrity , 1994 .

[8]  Ivan Bjerre Damgård,et al.  Advances in Cryptology — EUROCRYPT ’90 , 2001, Lecture Notes in Computer Science.

[9]  Satoshi Uehara,et al.  An Algorithm for thek-Error Linear Complexity of Sequences over GF(pm) with Period pn, pa Prime , 1999, Inf. Comput..

[10]  Harald Niederreiter,et al.  Introduction to finite fields and their applications: Preface , 1994 .

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

[12]  Fred G. Gustavson,et al.  Analysis of the Berlekamp-Massey Linear Feedback Shift-Register Synthesis Algorithm , 1976, IBM J. Res. Dev..

[13]  Tor Helleseth,et al.  Sequences and their Applications , 1999, Discrete Mathematics and Theoretical Computer Science.