[6052] in cryptography@c2.net mail archive

home help back first fref pref prev next nref lref last post

Re: Flannery on Cayley-Purser/RSA

daemon@ATHENA.MIT.EDU (bram)
Thu Nov 11 22:30:37 1999

Date: Thu, 11 Nov 1999 18:00:34 -0800 (PST)
From: bram <bram@gawth.com>
To: Jim Gillogly <jim@acm.org>
Cc: cryptography@c2.net
In-Reply-To: <382B434C.790156F7@acm.org>
Message-ID: <Pine.LNX.4.10.9911111757490.12851-100000@ultra.gawth.com>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII

On Thu, 11 Nov 1999, Jim Gillogly wrote:

> Wei Dai writes:
> > Is CP completely broken, or is there some variant of it that
> > is still unbroken?
> 
> It's completely broken. 

So what on earth was that claim of mathematically showing it was as strong
as RSA about? If breaking it doesn't result in a break of RSA, it must
have been of the typical voodoo hand-waving flavor.

> That's not to denigrate Flannery's work: she started from the
> assumption that the algorithm she'd been handed to work on was
> O.K. and did some good work optimizing its implementation.

That doesn't make the algorithm any more useful.

-Bram



home help back first fref pref prev next nref lref last post