Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/5/84; site stolaf.UUCP
Path: utzoo!watmath!clyde!cbosgd!ihnp4!stolaf!flackc
From: flackc@stolaf.UUCP (Chap Flack)
Newsgroups: net.math,net.crypt
Subject: factoring algorithms and RSA public key code
Message-ID: <5083@stolaf.UUCP>
Date: Mon, 10-Feb-86 10:53:50 EST
Article-I.D.: stolaf.5083
Posted: Mon Feb 10 10:53:50 1986
Date-Received: Wed, 12-Feb-86 20:46:33 EST
Distribution: net
Organization: St. Olaf College, Northfield MN
Lines: 11
Xref: watmath net.math:2822 net.crypt:519

*** ERCYNPR GUVF YVAR JVGU LBHE ZRFFNTR ***

I just gave my senior comps talk on the RSA public key
cipher, and after my talk, someone mentioned reading about
a new factoring algorithm which is very efficient (i.e.
much better than O(exp(sqrt(ln(n)*ln(ln(n)))))).

This, of course, would have devastating implications for
the security of the RSA code.  Anybody else know about this?
I think the person told me it had been developed by someone
at MIT.