Pseudorandom generators for low degree polynomials Andrej Bogdanov∗ March 3, 2005 Abstract We investigate constructions of pseudorandom generators that fool polynomial tests of degree d in m variables over finite field

Source URL: www.cse.cuhk.edu.hk

Pseudorandom bits for polynomials Andrej Bogdanov∗ Emanuele Viola† August 10, 2007

Source URL: projectamericano.com

• Abstract algebra
• Quadratic polynomial
• Irreducible polynomial
• Finite field
• Pseudorandom generator
• Pseudorandom generators for polynomials
• Degree of a polynomial
• Polynomials
• Mathematics
• Algebra

TUGboat, Volume[removed]), No. 1 to show off. And reader contributions for this column are still welcome! o Victor Eijkhout Department of Computer Science University of Tennessee at

Source URL: tug.org

• Binary arithmetic
• Field theory
• Primitive polynomial
• Stream ciphers
• Linear feedback shift register
• Pseudorandom number generators
• Mathematics
• Polynomials

The sum of d small-bias generators fools polynomials of degree d Emanuele Viola∗

Source URL: www.ccs.neu.edu

• Polynomials
• Pseudorandomness
• Orthogonal polynomials
• Algorithmic information theory
• Pseudorandom generator
• Finite field
• Pseudorandom generators for polynomials
• Factorization of polynomials over a finite field and irreducibility tests
• Mathematics
• Abstract algebra
• Algebra

Unconditional Pseudorandom Generators for Low-Degree Polynomials

Source URL: www.theoryofcomputing.org

• Applied mathematics
• Pseudorandomness
• Algorithmic information theory
• Pseudorandom generator
• Orthogonal polynomials
• Degree of a polynomial
• Dickson polynomial
• Schwartz–Zippel lemma
• Mathematics
• Polynomials
• Theoretical computer science