47 search results - page 1 / 10 » Testing Low-Degree Polynomials over Prime Fields |
FOCS
2004
IEEE
13 years 8 months ago
2004
IEEE
We present an efficient randomized algorithm to test if a given function f : Fn p Fp (where p is a prime) is a low-degree polynomial. This gives a local test for Generalized Reed...
STOC
2005
ACM
14 years 5 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
13 years 4 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...
PKC
2000
Springer
13 years 8 months ago
2000
Springer
This paper gives a new example of exploiting the idea of using polynomials with restricted coefficients over finite fields and rings to construct reliable cryptosystems and identif...
FFA
2010
13 years 3 months ago
2010
