Pseudorandom Bits for Polynomials

We present a new approach to constructing pseudorandom generators that fool lowdegree polynomials over finite fields, based on the Gowers norm. Using this approach, we obtain the following main constructions of explicitly computable generators G : Fs → Fn that fool polynomials over a prime field F:

• Type: Conference
• Year: 2007
• Where: FOCS
• Authors: Andrej Bogdanov, Emanuele Viola
• Keywords: FOCS 2007, Fool Polynomials, Gowers Norm, Pseudorandom Generators, Theoretical Computer Science