Abstract
A new type of nonlinear feedforward logic for binary sequence generators is proposed, i.e. a logic that combines the stages of a linear feedback shift register (LFSR) in a nonlinear way. The sequences generated are analyzed with respect to their transient and ultimately periodic behavior. They are shown to have a balanced zero-one distribution, and a lower bound on their linear complexity is derived which grows exponentially with the length of the LFSR.
Chapter PDF
References
H. Beker and F. Piper, Cipher Systems. London: Northwood Books, 1982.
S.W. Golomb, Shift register sequences. Revised edition, Laguna Hills, California: Aegean Park Press, 1982.
E.L. Key, “An analysis of the structure and complexity of nonlinear binary sequence generators”, IEEE Trans.Inform.Theory, vol. IT-22, pp. 732–736, Nov. 1976.
S.H. Tsao, “Generation of delayed replicas of maximal-length linear binary sequences”, Proc. IEEE, vol. 111, pp. 1803–1806, Nov. 1964.
J. Bernasconi and C.G. Günther, “Analysis of a nonlinear feed-forward logic for binary sequence generators”, submitted to IEEE Trans.Inform.Theory.
R.A. Rueppel, New approaches to stream ciphers. Ph. D. Thesis, ETH-Zürich, 1984.
P.V. Kumar and R.A. Scholtz, “Bounds on the linear span of bent sequences”, IEEE Trans.Inform.Theory, vol. IT-29, pp. 854–862, Nov. 1983.
N. Zierler, “Linear recurring sequences”, J.Soc.Indust.Appl.Math., vol. 7, pp. 31–48, March 1959.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bernasconi, J., Günther, C.G. (1986). Analysis of a Nonlinear Feedforward Logic for Binary Sequence Generators. In: Pichler, F. (eds) Advances in Cryptology — EUROCRYPT’ 85. EUROCRYPT 1985. Lecture Notes in Computer Science, vol 219. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39805-8_20
Download citation
DOI: https://doi.org/10.1007/3-540-39805-8_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16468-5
Online ISBN: 978-3-540-39805-9
eBook Packages: Springer Book Archive