Binary sequences derived from ML-sequences over rings I: Periods and minimal polynomials

We derive pseudorandom binary sequences from maximal length sequences over the integral residue rings. We prove that these derived binary sequences have guaranteed large periods, and we also obtain upper bounds on their minimal polynomials in the sense of the partial order defined by divisibility.

[1]  Alan M. Frieze,et al.  Reconstructing Truncated Integer Variables Satisfying Linear Congruences , 1988, SIAM J. Comput..

[2]  Morgan Ward,et al.  The arithmetical theory of linear recurring series , 1933 .

[3]  Neal Zierler,et al.  Products of linear recurring sequences , 1973 .

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

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