Re: AES as hash function and PRNG

In article <d8jv26$9sk$1@nwrdmz03.dmz.ncs.ea.ibs-infra.bt.com>,
 Andrew Swallow <am.swallow@btopenworld.com> wrote:
> If you only need a few numbers you can use dice. A row can produce 2 bits.
>
> 1 = 01
> 2 = 10
> 3 = 11
> 4 = 00
> 5 = roll again
> 6 = roll again

Any problem with changing that to:

   ...
   5 = 1
   6 = 0

so that you always get at least one bit per poll?

-- 
--Tim Smith