Deterministic extractors for affine sources over large fields
From MaRDI portal
Publication:2390150
DOI10.1007/S00493-008-2259-3zbMATH Open1174.05117OpenAlexW2091564680MaRDI QIDQ2390150FDOQ2390150
Recommendations
- 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)
Cites work
- scientific article; zbMATH DE number 1820017 (Why is no real title available?)
- scientific article; zbMATH DE number 863501 (Why is no real title available?)
- 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 Randomness Using Few Independent Sources
- Extracting all the randomness and reducing the error in Trevisan's extractors
- 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
- 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
Cited in
(29)- Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in
- Increasing the output length of zero-error dispersers
- Deterministic Extractors for Bit‐Fixing Sources by Obtaining an Independent Seed
- Jacobian hits circuits: hitting sets, lower bounds for depth-\(D\) occur-\(k\) formulas and depth-3 transcendence degree-\(k\) circuits
- Extractors and lower bounds for locally samplable sources
- How to extract useful randomness from unreliable sources
- Affine extractors over prime fields
- Variety evasive subspace families
- An introduction to randomness extractors
- How to get more mileage from randomness extractors
- Succinct non-interactive arguments via linear interactive proofs
- Affine extractors over large fields with exponential error
- From affine to two-source extractors via approximate duality
- Extractors and rank extractors for polynomial sources
- scientific article; zbMATH DE number 7706045 (Why is no real title available?)
- Non-malleability against polynomial tampering
- Increasing the Output Length of Zero-Error Dispersers
- Variety evasive sets
- scientific article; zbMATH DE number 7009617 (Why is no real title available?)
- Deterministic extractors for additive sources (extended abstract)
- Construction of irreducible polynomials through rational transformations
- Towards dimension expanders over finite fields
- Improving the Hadamard extractor
- Affine dispersers from subspace polynomials
- Extractors for Polynomials Sources over Constant-Size Fields of Small Characteristic
- Deterministic randomness extraction from generalized and distributed Santha-Vazirani sources
- Extractors for varieties
- Extractors for polynomial sources over fields of constant order and small characteristic
- 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)
