8 search results - page 1 / 2 » Unconditional pseudorandom generators for low degree polynom... |
73
Voted
ECCC
2007
14 years 10 months ago
2007
Abstract: We give an explicit construction of a pseudorandom generator against lowdegree polynomials over finite fields. Pseudorandom generators against linear polynomials, known...
STOC
2005
ACM
15 years 10 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...
ECCC
2010
14 years 10 months ago
2010
![Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields](https://www.sciweavers.org/files/imagecache/thumbnail/imagecache/pseudorandom_generators_for_cc0_p_and_the_fourier_spectrum_of_low_degree_polynomials_over_finite_fields_ECCC_2010.jpg "Pseudorandom generators for CC0[p] and the Fourier spectrum of low-degree polynomials over finite fields")
In this paper we give the first construction of a pseudorandom generator, with seed length O(log n), for CC0[p], the class of constant-depth circuits with unbounded fan-in MODp ga...
COCO
2007
Springer
15 years 4 months ago
2007
Springer
Antunes, Fortnow, van Melkebeek and Vinodchandran captured the notion of non-random information by computational depth, the difference between the polynomialtime-bounded Kolmogoro...
EUROCRYPT
2003
Springer
15 years 3 months ago
2003
Springer
We propose a novel distinguishing attack on the shrinking generator with known feedback polynomial for the generating LFSR. The attack can e.g. reliably distinguish a shrinking gen...