Pseudorandom Bits for Polynomials

We present a new approach to constructing pseudorandom generators that fool low-degree polynomials over finite fields, based on the Gowers norm. Using this approach, we obtain the following main constructions of explicitly computable generators G : FsrarrFn that fool polynomials over a prime field F: (1) a generator that fools degree-2 (i.e., quadratic) polynomials to within error 1/n, with seed length s = O(log n); (2) a generator that fools degree-3 (i.e., cubic) polynomials to within error epsiv, with seed length s = O(Iog|F| n) + f(epsiv, F) where f depends only on epsiv and F (not on n), (3) assuming the "Gowers inverse conjecture," for every d a generator that fools degree-d polynomials to within error epsiv, with seed length, s = O(dldrIog|F| n) + f(d, epsiv, F) where f depends only on d, epsiv, and F (not on n). We stress that the results in (1) and (2) are unconditional, i.e. do not rely on any unproven assumption. Moreover, the results in (3) rely on a special case of the conjecture which may be easier to prove. Our generator for degree-d polynomials is the component-wise sum of d generators for degree-l polynomials (on independent seeds). Prior to our work, generators with logarithmic seed length were only known for degree-1 (i.e., linear) polynomials (Naor and Naor; SIAM J. Comput., 1993). In fact, over small fields such as F2 = {0,1}, our results constitute the first progress on these problems since the long-standing generator by Luby, Velickovic and Wigderson (ISTCS1993), whose seed length is much bigger: s = exp (Omega(radiclogn)), even for the case of degree-2 polynomials over F2.

[1]  Shachar Lovett,et al.  Inverse conjecture for the gowers norm is false , 2007, Theory Comput..

[2]  Noga Alon,et al.  Testing Low-Degree Polynomials over GF(2( , 2003, RANDOM-APPROX.

[3]  Hanno Lefmann,et al.  MOD p -tests, almost independence and small probability spaces , 2000 .

[4]  H. Niederreiter,et al.  Finite Fields: Encyclopedia of Mathematics and Its Applications. , 1997 .

[5]  Noga Alon,et al.  Simple Construction of Almost k-wise Independent Random Variables , 1992, Random Struct. Algorithms.

[6]  Mark Jerrum,et al.  Approximate Counting, Uniform Generation and Rapidly Mixing Markov Chains , 1987, International Workshop on Graph-Theoretic Concepts in Computer Science.

[7]  Emanuele Viola,et al.  New correlation bounds for GF(2) polynomials using Gowers uniformity , 2006, Electron. Colloquium Comput. Complex..

[8]  Emanuele Viola,et al.  Norms, XOR Lemmas, and Lower Bounds for GF(2) Polynomials and Multiparty Protocols , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

[9]  Jon Kleinberg,et al.  Authoritative sources in a hyperlinked environment , 1999, SODA '98.

[10]  Gary L. Miller,et al.  Graph Partitioning by Spectral Rounding: Applications in Image Segmentation and Clustering , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).

[11]  Emanuele Viola The Sum of d Small-Bias Generators Fools Polynomials of Degree d , 2008, Computational Complexity Conference.

[12]  Noga Alon,et al.  Construction Of Asymptotically Good Low-rate Error-correcting Codes Through Pseudo-random Graphs , 1991, Proceedings. 1991 IEEE International Symposium on Information Theory.

[13]  Avi Wigderson,et al.  Deterministic approximate counting of depth-2 circuits , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

[14]  B. Mohar Isoperimetric inequalities, growth, and the spectrum of graphs , 1988 .

[15]  Emanuele Viola,et al.  Pseudorandom bits for constant depth circuits with few arbitrary symmetric gates , 2005, 20th Annual IEEE Conference on Computational Complexity (CCC'05).

[16]  Moni Naor,et al.  Small-Bias Probability Spaces: Efficient Constructions and Applications , 1993, SIAM J. Comput..

[17]  Bojan Mohar,et al.  Isoperimetric numbers of graphs , 1989, J. Comb. Theory, Ser. B.

[18]  Andrej Bogdanov Pseudorandom generators for low degree polynomials , 2005, STOC '05.

[19]  Victor Shoup,et al.  New algorithms for finding irreducible polynomials over finite fields , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[20]  A. Hoffman,et al.  Lower bounds for the partitioning of graphs , 1973 .

[21]  Oded Goldreich,et al.  Modern Cryptography, Probabilistic Proofs and Pseudorandomness , 1998, Algorithms and Combinatorics.

[22]  Noga Alon,et al.  Small Sample Spaces Cannot Fool Low Degree Polynomials , 2008, APPROX-RANDOM.

[23]  W. T. Tutte How to Draw a Graph , 1963 .

[24]  Noga Alon,et al.  Eigenvalues and expanders , 1986, Comb..

[25]  W. T. Gowers,et al.  A new proof of Szemerédi's theorem , 2001 .

[26]  Alex Samorodnitsky,et al.  Low-degree tests at large distances , 2006, STOC '07.

[27]  Alessandro Panconesi,et al.  Concentration of Measure for the Analysis of Randomized Algorithms , 2009 .

[28]  Hanno Lefmann,et al.  MODp-tests, almost independence and small probability spaces , 2000, Random Struct. Algorithms.

[29]  Ben Green,et al.  The distribution of polynomials over finite fields, with applications to the Gowers norms , 2007, Contributions Discret. Math..

[30]  Shachar Lovett,et al.  Unconditional pseudorandom generators for low degree polynomials , 2008, Theory Comput..

[31]  Kenneth M. Hall An r-Dimensional Quadratic Placement Algorithm , 1970 .

[32]  W. T. Gowers,et al.  A NEW PROOF OF SZEMER ´ EDI'S THEOREM , 2001 .

[33]  R. M. Tanner Explicit Concentrators from Generalized N-Gons , 1984 .

[34]  P. Bonacich Power and Centrality: A Family of Measures , 1987, American Journal of Sociology.

[35]  Agnieszka Bodzenta Proceedings of the Edinburgh Mathematical Society , 1893, Nature.

[36]  Noga Alon,et al.  Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs , 1992, IEEE Trans. Inf. Theory.

[37]  Ben Green,et al.  AN INVERSE THEOREM FOR THE GOWERS $U^3(G)$ NORM , 2008, Proceedings of the Edinburgh Mathematical Society.

[38]  Luca Trevisan,et al.  Gowers Uniformity, Influence of Variables, and PCPs , 2009, SIAM J. Comput..

[39]  Noga Alon,et al.  lambda1, Isoperimetric inequalities for graphs, and superconcentrators , 1985, J. Comb. Theory, Ser. B.

[40]  Ben Green,et al.  AN INVERSE THEOREM FOR THE GOWERS U4-NORM , 2005, Glasgow Mathematical Journal.

[41]  Frank Thomson Leighton,et al.  Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms , 1999, JACM.

[42]  W. T. Gowers,et al.  A New Proof of Szemerédi's Theorem for Arithmetic Progressions of Length Four , 1998 .

[43]  Noam Nisan,et al.  Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-Offs , 1992, J. Comput. Syst. Sci..

[44]  D. Spielman,et al.  Spectral partitioning works: planar graphs and finite element meshes , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[45]  Eli Ben-Sasson,et al.  Randomness-efficient low degree tests and short PCPs via epsilon-biased sets , 2003, STOC '03.

[46]  David M. Mount,et al.  Isomorphism of graphs with bounded eigenvalue multiplicity , 1982, STOC '82.