Abstract
Cascaded cryptographic keystream generators as proposed by Gollmann possess a cryptanalytic weakness termed “lock-in” in this article. If the initial state has been guessed correctly apart from its phase a decryption cascade can be set up in which the effects of each stage of the original cascade are unravelled in reverse order. Once the decryption cascade has “locked in” on the original cascade, the state of the latter is known, and hence its future output and its output in the remote past. This weakness is studied; its effects are readily mitigated by taking certain precautions. Lock-in may also be used constructively as a synchronization technique.
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
H Beker, F Piper, Cipher Systems: The Protection of Communications, (New York: Wiley) 1982
T Beth, F C Piper, “The Stop-and-Go Generator”, Advances in Cryptology: Proceedings of Eurocrypt 84 (T Beth, N Cot, I Ingemarsson, eds) Lecture Notes in Computer Science 209, 88–92 (Berlin: Springer-Verlag) 1985
W G Chambers “Clock-controlled Shift Registers in Binary Sequence Generators”, IEE Roc E, 1988, 135, 17–24
W G Chambers and D Gollmann, “Generators for Sequences with Near-maximal Linear Equivalence”, IEE Proc E, 1988, 135, 67–69
W G Chambers, S M Jennings, “Linear Equivalence of Certain BRM Shift Register Sequences”, Electronics Letters, 1984, 20, 1018–1019
D Gollmann, “Linear Recursions of Cascaded Sequences” Contributions to General Algebra 3, Proceedings of the Vienna Conference June 1984 (Verlag Holder-Pichler-Tempsky, Wien 1985-Verlag B G Teubner, Stuttgart)
D Gollmann, “Pseudo Random Properties of Cascade Connections of Clock Controlled Shift Registers” in Advances in Cryptology, Proceedings of Eurocrypt 84, (ed T Beth, N Cot, I Ingemarsson) Lecture Notes in Computer Science 209, pp93–98 (Berlin: Springer Verlag 1985)
A Papoulis, Probability, Random Variables, and Stochastic Processes 2nd ed, (Singapore: McGraw-Hill) 1984
R A Rueppel, Analysis and Design of Stream Ciphers, (Heidelberg: Springer-Verlag) 1986
T Siegenthaler, “Correlation Immunity of Nonlinear Combining Functions for Cryptographic Applications”, IEEE Trans Info Theory, 1984, IT-30, 776–780
T Siegenthaler, “Decrypting a Class of Stream Ciphers Using Ciphertext only”, IEEE Trans Computers, 1985, C-34, 81–85
B Smeets, “A Note on Sequences Generated by Clock Controlled Shift Registers”, Advances in Cryptology: Eurocrypt’ 85, (F Pichler ed), Lecture Notes in Computer Science 219, pp142–148 (Berlin: Springer-Verlag) 1986
R Vogel, “On the linear complexity of cascaded sequences”, Advances in Cryptology: Proceedings of Eurocrypr 84 (T Beth, N Cot, I Ingemarsson, eds) Lecture Notes in Computer Science 209, 99–109 (Berlin: Springer-Verlag 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
Chambers, W.G., Gollmann, D. (1988). Lock-in Effect in Cascades of Clock-Controlled Shift-Registers. In: Barstow, D., et al. Advances in Cryptology — EUROCRYPT ’88. EUROCRYPT 1988. Lecture Notes in Computer Science, vol 330. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45961-8_31
Download citation
DOI: https://doi.org/10.1007/3-540-45961-8_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50251-7
Online ISBN: 978-3-540-45961-3
eBook Packages: Springer Book Archive