The Sum of d Small-Bias Generators Fools Polynomials of Degree d

We give an explicit construction of pseudorandom generators against low degree polynomials over finite fields. We show that the sum of 2^d small-biased generators with error ε²O(d) is a pseudorandom generator against degree d polynomials with error ε. ...

We consider pseudorandom generators in which each output bit depends on a constant number of input bits. Such generators have appealingly simple structure: They can be described by a sparse input---output dependency graph $$G$$G and a small predicate $$...

We consider pseudorandom generators in which each output bit depends on a constant number of input bits. Such generators have appealingly simple structure: they can be described by a sparse input-output dependency graph G and a small predicate P that is ...