On Thu, Nov 11, 1999 at 12:21:44PM -0500, John Young wrote:
> Thanks to Jean-Jacques Quisquater and Jean-Fran�ois Misarsky
> we offer Sarah Flannery's September 1999 paper on the Cayley-Purser
> Algorithm and her comparison of it to the security and speed of RSA:
The equations in the scanned paper are not very readable. Would it be
possible to get the paper rescanned in grayscale or at a different contrast
setting?
Question for people who can figure out the equations: The conclusion says
"the CP algorithm is as secure as the RSA Algorithm" but then the
postscript goes on to say "Thus the system as originally set out is
'broken'". Assuming RSA has not been broken, these two statements seem
contradictory. Is CP completely broken, or is there some variant of it that
is still unbroken?
