On the Second Descent Points for the K-Error Linear Complexity of 2n-Periodic Binary Sequences

In this paper, a constructive approach for determining CELCS (critical error linear complexity spectrum) for the kerror linear complexity distribution of 2-periodic binary sequences is developed via the sieve method and Games-Chan algorithm. Accordingly, the second descent point (critical point) distribution of the k-error linear complexity for 2-periodic binary sequences is characterized. As a by product, it is proved that the maximum k-error linear complexity is 2n-(2l-1) over all 2-periodic binary sequences, where 2l-1<=k < 2l and l < n. With these results, some work by Niu et al. are proved to be incorrect. Keywords-periodic sequence; linear complexity; k-error linear complexity; k-error linear complexity distribution

[1]  Wanquan Liu,et al.  Characterization of the Third Descent Points for the k-error Linear Complexity of 2^n 2 n -periodic Binary Sequences , 2015, ICICS.

[2]  Mingjun Xin,et al.  The Research and Analysis of the Excellent 2 n Periodic Binary Sequence Based on Cat Swarm Optimization: The Research and Analysis of the Excellent 2 n Periodic Binary Sequence Based on Cat Swarm Optimization , 2014 .

[3]  Wanquan Liu,et al.  On the $k$-error linear complexity for $2^n$-periodic binary sequences via Cube Theory , 2013, ArXiv.

[4]  Wanquan Liu,et al.  The \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$k$$\end{document}-error linear complexity distribution for \docume , 2013, Designs, Codes and Cryptography.

[5]  R. A. Rueppel.  Analysis and Design of Stream Ciphers , 2012 .

[6]  Ramakanth Kavuluru,et al.  Characterization of 2n-periodic binary sequences with fixed 2-error or 3-error linear complexity , 2009, Des. Codes Cryptogr..

[7]  Kenneth G. Paterson,et al.  Properties of the Error Linear Complexity Spectrum , 2009, IEEE Transactions on Information Theory.

[8]  Jianqin Zhou,et al.  On the k-error linear complexity of sequences with period 2pn over GF(q) , 2008, 2008 International Conference on Computational Intelligence and Security.

[9]  Jin-Ho Chung,et al.  On the k-Error Linear Complexity of pm -Periodic Binary Sequences , 2007, IEEE Trans. Inf. Theory.

[10]  Wenfeng Qi,et al.  The 2-error linear complexity of 2n-periodic binary sequences with linear complexity 2n − 1 , 2007 .

[11]  Harald Niederreiter,et al.  The Characterization of 2n-Periodic Binary Sequences with Fixed 1-Error Linear Complexity , 2006, SETA.

[12]  Wilfried Meidl.  On the stability of 2n-periodic binary sequences , 2005, IEEE Trans. Inf. Theory.

[13]  Wilfried Meidl,et al.  How Many Bits have to be Changed to Decrease the Linear Complexity? , 2004, Des. Codes Cryptogr..

[14]  Nicholas Kolokotronis,et al.  Minimum linear span approximation of binary sequences , 2002, IEEE Trans. Inf. Theory.

[15]  Guozhen Xiao,et al.  A fast algorithm for determining the minimal polynomial where of a sequence with period 2pn over GF(q) , 2002, IEEE Trans. Inf. Theory.

[16]  Kwok-Yan Lam,et al.  A fast algorithm for determining the linear complexity of a sequence with period pn over GF(q) , 2000, IEEE Trans. Inf. Theory.

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

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

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

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

[21]  Jianqin Zhou.  The k-error Linear Complexity Distribution for Periodic Sequences , 2017 .

[22]  Y. Fei,et al.  The Research and Analysis of the Excellent 2n Periodic Binary Sequence Based on Cat Swarm Optimization , 2013 .

[23]  Chang,et al.  On the First and Second Critical Error Linear Complexity of Binary 2^n-periodic Sequences , 2013 .

[24]  Kenneth G. Paterson,et al.  Computing the error linear complexity spectrum of a binary sequence of period 2n , 2003, IEEE Trans. Inf. Theory.

[25]  Guozhen Xiao,et al.  A Fast Algorithm for Determining the Minimal Polynomial of a Sequence With Period Over GF , 2002 .

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

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