Abstract
Random binaxy sequences are required in many applications of modern communi- cation systems and in designing reliable circuits. However, truly random sequences are often associated with extremely high costs, and are therefore infeasible to use. Deter- ministically generated sequences that pass certain statistical tests suggested by random sequences are often used instead and are referred to as pseudorandom sequences. In applications involving, for instance, secure or spread spectrum communications, it is essential that these pseudorandom sequences be unpredictable. This paper addresses the problem of predicting the terms of a pseudorandom sequence from some initial por- tion of the sequence. A good introduction to the issues involved in this area can be found in [7].
This work was supported by the United States Air Force’s Electronic Systems Division under Contract F19628-86-C-0001 and the MITRE-Sponsored Research Program.
Chapter PDF
Similar content being viewed by others
List Of References
A. H. Chan, R. A. Games and E. L. Key, “On the Complexity of de Bruijn Sequences,” J. Comb. Theory (A) 33-3 (1982), 233–246.
H. Fredricksen, “A Survey of Full Length Nonlinear Shift Register Cycle Algorithms,” SIAM Review 24 (1982), 195–221.
E. J. Groth, “Generation of Binary Sequences with Controllable Complexity,” IEEE Trans, on Inform. Theory IT-17 (1971), 288–296.
K. Imamura and W. Yoshida, “A Simple Derivation of the Berlekamp-Massey Algorithm and some Applications,” IEEE Trans, on Inform. Theory IT-33 (1987), 146–150.
E. L. Key, “An Analysis of the Structure and Complexity of Nonlinear Binary Sequence Generators,” IEEE Trans, on Inform. Theory IT-22 (1976), 732–736.
J. L. Massey, “Shift-Register Synthesis and BCH Decoding,” IEEE Trans. on Inform. Theory IT-15 (1969), 122–127.
R. A. Rueppel, New Approaches to Stream Ciphers, Swiss Federal Institute of Technology, Zurich, Switzerland: Ph.D. Thesis, 1984.
R. A. Rueppel and Staffelbach, “Linear Recurring Sequences With Maximum Complexity,” IEEE Trans. on Inform. Theory IT-33 (1987), 126–131.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heildeberg
About this paper
Cite this paper
Chan, A.H., Games, R.A. (1990). On the Quadratic Spans of Periodic Sequences. In: Brassard, G. (eds) Advances in Cryptology — CRYPTO’ 89 Proceedings. CRYPTO 1989. Lecture Notes in Computer Science, vol 435. Springer, New York, NY. https://doi.org/10.1007/0-387-34805-0_9
Download citation
DOI: https://doi.org/10.1007/0-387-34805-0_9
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-97317-3
Online ISBN: 978-0-387-34805-6
eBook Packages: Springer Book Archive