CoChat

Extracting Randomness via Repeated Condensing

Reingold, Omer, Shaltiel, Ronen, Wigderson, Avi · 2006 · SIAM Journal on Computing

The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.

Abstract

Extractors (as defined by Nisan and Zuckerman) are procedures that use a small number of truly random bits (called the seed) to extract many (almost) truly random bits from arbitrary distributions as long as distributions have sufficient (min)-entropy. A natural weakening of an extractor is a condenser, whose output distribution has a higher entropy rate than the input distribution (without losing much of the initial entropy). An extractor can be viewed as an ultimate condenser because it outputs a distribution with the maximal entropy rate. In this paper we construct explicit condensers with short seed length. The condenser constructions combine (variants of or more efficient versions of) ideas from several works, including the block extraction scheme of [N. Nisan and D. Zuckerman, J. Comput. System Sci., 52 (1996), pp. 43-52], the observation made in [A. Srinivasanand D. Zuckerman, SIAM J. Comput., 28 (1999), pp. 1433-1459; N. Nisan and A. Ta-Shma, J. Comput. System Sci., 58 (1999), pp. 148-173] that a failure of the block extraction scheme is also useful, the recursive "win-win" case analysis of [R. Impagliazzo, R. Shaltiel, and A. Wigderson, Near-optimal conversion of hardness into pseudo-randomness, in Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, IEEE, Los Alamitos, CA, 1999, pp. 181-190; R. Impagliazzo, R. Shaltiel, and A. Wigderson, Extractors and pseudo-random generators with optimal seed length, in Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, ACM, New York, 2000, pp. 1-10], and the error correction of random sources used in [L. Trevisan, J. ACM, 48 (2001), pp. 860-879]. As a by-product (via repeated iterating of condensers), we obtain new extractor constructions. The new extractors give significant qualitative improvements over previous ones for sources of arbitrary min-entropy; they are nearly optimal simultaneously in the two main parameters of seed length and output length. Specifically, our extractors can make any one of these two parameters optimal (up to a constant factor) only at a polylogarithmic loss in the other. Previous constructions require polynomial loss in both cases for general sources. We also give a simple reduction converting "standard" extractors (which are good for an average seed) into "strong" ones (which are good for most seeds), with essentially the same parameters. With this reduction, all the above improvements apply to strong extractors as well.

Overview

Integrity signals

Registry

Crossref · 10.1137/s0097539703431032

Cites

13 of 13 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Show all 13 references

