Re: Security of RSA and factoring

Article View: sci.crypt

Article #3333

#3333

From: bs
Date: Sun, 18 Jan 1987 22:07

13 lines
1236 bytes

> One final note: a few months ago, someone posted that the fastest known
> algorithm for factoring large numbers is O(exp(sqrt(ln(n)lnln(n)))), and the
> current record is factoring a 71 digit number in 9.5 hours on a Cray XMP.
> 		-ed falk, sun microsystems
> terrorist, cryptography, DES, drugs, cipher, secret, decode, NSA, CIA, NRO.
 
That was the record in 1983. The current record is 87 digits on a Ethernet
Star Configuration of 10 SUN/3's running in parallel. Each ran for about
395 hours or a total of 3950 SUN/3 CPU hours. 

Adding 3 digits will approximately double the run time.

Bob Silverman

Technical Details

Message-ID: <348@linus.UUCP>

Path: arc1-ca.pugleaf.net!utzoo!watmath!clyde!rutgers!ames!ucbcad!ucbvax!decvax!linus!bs

References: <9041@duke.duke.UUCP> <4205@columbia.UUCP> <9054@duke.duke.UUCP> <11482@sun.uucp>

Show Full Headers

Complete Article Headers

Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: arc1-ca.pugleaf.net!utzoo!watmath!clyde!rutgers!ames!ucbcad!ucbvax!decvax!linus!bs
From: bs@linus.UUCP
Newsgroups: sci.crypt
Subject: Re: Security of RSA and factoring
Message-ID: <348@linus.UUCP>
Date: Sun, 18-Jan-87 17:07:03 EST
Article-I.D.: linus.348
Posted: Sun Jan 18 17:07:03 1987
Date-Received: Mon, 19-Jan-87 06:11:13 EST
References: <9041@duke.duke.UUCP> <4205@columbia.UUCP> <9054@duke.duke.UUCP> <11482@sun.uucp>
Organization: The MITRE Corp., Bedford, MA
Lines: 13
Keywords: Hah! Fat chance.
Summary: Factoring record info is 4 years out of date

Reply to Parent Message