Extractors Using Hardness Amplification

DOI10.1007/978-3-642-03685-9_35MaRDI QIDQ3638898zbMATH OpenOpenAlexFDO

Authors Anindya De, Luca Trevisan

Publication date 28 October 2009

Published in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03685-9_35

zbMATH Keywords

direct product theoremsextractorshardness amplification

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Randomized algorithms (68W20)

Recommendations

• Extractors and pseudorandom generators
• Automata, Languages and Programming
• Simple extractors via constructions of cryptographic pseudo-random generators
• Simple extractors for all min-entropies and a new pseudorandom generator
• Construction of extractors using pseudo-random generators (extended abstract)

Cited in

(6)

• Improving the Hadamard extractor
• scientific article; zbMATH DE number 1543340 (Why is no real title available?)
• scientific article; zbMATH DE number 1776352 (Why is no real title available?)
• Randomness extraction in \(\mathsf{AC}^0\) and with small locality
• Non-malleable extractors: new tools and improved constructions
• Low-degree polynomials are good extractors

This page was built for publication: Extractors Using Hardness Amplification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638898)