Research works printed but not linked: 18

  1. Michael Capalbo, Omer Reingold, Salil Vadhan, Avi Wigderson, Randomness conductors and constant‐degree lossless expanders, ACM, New York, 2002, 659–668MR2121193 · DOI · Paper page
  2. Oded Goldreich, Avi Wigderson, Tiny families of functions with random properties: a quality‐size trade‐off for hashing, Proceedings of the Workshop on Randomized Algorithms and Computation (Berkeley, CA, 1995), Vol. 11, 1997, 315–34310.1002/(SICI)1098-2418(199712)11:4<315:AID-RSA3>3.3.CO;2-D99f:68042 · doi:10.1002/(sici)1098-2418(199712)11:4<315::aid-rsa3>3.3.co;2-d
  3. Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson, Near‐optimal conversion of hardness into pseudo‐randomness, IEEE Computer Soc., Los Alamitos, CA, 1999, 181–190MR1917558 · doi:10.1109/sffcs.1999.814590
  4. Russell Impagliazzo, Ronen Shaltiel, Avi Wigderson, Extractors and pseudo‐random generators with optimal seed length, ACM, New York, 2000, 1–10MR2114511 · DOI
  5. Chi‐Jen Lu, Omer Reingold, Salil Vadhan, Avi Wigderson, Extractors: optimal up to constant factors, ACM, New York, 2003, 602–6112005k:68227 · DOI
  6. N. Nisan, Extracting randomness: How and why: A survey , in Proceedings of the Eleventh Annual IEEE Conference on Computational Complexity (Philadelphia, PA), IEEE, Los Alamitos, CA, 1996, pp. 44–58. · DOI
  7. Ran Raz, Omer Reingold, On recycling the randomness of states in space bounded computation, ACM, New York, 1999, 159–1682001i:68168 · DOI
  8. Ran Raz, Omer Reingold, Salil Vadhan, Error reduction for extractors, IEEE Computer Soc., Los Alamitos, CA, 1999, 191–201MR1917559 · DOI
  9. Omer Reingold, Ronen Shaltiel, Avi Wigderson, Extracting randomness via repeated condensing, IEEE Comput. Soc. Press, Los Alamitos, CA, 2000, 22–31MR1931801 · DOI
  10. Omer Reingold, Salil Vadhan, Avi Wigderson, Entropy waves, the zig‐zag graph product, and new constant‐degree expanders and extractors (extended abstract), IEEE Comput. Soc. Press, Los Alamitos, CA, 2000, 3–13MR1931799 · DOI
  11. Shaltiel Ronen, 2002, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, 67
  12. Ronen Shaltiel, Christopher Umans, Simple extractors for all min‐entropies and a new pseudo‐random generator, IEEE Computer Soc., Los Alamitos, CA, 2001, 648–657MR1948754 · doi:10.1109/sfcs.2001.959941
  13. Amnon Ta‐Shma, On extracting randomness from weak random sources (extended abstract), ACM, New York, 1996, 276–285MR1427523 · DOI
  14. Amnon Ta‐Shma, Christopher Umans, David Zuckerman, Loss‐less condensers, unbalanced expanders, and extractors, ACM, New York, 2001, 143–152MR2120310 · DOI
  15. Amnon Ta‐Shma, David Zuckerman, Shmuel Safra, Extractors from Reed‐Muller codes, IEEE Computer Soc., Los Alamitos, CA, 2001, 638–647MR1948753 · DOI
  16. von Neumann J., 1951, Nat. Bur. Standards Appl. Math. Ser., 12, 36
  17. David Zuckerman, General weak random sources, IEEE Comput. Soc. Press, Los Alamitos, CA, 1990, 534–54392k:65011 · DOI · Paper page
  18. David Zuckerman, Randomness‐optimal oblivious sampling, Proceedings of the Workshop on Randomized Algorithms and Computation (Berkeley, CA, 1995), Vol. 11, 1997, 345–36710.1002/(SICI)1098-2418(199712)11:4<345:AID-RSA4>3.3.CO;2-799a:68062 · doi:10.1002/(sici)1098-2418(199712)11:4<345::aid-rsa4>3.3.co;2-7

Cited by

See all 39

Metadata

Authors
Reingold, O., Shaltiel, R., & Wigderson, A.
Venue
SIAM Journal on Computing
Published
2006-01
Volume
35
Issue
5
Pages
1185-1209
ISSN
  • 0097-5397 (ISSN-L)
  • 1095-7111
OpenAlex
W2104669322
Cited by
39
References
13
Citations by year
2025: 1 · 2023: 1 · 2022: 3 · 2020: 1 · 2019: 2 · 2016: 3 · 2015: 1 · 2014: 4 · 2013: 4 · 2012: 4
FWCI
2.80
Type
journal article
Language
en
Open access
closed
Locations
SIAM Journal on Computing (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Computability, Logic, AI Algorithms
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
  • Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Limits and Structures in Graph Theory
Keywords
randomness extractors, condenser, min-entropy, seed length, pseudorandom number generators, entropy rate, explicit constructions

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: Extracting Randomness via Repeated Condensing. https://app.cochat.ai/papers/10.1137/s0097539703431032
The paper
Reingold, O., Shaltiel, R., & Wigderson, A. (2006). Extracting Randomness via Repeated Condensing. SIAM Journal on Computing. https://doi.org/10.1137/s0097539703431032

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.