Extractors for Polynomial Sources over ๐”ฝ_2

09/20/2023
โˆ™
by   Eshan Chattopadhyay, et al.
โˆ™
0
โˆ™

We explicitly construct the first nontrivial extractors for degree d โ‰ฅ 2 polynomial sources over ๐”ฝ_2^n. Our extractor requires min-entropy kโ‰ฅ n - โˆš(log n)/(dloglog n)^d/2. Previously, no constructions were known, even for min-entropy kโ‰ฅ n-1. A key ingredient in our construction is an input reduction lemma, which allows us to assume that any polynomial source with min-entropy k can be generated by O(k) uniformly random bits. We also provide strong formal evidence that polynomial sources are unusually challenging to extract from, by showing that even our most powerful general purpose extractors cannot handle polynomial sources with min-entropy below kโ‰ฅ n-o(n). In more detail, we show that sumset extractors cannot even disperse from degree 2 polynomial sources with min-entropy kโ‰ฅ n-O(n/loglog n). In fact, this impossibility result even holds for a more specialized family of sources that we introduce, called polynomial non-oblivious bit-fixing (NOBF) sources. Polynomial NOBF sources are a natural new family of algebraic sources that lie at the intersection of polynomial and variety sources, and thus our impossibility result applies to both of these classical settings. This is especially surprising, since we do have variety extractors that slightly beat this barrier - implying that sumset extractors are not a panacea in the world of seedless extraction.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
โˆ™ 05/27/2022

Low-Degree Polynomials Extract from Local Sources

We continue a line of work on extracting random bits from weak sources t...
research
โˆ™ 07/08/2019

Santha-Vazirani sources, deterministic condensers and very strong extractors

The notion of semi-random sources, also known as Santha-Vazirani (SV) so...
research
โˆ™ 11/26/2022

Extractors for Images of Varieties

We construct explicit deterministic extractors for polynomial images of ...
research
โˆ™ 05/28/2019

Average Bias and Polynomial Sources

We identify a new notion of pseudorandomness for randomness sources, whi...
research
โˆ™ 04/11/2023

Optimizing Linear Correctors: A Tight Output Min-Entropy Bound and Selection Technique

Post-processing of the raw bits produced by a true random number generat...
research
โˆ™ 04/15/2018

An explicit two-source extractor with min-entropy near 4/9

In 2005 Bourgain gave the first explicit construction of a two-source ex...
research
โˆ™ 04/15/2018

An explicit two-source extractor with min-entropy rate near 4/9

In 2005 Bourgain gave the first explicit construction of a two-source ex...

Please sign up or login with your details

Forgot password? Click here to reset