On the linear complexity of bounded integer sequences over different moduli
We give a relation between the linear complexity over the integers and over the residue rings modulo in 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. (c) 2005 Elsevier B.V. All rights reserved.
linear complexity sequences residue rings sidelnikov sequences pseudorandom number generators cryptography