Abstract
A construction of a pseudo random generator based on a single linear feedback shift register is investigated. The construction is related to the so-called shrinking generator and is attractive by its conceptual simplicity. The lower bounds that are provided for period, linear complexity and known cryptanalytic attacks allow for efficient practical implementations at a reasonable scale.
A version of this paper will appear in the proceedings of a symposium in honor of James L. Massey on the occasion of his 60th birthday.
Chapter PDF
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
D. Coppersmith, H. Krawczyk, Y. Mansour, The Shrinking Generator, Crypto'93, to appear.
S.W. Golomb, Shift Register Sequences, Aegean Park Press, 1982.
J.L. Massey, Shift Register Synthesis and BCH Decoding, IEEE Transactions on Information Theory, Vol. IT-15, pp. 122–127, 1969.
R.A. Rueppel, When Shift Registers Clock Themselves, Advances in Cryptology—Eurocrypt'87, Proceedings, pp. 53–64, Springer-Verlag, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meier, W., Staffelbach, O. (1995). The self-shrinking generator. In: De Santis, A. (eds) Advances in Cryptology — EUROCRYPT'94. EUROCRYPT 1994. Lecture Notes in Computer Science, vol 950. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0053436
Download citation
DOI: https://doi.org/10.1007/BFb0053436
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60176-0
Online ISBN: 978-3-540-44717-7
eBook Packages: Springer Book Archive