A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
RECYCLING RANDOM BITS IN PARALLEL
1996
Parallel Algorithms and Applications
We show that r pseudo-random bits can be obtained by concatenating t blocks of r/t pseudo-random bits, where the blocks are generated in parallel. This can be considered as a parallel version of [a] -recycling random bits by doing a random walk on an expander. The proof is based on the fact that t simultaneous independent random walks on an expander graph is equivalent to a random walk on a much larger expander. In [8] generating the random walk requires arithmetic operation with long integers.
doi:10.1080/10637199608915545
fatcat:nkejqt36eve4rjzaqtwh6sosza