Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!seismo!lll-lcc!mordor!styx!ames!ucbcad!ucbvax!ernie.Berkeley.EDU!tedrick
From: tedrick@ernie.Berkeley.EDU (Tom Tedrick)
Newsgroups: sci.crypt
Subject: Re: Security of RSA and factoring
Message-ID: <16847@ucbvax.BERKELEY.EDU>
Date: Wed, 14-Jan-87 00:44:02 EST
Article-I.D.: ucbvax.16847
Posted: Wed Jan 14 00:44:02 1987
Date-Received: Wed, 14-Jan-87 19:30:11 EST
References: <9041@duke.duke.UUCP> <4205@columbia.UUCP> <9054@duke.duke.UUCP>
Sender: usenet@ucbvax.BERKELEY.EDU
Reply-To: tedrick@ernie.Berkeley.EDU.UUCP (Tom Tedrick)
Organization: University of California, Berkeley
Lines: 8
Keywords: Hah! Fat chance.

>The point about RSA is that if you can break the code, you can get
>the factorization of the key (this is easy to do).

False.

If you can give me an algorithm that will do this efficiently
I will eat my words (but send it to me secretly by email so I
can publish it :-)