Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!uunet!seismo!mimsy!lls
From: lls@mimsy.UUCP (Lauren L. Smith)
Newsgroups: sci.math,sci.crypt
Subject: Re: New Factoring Record
Message-ID: <7876@mimsy.UUCP>
Date: Thu, 6-Aug-87 08:07:45 EDT
Article-I.D.: mimsy.7876
Posted: Thu Aug  6 08:07:45 1987
Date-Received: Sat, 8-Aug-87 09:55:18 EDT
References: <10489@linus.UUCP>
Organization: U of Maryland, Dept. of Computer Science, Coll. Pk., MD 20742
Lines: 17
Summary: Speed, Factoring, Machine
Xref: mnetor sci.math:1761 sci.crypt:513

In article <10489@linus.UUCP>, bs@linus.UUCP (Robert D. Silverman) writes:
> I have just established two new factoring records.
>  
> It was factored by a parallel version of the Multiple Polynomial Quadratic
> Sieve (MPQS) and is the largest number ever factored by a general purpose
> algorithm.

Impressive.  I'm interested in parallel algorithms and am wondering about
a couple of things - How long did the factoring take?  What parallel
machine did you run?  Did the algorithm exploit fine-grained parallelism
or large-grained or both?  Do you have any idea of the speedup? Although
I'm sure that is an irrelevant question, because the algorithm probably
would take years on a single processor....

- Lauren Smith

ARPA: lls@mimsy.umd.edu