Sciweavers

7 search results - page 1 / 2
» Pseudorandom generators for low degree polynomials
Sort
View
ECCC
2007
100views more  ECCC 2007»
13 years 4 months ago
Unconditional pseudorandom generators for low degree polynomials
Abstract: We give an explicit construction of a pseudorandom generator against lowdegree polynomials over finite fields. Pseudorandom generators against linear polynomials, known...
Shachar Lovett
STOC
2005
ACM
144views Algorithms» more  STOC 2005»
14 years 5 months ago
Pseudorandom generators for low degree polynomials
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...
Andrej Bogdanov
ECCC
2010
104views more  ECCC 2010»
13 years 5 months ago
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...
Shachar Lovett, Partha Mukhopadhyay, Amir Shpilka
EUROCRYPT
2003
Springer
13 years 10 months ago
Predicting the Shrinking Generator with Fixed Connections
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...
Patrik Ekdahl, Willi Meier, Thomas Johansson
FOCS
1989
IEEE
13 years 9 months ago
Constant Depth Circuits, Fourier Transform, and Learnability
In this paper, Boolean functions in ,4C0 are studied using harmonic analysis on the cube. The main result is that an ACO Boolean function has almost all of its “power spectrum”...
Nathan Linial, Yishay Mansour, Noam Nisan