Author: Georg v. Zimmermann
Date: 14:49:40 10/28/03
Go up one level in this thread
the principle you describe is what is behind RSA encryption. Georg On October 28, 2003 at 17:08:52, Dan Andersson wrote: > It in fact has 'perfect' statistical properties as long as M is chosen big >enough for the problem domain. > I did a search and found this paper that both explains the theoretical >foundation of the X^2 mod N random generator and offers a practical >implementation fast enough for simulation. It will probably do a much better job >than I could do: >http://www.connotech.com/BBSINDEX.HTM > >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.