9 search results - page 1 / 2 » Pseudorandom Bit Generators That Fool Modular Sums |
APPROX
2009
Springer
13 years 11 months ago
2009
Springer
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
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 th...
COCO
2005
Springer
13 years 6 months ago
2005
Springer
We exhibit an explicitly computable ‘pseudorandom’ generator stretching l bits into m(l) = lΩ(log l) bits that look random to constant-depth circuits of size m(l) with log m...
CRYPTO
2000
Springer
13 years 9 months ago
2000
Springer
Under the assumption that solving the discrete logarithm problem modulo an n-bit prime p is hard even when the exponent is a small c-bit number, we construct a new and improved pse...
STOC
2005
ACM
14 years 4 months ago
2005
ACM
We investigate constructions of pseudorandom generators that fool polynomial tests of degree d in m variables over finite fields F. Our main construction gives a generator with se...