A.H. Chan is supported by the National Security Agency under Grant Number MDA904-91-H-0012 and partially supported by the MITRE Sponsored Research Program. R.A. Games and J.J. Rushanan are supported by the MITRE Sponsored Research Program. The United States Government is authorized to reproduce and distribute reprints notwithstanding any copyright notation hereon
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
S.W. Golomb, Shift Register Sequences, Aegean Park Press, California, 1982.
B. Gordon, W.H. Mills and L.R. Welch, Some New Difference Sets, Canad. J. Math. 14 (1962), pages 614–625.
A.H. Chan and R.A. Games, On the Linear Span of Binary Sequences Obtained from Finite Geometry, IEEE Trans. on Information Theory (1990), vol IT-36, pages 548–552.
E.L. Key, An Analysis of the Structure and Complexity of Nonlinear Binary Sequence Generators, IEEE Trans. on Information Theory (1976), Vol IT-22.
R.A. Rueppel and O.J. Staffelbach, Products of Linear Recurring Sequences with Maximum Complexity, IEEE Trans. on Information Theory (1987), vol IT-33, pages 124–129.
A.H. Chan and R.A. Games, On the Quadratic Spans of DeBruijn Sequences, IEEE Trans. on Information Theory (1990), vol IT-36 pages 822–829.
L.H. Khachatrian, The Lower Bound of the Quadratic Spans of DeBruijn Sequences, Designs, Codes, and Cryptography (1993), vol 3.
B. Sroka, personal communication
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chan, A.H., Games, R.A., Rushanan, J.J. (1994). On quadratic m-sequences. In: Anderson, R. (eds) Fast Software Encryption. FSE 1993. Lecture Notes in Computer Science, vol 809. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58108-1_20
Download citation
DOI: https://doi.org/10.1007/3-540-58108-1_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58108-6
Online ISBN: 978-3-540-48456-1
eBook Packages: Springer Book Archive