Deterministic extractors for affine sources over large fields
Let \(\mathbb F\) be a finite field, and \(X\) be a random variable on \(\mathbb F^n\). \(X\) is a \((n, k)\)-affine source if it is uniformly distributed over a \(k\)-dimensional affine subspace of \(\mathbb F^n\). The authors show how to use \(X\) in order to generate distributions that are very close to the uniform one on the spaces of \(\mathbb F^{k-1}\) or even \(\mathbb F\). Two distributions \(P\) and \(Q\), on a finite probability space \(\Omega\), are \(\varepsilon\)-close if the statistical distance \(| P-Q| =\sum_{w \in \Omega}| \text{Pr}_P(w)-\text{Pr}_Q(w)| /2\) is less than \(\varepsilon\). A function \(D:\mathbb F_q^n \rightarrow \Omega\) is a deterministic \(k, \varepsilon\)-affine source extractor if for every \((n, k)_q\)-affine source \(X\) the distribution \(D(X)\) is \(\varepsilon\)-close to uniform. With this the authors have Theorem 1. There exists a constant \(q_0\) such that for any field \(\mathbb F_q\) and integers \(n, k\) with \(q > \max [q_0, n^{20}]\), there is an explicit deterministic \((k, \rho)\)-affine source extractor \(D:\mathbb F_q^n \rightarrow \mathbb F_q^{k-1}\), with \(\rho \leq q^{-1/21}\). Theorem 2. For any field \(\mathbb F_q\), integer \(n\) and \(\epsilon >0\), there is an explicit deterministic \((1, \varepsilon)\)-affine source extractor \(D:\mathbb F_q^n \rightarrow \{0, 1\}^d\), with \(d=\left\lfloor \log_2q-2\log_2(n/\varepsilon)-2\log_2\log_2q -4 \right\rfloor\). Two immediate applications are mentioned: (i) One can get \((1-\delta)\) fraction of randomness out of an affine source, where \(\delta >0\) arbitrary, provided that \(q >n^c\), where \(c\) depend on \(\delta\). (ii) With \(q \geq n^2\log_2^3n\) and \(\varepsilon =1/4\) the generator gives an explicit two-coloring of \(\mathbb F_q\) such that no line is monochromatic. The proofs rely on \textit{A. Weil}'s theorems [Proc. Natl. Acad. Sci. USA 34, 204--207 (1948; Zbl 0032.26102)], and the Xor lemma of Vazirani, see e.g. \textit{A. Elbaz} [Improved constructions for extracting quasi-random bits from sources of weak randomness. MSc Thesis, Weizmann Institute (2003)].
- Extractors for Polynomials Sources over Constant-Size Fields of Small Characteristic
- Extractors for polynomial sources over fields of constant order and small characteristic
- Affine dispersers from subspace polynomials
- Affine extractors over large fields with exponential error
- Deterministic extractors for additive sources (extended abstract)
- A Constructive Solution to a Tournament Problem
- Addendum to “simple constructions of almost k-wise independent random variables”
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Construction of extractors using pseudo-random generators (extended abstract)
- Deterministic Extractors for Bit‐Fixing Sources and Exposure‐Resilient Cryptography
- Deterministic Extractors for Bit‐Fixing Sources by Obtaining an Independent Seed
- Equations over finite fields. An elementary approach
- Extracting all the randomness and reducing the error in Trevisan's extractors
- Extracting Randomness Using Few Independent Sources
- Extracting randomness: A survey and new constructions
- Extractors from Reed-Muller codes
- Extractors with weak random seeds
- Generating quasi-random sequences from semi-random sources
- scientific article; zbMATH DE number 1820017 (Why is no real title available?)
- scientific article; zbMATH DE number 863501 (Why is no real title available?)
- On Some Exponential Sums
- On the construction of affine extractors
- Randomness is linear in space
- Regularity and Positional Games
- Simple extractors for all min-entropies and a new pseudorandom generator
- Simulating BPP using a general weak random source
- Simulating independence
- Strong communication complexity or generating quasi-random sequences from two communicating semi-random sources
- Theory of Cryptography
- Unbiased Bits from Sources of Weak Randomness and Probabilistic Communication Complexity
- Improving the Hadamard extractor
- Extractors for varieties
- How to extract useful randomness from unreliable sources
- Non-malleability against polynomial tampering
- Succinct non-interactive arguments via linear interactive proofs
- Construction of irreducible polynomials through rational transformations
- Jacobian hits circuits: hitting sets, lower bounds for depth-D occur-k formulas and depth-3 transcendence degree-k circuits
- Deterministic extractors for additive sources (extended abstract)
- An introduction to randomness extractors
- Increasing the output length of zero-error dispersers
- Affine dispersers from subspace polynomials
- Extractors for Polynomials Sources over Constant-Size Fields of Small Characteristic
- Extractors for polynomial sources over fields of constant order and small characteristic
- Deterministic randomness extraction from generalized and distributed Santha-Vazirani sources
- From affine to two-source extractors via approximate duality
- Affine extractors over large fields with exponential error
- How to get more mileage from randomness extractors
- Increasing the Output Length of Zero-Error Dispersers
- scientific article; zbMATH DE number 7009617 (Why is no real title available?)
- Variety evasive sets
- Deterministic Extractors for Bit‐Fixing Sources by Obtaining an Independent Seed
- Extractors and lower bounds for locally samplable sources
- scientific article; zbMATH DE number 7706045 (Why is no real title available?)
- Extractors and rank extractors for polynomial sources
- Affine extractors over prime fields
- Towards dimension expanders over finite fields
- Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in
- Variety evasive subspace families
- Two-source and affine non-malleable extractors for small entropy
- Extractors for polynomial sources over \(\mathbb{F}_2\)
- Hitting sets for orbits of circuit classes and polynomial families
- Constructing faithful homomorphisms over fields of finite characteristic
- Bit-fixing extractors for almost-logarithmic entropy
- On the construction of affine extractors
This page was built for publication: Deterministic extractors for affine sources over large fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390150)