Optimal Pseudorandom Generators for Low-Degree Polynomials Over Moderately Large Fields
We construct explicit pseudorandom generators that fool $ n $-variate polynomials of degree
at most $ d $ over a finite field $\mathbb {F} _q $. The seed length of our generators is $ O
(d\log n+\log q) $, over fields of size exponential in $ d $ and characteristic at least $ d (d-1)+
1$. Previous constructions such as Bogdanov's (STOC 2005) and Derksen and Viola's
(FOCS 2022) had either suboptimal seed length or required the field size to depend on $ n
$. Our approach follows Bogdanov's paradigm while incorporating techniques from Lecerf's …
at most $ d $ over a finite field $\mathbb {F} _q $. The seed length of our generators is $ O
(d\log n+\log q) $, over fields of size exponential in $ d $ and characteristic at least $ d (d-1)+
1$. Previous constructions such as Bogdanov's (STOC 2005) and Derksen and Viola's
(FOCS 2022) had either suboptimal seed length or required the field size to depend on $ n
$. Our approach follows Bogdanov's paradigm while incorporating techniques from Lecerf's …
We construct explicit pseudorandom generators that fool -variate polynomials of degree at most over a finite field . The seed length of our generators is , over fields of size exponential in and characteristic at least . Previous constructions such as Bogdanov's (STOC 2005) and Derksen and Viola's (FOCS 2022) had either suboptimal seed length or required the field size to depend on . Our approach follows Bogdanov's paradigm while incorporating techniques from Lecerf's factorization algorithm (J. Symb. Comput. 2007) and insights from the construction of Derksen and Viola regarding the role of indecomposability of polynomials.
arxiv.org