Error linear complexity measures for multisequences

Complexity measures for sequences over finite fields, such as the linear complexity and the k-error linear complexity, play an important role in cryptology. Recent developments in stream ciphers point towards an interest in word-based stream ciphers, which require the study of the complexity of multisequences. We introduce various options for error linear complexity measures for multisequences. For finite multisequences as well as for periodic multisequences with prime period, we present formulas for the number of multisequences with given error linear complexity for several cases, and we present lower bounds for the expected error linear complexity.

[1]  Philip Hawkes,et al.  Exploiting Multiples of the Connection Polynomial in Word-Oriented Stream Ciphers , 2000, ASIACRYPT.

[2]  Shojiro Sakata,et al.  Extension of the Berlekamp-Massey Algorithm to N Dimensions , 1990, Inf. Comput..

[3]  Zongduo Dai,et al.  Asymptotic Behavior of Normalized Linear Complexity of Multi-sequences , 2004, SETA.

[4]  Ming Su,et al.  The expectation and variance of the joint linear complexity of random periodic multisequences , 2005, J. Complex..

[5]  Elwyn R. Berlekamp,et al.  Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[6]  Yue-fei Zhu,et al.  On the Lattice Basis Reduction Multisequence Synthesis Algorithm , 2004, IEEE Trans. Inf. Theory.

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

[8]  Harald Niederreiter,et al.  Linear Complexity and Related Complexity Measures for Sequences , 2003, INDOCRYPT.

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

[10]  David Joyner.  Coding Theory and Cryptography , 2000 .

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

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

[13]  Xiutao Feng,et al.  Expected Value of the Linear Complexity of Two-Dimensional Binary Sequences , 2004, SETA.

[14]  Ed Dawson,et al.  Analysis and Design Issues for Synchronous Stream Ciphers , 2002 .

[15]  Harald Niederreiter,et al.  The expected value of the joint linear complexity of periodic multisequences , 2003, J. Complex..

[16]  Harald Niederreiter.  The Probabilistic Theory of the Joint Linear Complexity of Multisequences , 2006, SETA.

[17]  Harald Niederreiter,et al.  Proof of a Conjecture on the Joint Linear Complexity Profile of Multisequences , 2005, INDOCRYPT.

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

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

[20]  Harald Niederreiter,et al.  Enumeration results on the joint linear complexity of multisequences , 2006, Finite Fields Their Appl..

[21]  Harald Niederreiter,et al.  The Asymptotic Behavior of the Joint Linear Complexity Profile of Multisequences , 2007 .

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

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