Elsevier

Information Processing Letters

Volume 96, Issue 5, 16 December 2005, Pages 175-177
Information Processing Letters

On the linear complexity of bounded integer sequences over different moduli

https://doi.org/10.1016/j.ipl.2005.08.004Get rights and content

Abstract

We give a relation between the linear complexity over the integers and over the residue rings modulo m of a bounded integer sequence. This relation can be used to obtain a variety of new results for several sequences widely studied in the literature. In particular we apply it to Sidelnikov sequences.

References (12)

  • W. Meidl et al.

    On the linear complexity profile of some new explicit nonlinear pseudorandom number generators

    J. Complexity

    (2004)
  • T.W. Cusick et al.

    Stream Ciphers and Number Theory

    (2003)
  • M. Garaev, F. Luca, I.E. Shparlinski, A. Winterhof, On the linear complexity over Fp of Sidelnikov sequences, Preprint,...
  • T. Helleseth et al.

    Linear complexity over Fp and trace representation of Lempel–Cohn–Eastman sequences

    IEEE Trans. Inform. Theory

    (2003)
  • T. Helleseth et al.

    Linear complexity over Fp of Sidel'nikov sequences

    IEEE Trans. Inform. Theory

    (2004)
  • T. Helleseth et al.

    On binary sequences with period n=pm1 with optimal autocorrelation

There are more references available in the full text version of this article.

Cited by (6)

View full text