Andrew Klapper, 779A Anderson Hall, Dept. of Computer Science, University of Kentucky, Lexington, KY, 40506-0046, klapper at cs.uky.edu. www.cs.uky.edu/~klapper/andy.html
Agnes Chan, Northeastern University
Mark Goresky, Institute for Advanced Study
Abstract Pseudorandom binary sequences with high linear complexity and low correlation function values are sought in many applications of modern communication systems. A new family of pseudorandom binary sequences, cascaded GMW sequences, is constructed. These sequences are shown to share many desirable correlation properties with the GMW sequences of Gordon, Mills, and Welch, for example high shifted autocorrelation values and, in many cases, three valued cross-correlation values with m-sequences. It is shown, moreover, that in many cases the linear complexities of cascaded GMW sequences are far greater than those of GMW sequences.
Index Terms -- Pseudorandom sequences, linear complexity, cross-correlations, cryptography, GMW sequences.