Abstract
In this paper, a number of output sequences is proposed as a characteristic of binary sequence generators for cryptographic applications. Sufficient conditions for a variable-memory binary sequence generator to produce maximum possible number of output sequences are derived.
Chapter PDF
Similar content being viewed by others
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.
V. References
Jovan Dj. Golić, Miodrag M. Mihaljević, “Minimal linear equivalent analysis of a variable-memory binary sequence generator” IEEE Trans. Inform. Theory. vol. IT-36, pp. 190–192, Jan. 1990.
S. M. Jennings, “A special class of binary sequences”, Ph.D. thesis. Westfield College, London University, 1980.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Golić, J.D. (1991). The Number of Output Sequences of a Binary Sequence Generator. In: Davies, D.W. (eds) Advances in Cryptology — EUROCRYPT ’91. EUROCRYPT 1991. Lecture Notes in Computer Science, vol 547. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46416-6_14
Download citation
DOI: https://doi.org/10.1007/3-540-46416-6_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54620-7
Online ISBN: 978-3-540-46416-7
eBook Packages: Springer Book Archive