Pseudorandom Bit Generators That Fool Modular Sums

@inproceedings{Lovett2009PseudorandomBG,
  title={Pseudorandom Bit Generators That Fool Modular Sums},
  author={Shachar Lovett and O. Reingold and L. Trevisan and S. Vadhan},
  booktitle={APPROX-RANDOM},
  year={2009}
}
  • Shachar Lovett, O. Reingold, +1 author S. Vadhan
  • Published in APPROX-RANDOM 2009
  • Computer Science, Mathematics
  • We consider the following problem: for given n ,M , produce a sequence X 1 ,X 2 ,...,X n of bits that fools every linear test modulo M . We present two constructions of generators for such sequences. For every constant prime power M , the first construction has seed length O M (log(n /*** )), which is optimal up to the hidden constant. (A similar construction was independently discovered by Meka and Zuckerman [MZ]). The second construction works for every M ,n , and has seed length O (logn… CONTINUE READING
    28 Citations
    Pseudorandomness for concentration bounds and signed majorities
    • 5
    • PDF
    Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields
    • 3
    Pseudorandomness via the Discrete Fourier Transform
    • 31
    • PDF
    Pseudorandom generators for group products: extended abstract
    • 33
    • PDF
    Pseudorandom generators for polynomial threshold functions
    • 63
    • PDF
    Pseudorandom Generators for CC0[p] and the Fourier Spectrum of Low-Degree Polynomials over Finite Fields
    • 5
    • PDF
    Pseudorandomness for Permutation and Regular Branching Programs
    • A. De
    • Mathematics, Computer Science
    • 2011 IEEE 26th Annual Conference on Computational Complexity
    • 2011
    • 39
    • PDF
    Small-Bias is Not Enough to Hit Read-Once CNF
    • 3
    Pseudorandom generators for combinatorial checkerboards
    • Thomas Watson
    • Computer Science, Mathematics
    • 2011 IEEE 26th Annual Conference on Computational Complexity
    • 2011
    • 4
    • Highly Influenced
    • PDF
    Optimal Hitting Sets for

    References

    SHOWING 1-10 OF 73 REFERENCES
    Pseudorandom Bits for Polynomials
    • A. Bogdanov, E. Viola
    • Mathematics, Computer Science
    • 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07)
    • 2007
    • 108
    • PDF
    On ε-biased generators in NC 0
    • 65
    • PDF
    Multiparty Protocols, Pseudorandom Generators for Logspace, and Time-Space Trade-Offs
    • 270
    • PDF
    Pseudorandom generators for space-bounded computation
    • N. Nisan
    • Computer Science, Mathematics
    • Comb.
    • 1992
    • 450
    Small-Bias Spaces for Group Products
    • 32
    • PDF
    A well-characterized approximation problem
    • 28
    • PDF
    Small-Bias Probability Spaces: Efficient Constructions and Applications
    • 447
    Deterministic simulation in LOGSPACE
    • 238