Definition of Pseudorandom Generators Two distributions X and Y over \{0,1\}^n are (s, \epsilon)-indistinguishable if, for any circuit C of size at most s, \left| \Pr_X[C(X) = 1] – \Pr_Y[C(Y) = 1] \right| \leq \epsilon. A pseudorandom generator …

Pseudorandom Generators and Derandomization Read more »