Technical Report CS0602

Title: A note on computational indistinguishability
Authors: Oded Goldreich
Abstract: We show that following two conditions are equivalent: 1) The existence of pseudorandom generators. 2) The existence of a pair of efficiently constructible distributions which are computationally indistinguishable but statistically very different.

KEYWORDS: Computational Complexity, Randomness, Algorithms.

CopyrightThe 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 (, 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 1990
To the main CS technical reports page

Computer science department, Technion