next up previous
Next: Quantifying Knowledge Complexity Up: The Technion Period (1986-94) Previous: On the Composition of

A Note on Computational Indistinguishability

The non-triviality of the notion of computational indistinguishability, for sampleable distributions, is shown to be equivalent to the existence of pseudorandom generators. That is, it is shown how to transform two sampleable distributions that are computationally indistinguishable but statistically far apart, into a pseudorandom generator.


Comments: Authored by O. Goldreich. Appeared in



Oded Goldreich
2003-07-30