Author: Dan Andersson
Date: 15:26:37 10/28/03
Go up one level in this thread
They are very similar indeed. Xn+1=(Xn)^2 mod pq and C=(T^E) mod PQ. And they both rely on the integer factorization complexity. 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.