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