Take the tour ×  Throwing normal dice, one can get sequences of
digits in [0,5]. Which is the best procedure in practice to
transform such sequences into bit sequences desired?
share|improve this question This previous question may be
relevant. –  Thomas Jan 30 at 21:40 Perhaps I should add that an
example of a "practical" question would be: If a random number
in [0, 2^1024-1] is required, how should one best go about to
generate it as a bit sequence through throwing normal dice? – 
Mok-Kong Shen Jan 30 at 22:07 You could always discard die rolls
corresponding to 4 and 5. Then each die roll produces two bits
of entropy. –  Stephen Touset Jan 30 at 23:20 How best to ?
Slowly. –  Cris Stringfellow Jan 31 at 2:33 add comment  3
Answers  The obvious approach is to consider the following bit
extraction algorithm:    1. Roll the die, producing an integer
$n$ uniform in $\mathbb{Z}_6$.    2. If $n < 4$, return $n$ as
two bits. Otherwise, go to 1.  This will return two uniform
bits. The algorithm will always termina