|Title:||On the Existence of Pseudo-Random Generators
|Authors:||O. Goldreich, R. Krawczyk and M. Luby
|Abstract:||Pseudorandom generators [BM, Y] are efficient deterministic programs that expand a randomly selected k-bit seed into a much longer pseudorandom bit sequence which is indistinguishable in polynomial-time from a sequence of unbiased coin tosses. Thus, pseudorandom sequences can replace truly random sequences in all practical (i.e. polynomial-time) applications.|
|Copyright||The above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information|
Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1988/CS/CS0494), rather than to the URL of the PDF files directly. The latter URLs may change without notice.
To the list of the CS technical reports of 1988
To the main CS technical reports page
Computer science department, Technion