Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!swrinde!zaphod.mps.ohio-state.edu!sdd.hp.com!samsung!xylogics!merk!alliant!linus!bs From: bs@linus.mitre.org (Robert D. Silverman) Newsgroups: comp.theory Subject: Re: factoring a large prime Keywords: factor prime Message-ID: <113487@linus.mitre.org> Date: 16 Jul 90 15:42:18 GMT References: <1519@excelan.COM> Reply-To: bs@gauss.UUCP (Robert D. Silverman) Organization: The MITRE Corporation, Bedford MA Lines: 29 In article <1519@excelan.COM> avnish@ka.excelan.com (Avnish Aggarwal) writes: :I read a report recently about how it is that a large (152 digit) :number had been factored using the combined resources of :something like 1000 computers. : :I would like to know more about this "parallel algorithm" :that permits all these computers to simultaneously work on the :same problem and is then able to merge the results. : :(Factoring algoirthms I am aware of all work is a serial fasion.) :UUCP: {ames,sun,apple,mtxinu,cae780,sco}!excelan!avnish Avnish Aggarwal :Internet: avnish@ka.excelan.com See the following: T. Caron & R. Silverman Parallel Implementation of the Quadratic Sieve J. Supercomputing V. 1 #3, 1988 pp. 273-290 The algorithm used to factor F9, the 155 digit number just factored was the Number Field Sieve, rather than the Quadratic Sieve, but its parallel implementation is identical. -- Bob Silverman #include Mitre Corporation, Bedford, MA 01730 "You can lead a horse's ass to knowledge, but you can't make him think"