Cascaded GMW Sequences

IEEE Transactions on Information Theory

Volumn 39, Issue 1, 1993, Pages 177-183

  Klapper, Andrew ^a   Chan, A H ^a   Goresky, Mark ^a  

^a NORTHEASTERN UNIVERSITY   (United States)

Author keywords

cross correlations; cryptography; GMW sequences; linear complexity; seudorandom sequences

Indexed keywords

COMPUTATIONAL COMPLEXITY; CRYPTOGRAPHY; DIGITAL COMMUNICATION SYSTEMS;

CASCADED GMW SEQUENCES; CROSS CORRELATIONS; LINEAR COMPLEXITY; PSEUDORANDOM BINARY SEQUENCES;

BINARY SEQUENCES;

EID: 0027283207     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.179353     Document Type: Article

References (21)

1. M. Antweiler and L. Bomer, “Complex sequence over GF(pm) with a two-level auticorrelation function and a large linear span,” IEEE Trans. Inform. Theory, vol. 38, pp. 120–130, Jan. 1992.
2. O. Rothaus, “On bent functions,” J. Combinat. Theory, Ser. A, vol. 20, pp. 300–305, 1976.
3. L. Brynielsson, “On the linear complexity of combined shift registers,” in Advances in Cryptology-Eurocrypt ’85, Lecture Notes in Computer Science. Berlin: Springer-Verlag, 1985, vol. 219, pp. 156–166.
4. A. H. Chan and R. Games, “On the linear span of binary sequences from finite geometries, q odd,” Advances in Cryptology-Crypto’86, Lecture Notes in Computer Science. Berlin: Springer-Verlag, 1987, vol. 263, pp. 405–417.
5. R. Games, “Cross-correlation of m-sequences and GMW-sequences with the same primitive polynomial,” Discrete Appl. Math., vol. 12, pp. 139–146, 1985.
6. R. Games, “The geometry of m-sequences: Three-valued cross-correlations and quadrics in finite projective geometry,” SIAM J. Algebraic Discrete Methods, vol. 7, pp. 43–52, 1986.
7. S. Golomb, Shift Register Sequences. Laguna Hills, CA: Aegean Park Press, 1982.
8. B. Gordon, W. H. Mills, and L. R. Welch, “Some new difference sets,” Canad. J. Math., vol. 14, pp. 614–625, 1962.
9. T. Helleseth, “Some results about the cross-correlation function between two maximal linear sequences,” Discrete Math., vol. 16, pp. 209–232, 1976.
10. A. Klapper, A. H. Chan, and M. Goresky, “Cross-correlations of linearly and quadratically related geometric sequences and GMW sequences,” to appear, Discrete Appl. Math.
11. V. Kumar and O. Moreno, “Polyphase sequences with periodic correlation properties better than binary sequences,” manuscript, 1990.
12. H. Lenstra, Jr. and R. Schoof, “Primitive normal bases for finite fields,” Math. Computat. vol. 48, no. 177, pp. 217–231, 1987.
13. R. Lidl and H. Niederreiter, Finite Fields in Encyclopedia of Mathematics. Cambridge: Cambridge Univ. Press, 1983, vol. 20.
14. J. L. Massey, “Shift register synthesis and BCH decoding,” IEEE Trans. Inform. Theory, vol. IT-15, pp. 122–127, Jan. 1969.
15. R. McEliece, Finite Fields for Computer Scientists and Engineers. Boston, MA: Kluwer Academic, 1987.
16. R. Mullin, I. Onyszchuk, and S. Vanstone, “Optimal normal bases in GF(pn),” Discrete Appl. Math., vol. 22, pp. 149–161, 1989.
17. R. Scholtz and L. Welch, “GMW sequences,” IEEE Trans. Inform. Theory, vol IT-30, pp. 548–553, May 1984.
18. M. Simon, J. Omura, R. Scholtz, and B. Levitt, Spread-Spectrum Communications. New York: Computer Science Press, 1985, vol. 1.
19. D. Sarwate and M. Pursley, “Crosscorrelation properties of pseudorandom and related sequences,” IEEE Proceedings, vol. 68, pp. 593–619, 1980.
20. L. R. Welch, “Lower bounds on the maximum correlation of signals,” IEEE Trans. Inform. Theory, vol. IT-20, pp. 397–399, May 1974.
21. N. Zierler and W. H. Mills, “Products of linear recurring sequences,” J Algebra, vol. 27, pp. 147–157, 1973.