On the generation of cryptographically strong pseudo-random sequences

  • Adi Shamir
Session 16: S. Even, Chairman
Part of the Lecture Notes in Computer Science book series (LNCS, volume 115)


In this paper we show how to generate from a short random seed S a long sequence of pseudo-random numbers Ri in which the problem of computing one more Ri value given an arbitrarily large subset of the other values is provably equivalent to the cryptanalysis of the associated Rivest-Shamir-Adleman encryption function.


Encryption Function Modular Exponentiation Root Problem Cryptographic System Polynomial Size Circuit 
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.
    Rivest [1980] — private communication.Google Scholar
  2. 2.
    Rivest, Shamir and Adleman [1978]-"A method for obtaining digital signatures and Public-Key Cryptosystems", CACM, Vol. 21, No. 2, February 1978.Google Scholar
  3. 3.
    Shamir [1980] — "On the Power of Commutativity in Cryptography", ICALP Proceddings, July 1980.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Adi Shamir
    • 1
  1. 1.Department of Applied MathematicsThe Weizmann Institute of ScienceRehovotIsrael

Personalised recommendations