RECYCLING RANDOM BITS IN PARALLEL

KATALIN FRIEDL, SHI-CHUN TSAI
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.
more » ... In the parallel version the integers involved are much shorter, and different segments of the pseudo-random bits are generated independently in parallel. Optimal speedup is also achieved. 1 1060-3425/95 $4.00 0 1995 IEEE
doi:10.1080/10637199608915545 fatcat:nkejqt36eve4rjzaqtwh6sosza