Chapter PDF
References
Coppersmith D., Krawczyk, H., and Mansour Y., “The Shrinking Generator”, presented at Crypto'93.
S.W. Golomb, Shift Register Sequences, Aegean Park Press, 1982.
John A Gordon, “Very simple method to find the minimal polynomial of an arbitrary non-zero element of a finite field”, Electronics Letters Vol. 12, 1976, pp. 663–664.
Rabin, M.O., “Probabilistic Algorithms in Finite Fields”, SIAM J. on Computing, Vol. 9, 1980, pp. 273–280.
Rabin, M.O., “Fingerprinting by Random Polynomials”, Tech. Rep. TR-15–81, Center for Research in Computing Technology, Harvard Univ., Cambridge, Mass., 1981.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Krawczyk, H. (1994). The Shrinking Generator: some practical considerations. In: Anderson, R. (eds) Fast Software Encryption. FSE 1993. Lecture Notes in Computer Science, vol 809. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58108-1_5
Download citation
DOI: https://doi.org/10.1007/3-540-58108-1_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58108-6
Online ISBN: 978-3-540-48456-1
eBook Packages: Springer Book Archive