Abstract
A key stream generator is analyzed which consists of a single linear feedback shift register (LFSR) with a primitive connection polynomial and a nonlinear feedforward logic. It is shown. how, for arbitrary integers n and r and a binary LFSR of length L = n • r the linear complexity of the generated keystream can be determined for a large class of nonlinear feedforward logics. Moreover, a simple condition imposed on these logics ensures an ideal r-tupel distribution for these keystreams. Practically useful solutions exist where the keystream has linear complexity n • r n−1 together with an ideal r-tupel distribution.
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.
References
T. Herlestam, On Functions of Linear Shift Register Sequences, Advances in Cryptology, Eurocrypt’ 85, Lecture Notes in Computer Science, No. 219, Springer Verlag, 1985, p. 119–129.
E.J. Groth, Generation of Binary Sequences with Controllable Complexity, IEEE Tr. on Inf. Theory, Vol. IT-17, No. 3, May 1971, p. 288–296.
R.A. Ruegpel New Approaches to Stream Ciphers. Diss. ETH No. 7714, Zürich, 1984.
J. Bernasconi, C.G. Günther, Analysis of a Nonlinear Feedforward Logic for Binary Sequence Generators, Advances in Cryptology, Eurocrypt’ 85, Lecture Notes in Computer Science, No. 219, Springer Verlag, 1985, p. 161–168.
B. Benjauthrit, I.S. Reed. Galois Switching Functions and their Applications. IEEE Tr. on Comp., Vol. C-25, No. 1. Jan. 1976, p. 78–86.
L. Brynielsson, On the Linear Complexity of Combined Shift Register Sequences, Advances in Cryptology, Eurocrypt’ 85, Lecture Notes on Computer Science, No. 219, Springer Verlag, 1985, p. 156-160.
—, Entwurf und Analyse eines Kryptosystems über GF(16), Kryptologie Aufbauseminar, J. Kepler Universität, Linz, 1985.
Th. Siegenthaler, Methoden für den Entwurf von Stream Cipher-Systemen, Diss. ETH No. 8185, Dec. 1986.
R. Forré, Analyse eines Chiffriergenerators, Diploma Project, Inst. for Communications Technology. ETH Zürich, Dec. 1986.
R. Lidl, H. Kiederreiter, Finite Fields, Addison-Wesley Publishing Company, 1983.
B. Gordon, W. H. Mills. and L. R. Welch. Some new difference sets, Canad. J. Math., vol. 14. pp. 614–625, 1962.
M. K. Simon. J. K. Omura, R. A Scholtz, and B. K. Levitt, Spread Spectrum Communications, Vol. 1, Computer Science Press, 1985
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Siegenthaler, T., Forré, R., Kleiner, A.W. (1988). Generation of Binary Sequences with Controllable Complexity and Ideal r-Tupel Distribution. In: Chaum, D., Price, W.L. (eds) Advances in Cryptology — EUROCRYPT’ 87. EUROCRYPT 1987. Lecture Notes in Computer Science, vol 304. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39118-5_3
Download citation
DOI: https://doi.org/10.1007/3-540-39118-5_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19102-5
Online ISBN: 978-3-540-39118-0
eBook Packages: Springer Book Archive