Abstract
We present a new construction of a pseudorandom generator based on a simple combination of two LFSRs. The construction has attractive properties as simplicity (conceptual and implementation-wise), scalability (hardware and security), proven minimal security conditions (exponential period, exponential linear complexity, good statistical properties), and resistance to known attacks. The construction is suitable for practical implementation of efficient stream cipher cryptosystems.
Chapter PDF
References
Noga Alon, Oded Goldreich, Johan Hastad, and Rene Peralta. Simple constructions of almost k-wise independent random variables. In 31th Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, pages 544–553, 1990.
Beth, T., and Piper, F., “The stop-and-go Generator”, in Lecture Notes in Computer Science 209; Advances in Cryptology: Proc. Eurocrypt’ 84, Berlin: Springer-Verlag, 1985, pp. 88–92.
Blahut, R., Theory and Practice of Error Control Codes, Addison-Wesley, 1984.
Blum, M., and Micali, S., “How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits”, SIAM Jour. on Computing, Vol. 13, 1984, pp. 850–864.
Boyar, J. “Inferring Sequences Produced by Pseudo-Random Number Generators”, Jour. of ACM, Vol. 36, No. 1, 1989, pp.129–141.
Frieze, A.M., Hastad, J., Kannan, R., Lagarias, J.C., and Shamir, A. “Reconstructing Truncated Integer Variables Satisfying Linear Congruences”, SIAM J. Comput, Vol. 17, 1988, pp. 262–280.
Golic, J.D.J., and Zivkovic, M.V., “On the Linear Complexity of Nonuniformly Decimated PN-sequences”, IEEE Trans. Inform. Theory, Vol 34, Sept. 1988, pp. 1077–1079.
D. Gollmann and W.G. Chambers, “Clock-controlled shift registers: A review”, IEEE J. Selected Areas Commun., vol. 7, pp. 525–533, May 1989
S.W. Golomb, Shift Register Sequences, Aegean Park Press, 1982.
Gunther, C.G., “Alternating Step Generators Controlled by de Bruijn Sequences”, in Lecture Notes in Computer Science 804; Advances in Cryptology: Proc. Eurocrypt’ 87, Berlin: Springer-Verlag, 1988, pp. 88–92.
Kessler, I., and Krawczyk, H., “Buffer Length and Clock Rate for the Shrinking Generator”, preprint.
Krawczyk, H., “How to Predict Congruential Generators”, Journal of Algorithms, Vol. 13, 1992. pp. 527–545.
E. Kushilevitz and Y. Mansour. Learning decision trees using the fourier spectrum. In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, pages 455–464, May 1991.
Lidl, R., and Niederreiter, H., “Finite Fields”, in Encyclopedia of Mathematics and Its Applications, Vol 20, Reading, MA: Addison-Wesley, 1983.
Yishay Mansour. An o(n loglogn) learning algorihm for DNF under the uniform distribution. In 5th Annual Workshop on Computational Learning Theory, pages 53–61, July 1992.
Joseph Naor and Moni Naor. Small bias probability spaces: efficient construction and applications. In Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, Baltimore, Maryland, pages 213–223, May 1990.
Rabin, M.O., “Probabilistic Algorithms in Finite Fields”, SIAM J. on Computing, Vol. 9, 1980, pp. 273–280.
Rueppel, R. A., “Stream Ciphers”, in Gustavos J. Simmons, editor, Contemporary Cryptology, The Science of Information, IEEE Press, 1992, pp. 65–134.
Stern, J., “Secret Linear Congruential Generators Are Not Gryptographically Secure”, Proc. of the 28rd IEEE Symp. on Foundations of Computer Science, 1987.
Yao, A.C., “Theory and Applications of Trapdoor Functions”, Proc. of the 23rd IEEE Symp. on Foundation of Computer Science, 1982, pp. 80–91.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Coppersmith, D., Krawczyk, H., Mansour, Y. (1994). The Shrinking Generator. In: Stinson, D.R. (eds) Advances in Cryptology — CRYPTO’ 93. CRYPTO 1993. Lecture Notes in Computer Science, vol 773. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48329-2_3
Download citation
DOI: https://doi.org/10.1007/3-540-48329-2_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57766-9
Online ISBN: 978-3-540-48329-8
eBook Packages: Springer Book Archive