Maximum-Order Complexity and Correlation Measures

We estimate the maximum-order complexity of a binary sequence in terms of its correlation measures. Roughly speaking, we show that any sequence with small correlation measure up to a sufficiently large order k cannot have very small maximum-order complexity.

[1]  Arne Winterhof,et al.  Some notes on the two-prime generator of order 2 , 2005, IEEE Transactions on Information Theory.

[2]  András Sárközy,et al.  Construction of large families of pseudorandom binary sequences , 2004 .

[3]  Yoshiharu Kohayakawa,et al.  Measures of pseudorandomness for finite sequences: typical values , 2007 .

[4]  László Mérai,et al.  Improving results on the pseudorandomness of sequences generated via the additive order of a finite field , 2015, Discret. Math..

[5]  Arne Winterhof,et al.  LINEAR COMPLEXITY AND RELATED COMPLEXITY MEASURES , 2010 .

[6]  Wilfried Meidl,et al.  Linear complexity of sequences and multisequences , 2013, Handbook of Finite Fields.

[7]  Cees J. A. Jansen.  The Maximum Order Complexity of Sequence Ensembles , 1991, EUROCRYPT.

[8]  Harald Niederreiter,et al.  Sequences With High Nonlinear Complexity , 2013, IEEE Transactions on Information Theory.

[9]  Qiang Wang,et al.  Linear complexity profile and correlation measure of interleaved sequences , 2015, Cryptography and Communications.

[10]  Gergely Bérczi.  On finite pseudorandom sequences of k symbols , 2003, Period. Math. Hung..

[11]  Igor E. Shparlinski,et al.  Cryptographic applications of analytic number theory - complexity lower bounds and pseudorandomness , 2003, Progress in computer science and applied logic.

[12]  András Sárközy,et al.  Modular constructions of pseudorandom binary sequences with composite moduli , 2005, Period. Math. Hung..

[13]  I. Shparlinski.  Cryptographic Applications of Analytic Number Theory , 2003 .

[14]  András Sárközy,et al.  Measures of pseudorandomness for binary sequences constructed using finite fields , 2009, Discret. Math..

[15]  András Sárközy,et al.  On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol , 1997 .

[16]  Christian Mauduit,et al.  On Finite Pseudorandom Binary Sequences: II. The Champernowne, Rudin–Shapiro, and Thue–Morse Sequences, A Further Construction , 1998 .

[17]  Arne Winterhof,et al.  Linear complexity profile of m-ary pseudorandom sequences with small correlation measure* , 2009 .

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

[19]  V. Rödl,et al.  MEASURES OF PSEUDORANDOMNESS FOR FINITE SEQUENCES: MINIMUM AND TYPICAL VALUES , 2003 .

[20]  C.J.A. Jansen,et al.  Investigations on nonlinear streamcipher systems: construction and evaluation methods , 1989 .

[21]  H. Stichtenoth,et al.  Topics in Geometry, Coding Theory and Cryptography , 2010 .

[22]  Arne Winterhof,et al.  Linear complexity profile of binary sequences with small correlation measure , 2006, Period. Math. Hung..

[23]  Katalin Gyarmati.  Measures of Pseudorandomness , 2013, Finite Fields and Their Applications.