Using SHA1 as RNG

Irmen de Jong irmen at -NOSPAM-REMOVE-THIS-xs4all.nl
Fri Mar 14 20:33:14 CET 2003


Klaus Alexander Seistrup wrote:
>>Even if the hash doesn't repeat itself, you still get a 100%
>>predictible sequence of numbers because the SHA algorithm is
>>repeatable.
> 
> 
> But the same goes for the original Wichmann-Hill generator, doesn't
> it?

Umm.. perhaps. I don't know that much about strong random number
generators. Can anybody enlighten me (us)?

> But to predict the sequence of the SHARandom generator you would need
> to know the three initial seeds plus all of the intermediate values,
> and the number of steps taken, wouldn't you?

I think you're right about this one.

--Irmen





More information about the Python-list mailing list