## How to Recycle Random Bits (1989)

Citations: | 179 - 11 self |

### BibTeX

@INPROCEEDINGS{Impagliazzo89howto,

author = {Russell Impagliazzo and David Zuckerman},

title = {How to Recycle Random Bits},

booktitle = {},

year = {1989},

pages = {248--253},

publisher = {IEEE}

}

### Years of Citing Articles

### OpenURL

### Abstract

We show that modified versions of the linear congruential generator and the shift register generator are provably good for amplifying the correctness of a probabilistic algorithm. More precisely, if r random bits are needed for a BPP algorithm to be correct with probability at least 2=3, then O(r + k 2 ) bits are needed to improve this probability to 1 \Gamma 2 \Gammak . We also present a different pseudo-random generator that is optimal, up to a constant factor, in this regard: it uses only O(r + k) bits to improve the probability to 1 \Gamma 2 \Gammak . This generator is based on random walks on expanders. Our results do not depend on any unproven assumptions. Next we show that our modified versions of the shift register and linear congruential generators can be used to sample from distributions using, in the limit, the information-theoretic lower bound on random bits. 1. Introduction Randomness plays a vital role in almost all areas of computer science, both in theory and in...