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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Coppersmith, H. Krawcyk, and 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 CryptologyEurocrypt’87, Proceedings, pp. 53–64, Springer-Verlag, 1988.
R.A. Rueppel et al., “Verfahren und Schaltanordnung zum Erzeugen einer Pseudozufalisfolge sowie deren Verwendung”, Deutsche Patentanmeldung P 43 01 279.5, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer Science+Business Media New York
About this chapter
Cite this chapter
Meier, W., Staffelbach, O. (1994). The Self-Shrinking Generator. In: Blahut, R.E., Costello, D.J., Maurer, U., Mittelholzer, T. (eds) Communications and Cryptography. The Springer International Series in Engineering and Computer Science, vol 276. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-2694-0_28
Download citation
DOI: https://doi.org/10.1007/978-1-4615-2694-0_28
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6159-6
Online ISBN: 978-1-4615-2694-0
eBook Packages: Springer Book Archive