From: David Mazieres <dm@amsterdam.lcs.mit.edu>
Date: Sat, 27 Apr 1996 14:03:35 +0800
To: perry@piermont.com
Subject: Re: Golden Key Campaign
In-Reply-To: <199604251810.LAA17469@netcom9.netcom.com>
Message-ID: <199604262210.SAA27467@amsterdam.lcs.mit.edu>
MIME-Version: 1.0
Content-Type: text/plain


In article <199604251927.PAA27960@jekyll.piermont.com> "Perry E. Metzger" <perry@piermont.com> writes:

> From: "Perry E. Metzger" <perry@piermont.com>
> cc: Bill Stewart <stewarts@ix.netcom.com>, cypherpunks@toad.com
> Date: Thu, 25 Apr 1996 15:27:04 -0400
> Reply-To: perry@piermont.com
> X-From-Line: cypherpunks-errors@toad.com  Thu Apr 25 20:07:52 1996
> X-Authentication-Warning: jekyll.piermont.com: Host perry@localhost didn't use HELO protocol
> X-Reposting-Policy: redistribute only with permission
> Sender: owner-cypherpunks@toad.com
> Precedence: bulk
> Lines: 11
> Xref: amsterdam.lcs.mit.edu cypherpunks:8797
> 
> 
> Bill Frantz writes:
> > I will add to Bill's list:
> > 
> > 7) RSA is the best known and vetted of the Public Key algorithms.
> 
> Nota at all, Mr. Frantz. There are no proofs of security associated
> with RSA. Rabin has excellent proofs that breaking a message is
> strictly equivalent to factoring.

Isn't Rabin's algorithm patented, too?  Perhaps the licensing terms
are better.  Does anyone know for sure?

Thanks,
David