Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!linus!philabs!cmcl2!lanl!jlg
From: jlg@lanl.ARPA (Jim Giles)
Newsgroups: net.math,net.crypt
Subject: Re: factoring algorithms and RSA public key code
Message-ID: <1245@lanl.ARPA>
Date: Tue, 18-Feb-86 21:21:10 EST
Article-I.D.: lanl.1245
Posted: Tue Feb 18 21:21:10 1986
Date-Received: Wed, 19-Feb-86 20:44:40 EST
References: <5083@stolaf.UUCP> <1404@panda.UUCP> <476@faron.UUCP>
Reply-To: jlg@a.UUCP (Jim Giles)
Distribution: net
Organization: Los Alamos National Laboratory
Lines: 17
Xref: linus net.math:2489 net.crypt:514

In article <476@faron.UUCP> bs@faron.UUCP (Robert D. Silverman) writes:
>... The current record for factoring a number with two large prime
>factors is the 71 digit number (10^71-1)/9. It was done in 9.5 hours
>on a CRAY XMP in 1984 by a group of mathematicians at Sandia Labs.
>....
>Bob Silverman

A minor correction: the number was factored on an X/MP-24 here at
Los Alamos.  The Sandia team wrote the code.  (I had a very slight
interest in this - I rewrote the Fortran intrinsic MOD function
for this code to gain a 5% speed-up.)

J Giles
Los Alamos

(10^71 - 1)/9 =       241,573,142,393,627,673,576,957,439,049 *
	       45,994,811,347,886,846,310,221,728,895,223,034,301,839