## Extracting All the Randomness from a Weakly Random Source (1998)

### Cached

### Download Links

- [www.lcs.mit.edu]
- [www.lcs.mit.edu]
- [publications.csail.mit.edu]
- [www.lcs.mit.edu]
- [publications.csail.mit.edu]
- [www.cs.utexas.edu]
- DBLP

### Other Repositories/Bibliography

Citations: | 6 - 0 self |

### BibTeX

@MISC{Vadhan98extractingall,

author = {Salil Vadhan},

title = {Extracting All the Randomness from a Weakly Random Source},

year = {1998}

}

### OpenURL

### Abstract

In this paper, we give two explicit constructions of extractors, both of which work for a source of any min-entropy on strings of length n. The first extracts any constant fraction of the min-entropy using O(log 2 n) additional random bits. The second extracts all the min-entropy using O(log 3 n) additional random bits. Both constructions use fewer truly random bits than any previous construction which works for all min-entropies and extracts a constant fraction of the min-entropy. The extractors are obtained by observing that a weaker notion of "combinatorial design" suffices for the Nisan--Wigderson pseudorandom generator [NW94], which underlies the recent extractor of Trevisan [Tre98]. We give near-optimal constructions of such "weak designs" which achieve much better parameters than possible with the notion of designs used by Nisan--Wigderson and Trevisan. 1 Introduction Roughly speaking, an extractor is a function which extracts truly random bits from a weakly random source,...