Goldreich, O. (1990). A note on computational indistinguishability. Information Processing Letters 34(6), 277–281. DOI 10.1016/0020-0190(90)90010-U
Not read. A reading should replace this note.
Why this is here
CLAIM-302 says efficiently samplable ensembles that are statistically far yet computationally indistinguishable exist if pseudorandom generators do, and cites the book’s statement that they exist exactly when one-way functions do. The book does not prove that equivalence; it cites this note. The owner asked for it to be filed and read.
Still not read. Håstad, Impagliazzo, Levin and Luby (LIT-1051, read in NOTE-880) describe this note as showing “that the existence of pseudorandom generators is equivalent to the existence of a pair of P-samplable distributions which are computationally indistinguishable but statistically very different”, and cite it as ICSI Technical Report TR-89-051 (July 1989). That supports the search summary over the book’s “one-way functions” paraphrase, which combines this note with their own theorem.