Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

23

FOCS
2007
IEEE

favoriteEmaildiscussreport

87views Theoretical Computer Science» more FOCS 2007»

Pseudorandom Bits for Polynomials

14 years 5 months ago

Pseudorandom Bits for Polynomials

Download projectamericano.com

We present a new approach to constructing pseudorandom generators that fool lowdegree polynomials over ﬁnite ﬁelds, based on the Gowers norm. Using this approach, we obtain the following main constructions of explicitly computable generators G : Fs → Fn that fool polynomials over a prime ﬁeld F:

Andrej Bogdanov, Emanuele Viola

Real-time Traffic

FOCS 2007 | Fool Polynomials | Gowers Norm | Pseudorandom Generators | Theoretical Computer Science |

claim paper

Related Content

» Pseudorandom generators for low degree polynomials

» Concrete Security of the BlumBlumShub Pseudorandom Generator

» Verifiable Random Functions from IdentityBased Key Encapsulation

» An Improved Pseudorandom Generator Based on Discrete Log

» Pseudorandomness from Braid Groups

» New Algorithms for Learning in Presence of Errors

» ForwardSecurity in PrivateKey Cryptography

» A Pseudorandom Bit Generator Based on Block Upper Triangular Matrices

» Altering a PseudoRandom Bit Sequence for ScanBased BIST

Post Info
More Details (n/a)

Added	02 Jun 2010
Updated	02 Jun 2010
Type	Conference
Year	2007
Where	FOCS
Authors	Andrej Bogdanov, Emanuele Viola

Comments (0)