Abstract
A construction is given for perfect linear ciphers that uses two digits of key per plaintext digit, which appears to be the minimum possible. The construction utilizes two shift-registers that are clocked at different speeds, and suggests a new type of random sequence generator in which two linear feedback shift-registers are clocked at different speeds and their contents combined at the lower clock rate. The effects of variable speed are analyzed, and the linear complexity of the sequences produced by such generators is determined.
Chapter PDF
Similar content being viewed by others
References
J.L. Massey, “Error Bounds for Tree Codes, Trellis Codes, and Convolutional Codes with Encoding and Decoding Procedures”, pp.1–57 in Coding and Complexity (Ed. G. Longo), CISM Courses and Lectures No. 216, Springer-Verlag, Vienna and New York, 1975.
C.E. Shannon, “Communication Theory of Secrecy Systems”, Bell System Tech. J., vol. 28, pp.656–715, October 1949.
E.L. Key, “An Analysis of the Structure and Complexity of Nonlinear Binary Sequence Generators”, IEEE Trans. Info. Th., vol. IT-22, pp.732–736, Nov. 1976.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Massey, J.L., Rueppel, R.A. (1985). Linear Ciphers and Random Sequence Generators with Multiple Clocks. In: Beth, T., Cot, N., Ingemarsson, I. (eds) Advances in Cryptology. EUROCRYPT 1984. Lecture Notes in Computer Science, vol 209. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39757-4_8
Download citation
DOI: https://doi.org/10.1007/3-540-39757-4_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16076-2
Online ISBN: 978-3-540-39757-1
eBook Packages: Springer Book Archive