Author: Dan Andersson
Date: 12:46:27 10/28/03
Go up one level in this thread
There is one supposedly 'very' secure and simple random generator that I like
because of its simplicity and randomness. The only assumption made is that
factoring large integers is 'hard'. The Blum Blum Shub:
Xn+1 = (Xn)2 mod M where M is a product of two large primes. The O(log log
M) least significant bits are random. You can also use relatively low values for
M and use the parity of Xn as output for one bit at a time if large values are
unworkable.
It is not fast by any means ;) I believe there is an improved variation
published.
MvH Dan Andersson
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.