The Shrinking Generator

  • Don Coppersmith
  • Hugo Krawczyk
  • Yishay Mansour
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 773)


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.


Linear Complexity Stream Cipher Random String Linear Feedback Shift Register Pseudorandom Generator 
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.


  1. 1.
    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.Google Scholar
  2. 2.
    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.Google Scholar
  3. 3.
    Blahut, R., Theory and Practice of Error Control Codes, Addison-Wesley, 1984.Google Scholar
  4. 4.
    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.CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Boyar, J. “Inferring Sequences Produced by Pseudo-Random Number Generators”, Jour. of ACM, Vol. 36, No. 1, 1989, pp.129–141.CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    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.CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    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.CrossRefGoogle Scholar
  8. 8.
    D. Gollmann and W.G. Chambers, “Clock-controlled shift registers: A review”, IEEE J. Selected Areas Commun., vol. 7, pp. 525–533, May 1989CrossRefGoogle Scholar
  9. 9.
    S.W. Golomb, Shift Register Sequences, Aegean Park Press, 1982.Google Scholar
  10. 10.
    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.Google Scholar
  11. 11.
    Kessler, I., and Krawczyk, H., “Buffer Length and Clock Rate for the Shrinking Generator”, preprint.Google Scholar
  12. 12.
    Krawczyk, H., “How to Predict Congruential Generators”, Journal of Algorithms, Vol. 13, 1992. pp. 527–545.CrossRefzbMATHMathSciNetGoogle Scholar
  13. 13.
    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.Google Scholar
  14. 14.
    Lidl, R., and Niederreiter, H., “Finite Fields”, in Encyclopedia of Mathematics and Its Applications, Vol 20, Reading, MA: Addison-Wesley, 1983.Google Scholar
  15. 15.
    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.Google Scholar
  16. 16.
    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.Google Scholar
  17. 17.
    Rabin, M.O., “Probabilistic Algorithms in Finite Fields”, SIAM J. on Computing, Vol. 9, 1980, pp. 273–280.CrossRefzbMATHMathSciNetGoogle Scholar
  18. 18.
    Rueppel, R. A., “Stream Ciphers”, in Gustavos J. Simmons, editor, Contemporary Cryptology, The Science of Information, IEEE Press, 1992, pp. 65–134.Google Scholar
  19. 19.
    Stern, J., “Secret Linear Congruential Generators Are Not Gryptographically Secure”, Proc. of the 28rd IEEE Symp. on Foundations of Computer Science, 1987.Google Scholar
  20. 20.
    Yao, A.C., “Theory and Applications of Trapdoor Functions”, Proc. of the 23rd IEEE Symp. on Foundation of Computer Science, 1982, pp. 80–91.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Don Coppersmith
    • 1
  • Hugo Krawczyk
    • 1
  • Yishay Mansour
    • 1
  1. 1.IBM T.J. Watson Research CenterYorktown Heights

Personalised recommendations