Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: 64-Bit random numbers (getting rather off topic)

Author: Dan Andersson

Date: 13:31:45 10/28/03

Go up one level in this thread


 If I remember correctly the primes p and q should be congurent with 3 mod 4 to
be most effective. It has something to do with the quadratic residue having a
good property. And the GCD of phi(p-1) and phi(q-1) is to be as small as
possible to give a maximum period. Any numbers I have used are lost in time.
 Finding any periodicity with any reasonable amount of computation if those
criterion are fulfilled should only be possible iff Integer Factorization is
computationally easy. And the current bet is that it is hard as heck. The random
properties of the algorithm are bound to that single assumption.

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.