Construction of extractors using pseudo-random generators (extended abstract)
Open accessThe DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
We introduce a new approach to construct extractors.Extractors are algorithms that transform a "weakly random" distribution into au almost uniform distribution.Explicit constructions of extractors have a variety of important applications, and tend to be very difficult to achieve.We demonstrate an unsuspected connection between extractors and pseudorandom generators.In fact, we show that every pseudorandom generator of a certain kind is an extractor.A pseudprandom generator construction due to Impagliazzo and Wigderson, once reinterpreted via our connection, is already an extractor that beats most known constructions and solves an important open question.We also show that, using the simpler Nisan-Wigderson generator and standard error-correcting codes, one can build even better extractors with the additional advantage that both the construction and the analysis are extremely simple and admit a short self-contained treatment.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Generating quasi-random sequences from semi-random sources
Santha, M., & Vazirani, U. V. (1986) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(86)90044-9 · Cited by 256
Cited by
Information-Theoretic Key Agreement: From Weak to Strong Secrecy for Free
Maurer, U., & Wolf, S. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45539-6_24 · Cited by 483
Pseudorandom Generators without the XOR Lemma
Sudan, M., Trevisan, L., & Vadhan, S. (2001) · Journal of Computer and System Sciences · doi:10.1006/jcss.2000.1730 · Cited by 393
Self-citationExtracting all the randomness and reducing the error in Trevisan's extractors
Raz, R., Reingold, O., & Vadhan, S. (1999) · Proceedings of the thirty-first annual ACM symposium on Theory of Computing · doi:10.1145/301250.301292 · Cited by 171
Quantum-Proof Randomness Extractors via Operator Space Theory
Berta, M., Fawzi, O., & Scholz, V. B. (2017) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2627531 · Cited by 12
Variations on classical and quantum extractors
Berta, M., Fawzi, O., Scholz, V., & Szehr, O. (2014) · 2014 IEEE International Symposium on Information Theory · doi:10.1109/isit.2014.6875078 · Cited by 10
“(10) However, for applications we usually want explicit extract ors and starting with Trevisan’s breakthrough result [28] ther e a e now many constructions that almost achieve the bounds above (see [29] and references therein).”
Background
Metadata
- Authors
- Trevisan, L.
- Venue
- Proceedings of the thirty-first annual ACM symposium on Theory of Computing
- Publisher
- ACM
- Published
- 1999-05
- Pages
- 141-148
- OpenAlex
- W2073136473
- Cited by
- 73
- References
- 1
- FWCI
- 9.79
- Type
- conference paper
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Construction of extractors using pseudo-random generators (extended abstract). https://app.cochat.ai/papers/10.1145/301250.301289
- The paper
- Trevisan, L. (1999). Construction of extractors using pseudo-random generators (extended abstract). Proceedings of the thirty-first annual ACM symposium on Theory of Computing. https://doi.org/10.1145/301250.301289
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.