The expectation and variance of the joint linear complexity of random periodic multisequences

The linear complexity of sequences is one of the important security measures for stream cipher systems. Recently, in the study of vectorized stream cipher systems, the joint linear complexity of multisequences has been investigated. By using the generalized discrete Fourier transform for multisequences, Meidl and Niederreiter determined the expectation of the joint linear complexity of random N-periodic multisequences explicitly. In this paper, we study the expectation and variance of the joint linear complexity of random periodic multisequences. Several new lower bounds on the expectation of the joint linear complexity of random periodic multisequences are given. These new lower bounds improve on the previously known lower bounds on the expectation of the joint linear complexity of random periodic multisequences. By further developing the method of Meidl and Niederreiter, we derive a general formula and a general upper bound for the variance of the joint linear complexity of random N-periodic multisequences. These results generalize the formula and upper bound of Dai and Yang for the variance of the linear complexity of random periodic sequences. Moreover, we determine the variance of the joint linear complexity of random periodic multisequences with certain periods.

[1]  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.

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

[3]  Fred Piper,et al.  Stream Ciphers , 1982, EUROCRYPT.

[4]  Gui Liang Feng,et al.  A generalized Euclidean algorithm for multisequence shift-register synthesis , 1989, IEEE Trans. Inf. Theory.

[5]  N. Kamiya.  On Multisequence Shift Register Synthesis and Generalized-Minimum-Distance Decoding of Reed-Solomon Codes , 1995 .

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

[7]  Rudolf Lide,et al.  Finite fields , 1983 .

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

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

[10]  C. Ding,et al.  Stream Ciphers and Number Theory , 1998 .

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

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

[13]  Gui Liang Feng,et al.  A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes , 1991, IEEE Trans. Inf. Theory.

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

[15]  K. Conrad,et al.  Finite Fields , 2018, Series and Products in the Development of Mathematics.

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

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

[18]  Zongduo Dai,et al.  Linear Complexity of Periodically Repeated Random Sequences , 1991, EUROCRYPT.

[19]  James L. Massey,et al.  A Fourier Transform Approach to the Linear Complexity of Nonlinearly Filtered Sequences , 1994, CRYPTO.

[20]  Anne Canteaut.  Linear Complexity , 2005, Encyclopedia of Cryptography and Security.

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

[22]  Chaoping Xing.  Multi-sequences with Almost Perfect Linear Complexity Profile and Function Fields over Finite Fields , 2000, J. Complex..

[23]  G. Hardy,et al.  An Introduction to the Theory of Numbers , 1938 .

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

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