Time-Space Tradeoffs for Distinguishing Distributions and Applications to Security of Goldreich's PRG

Full Text

In this work, we establish lower-bounds against memory bounded algorithms for distinguishing between natural pairs of related distributions from samples that arrive in a streaming setting. In our first result, we show that any algorithm that distinguishes between uniform distribution on $\{0,1\}^n$ and uniform distribution on an $n/2$...More