Re: AES as hash function and PRNG
Available news archives: comp.lang.tcl - comp.lang.python - comp.security.firewalls - sci.crypt - comp.lang.php - comp.lang.javascript
Google
 
Web news.hping.org


sci.crypt archive

Re: AES as hash function and PRNG

From: Volker Hetzer <volker.hetzer@ieee.org>
Date: Tue Jun 14 2005 - 17:23:49 CEST



Tim Smith wrote:


> 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?


Yes, then 01 and 00 happen twice as often as the other values.



Lots of Greetings!


Volker


Received on Thu Sep 29 21:43:46 2005