On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes

Abstract We suggest a method to compute the linear complexity of binary periodic sequences formed on the basis of biquadratic and sextic residue classes through the use of expansion of the sequence period into a sum of squares of integers. The values of the sequence polynomial are computed with the use of cyclotomic numbers of orders four and six.

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

[2]  Albert Leon Whiteman,et al.  The cyclotomic numbers of order twenty , 1960 .

[3]  Jon-Lark Kim,et al.  New self-dual codes over GF(4) with the highest known minimum weights , 2001, IEEE Trans. Inf. Theory.

[4]  Guang Gong,et al.  Public-key cryptosystems based on cubic finite field extensions , 1999, IEEE Trans. Inf. Theory.

[5]  Hong-Yeop Song,et al.  On the linear complexity of Hall's sextic residue sequences , 2001, IEEE Trans. Inf. Theory.

[6]  Cunsheng Ding,et al.  Several classes of binary sequences with three-level autocorrelation , 1999, IEEE Trans. Inf. Theory.

[7]  Cunsheng Ding,et al.  On the Linear Complexity of Legendre Sequences , 1998, IEEE Trans. Inf. Theory.