From eichin@cygnus.com Thu Mar 12 06:29:45 1992 Received: by E40-PO.MIT.EDU (5.45/4.7) id AA18483; Thu, 12 Mar 92 06:27:31 EST Received: from cygnus.com by MIT.EDU with SMTP id AA02300; Thu, 12 Mar 92 06:27:23 EST Received: from tweedledumber.cygnus.com by cygnus.com (4.1/SMI-4.1) id AA25730; Thu, 12 Mar 92 03:27:12 PST Received: by tweedledumber.cygnus.com (4.1/4.7) id AA13133; Thu, 12 Mar 92 06:26:28 EST Date: Thu, 12 Mar 92 06:26:28 EST From: "Mark W. Eichin" Message-Id: <9203121126.AA13133@tweedledumber.cygnus.com> To: eichin@MIT.EDU Subject: [pmontgom@euphemia.math.ucla.edu: Re: looking for parallel number factoring algorithms] SUB: [pmontgom@euphemia.math.ucla.edu: Re: looking for parallel number factoring algorithms] SUM: "Mark W. Eichin" ->eichin bib entry To: Cryptography-Digest@news-digests.mit.edu From: pmontgom@euphemia.math.ucla.edu (Peter Montgomery) Subject: Re: looking for parallel number factoring algorithms Date: Thu, 12 Mar 92 00:38:17 GMT SUB: Re: looking for parallel number factoring algorithms SUM: pmontgom@euphemia.math.ucla.edu (Peter Montgomery)->Cryptography-Digest@news-digests.mit.edu In article <1992Mar9.130422.11618@hubcap.clemson.edu> zippy@chaos.cs.brandeis.edu (Patrick Tufts) writes: >I'm looking for parallel number factoring algorithms. Actual code >is fine, as are any references to the literature. See Richard P. Brent, "Parallel Algorithms for Integer Factorization", Research Report CMA-R49-89, Computer Sciences Laboratory, The Australian National University, GPO Box 4, Canberra ACT 2601, Australia, October, 1989. He argues that there is little potential parallelism in P-1 and Pollard Rho, but plenty in trial division, ECM, and MPQS. In article <1992Mar10.135511.6288@linus.mitre.org> bs@linus.mitre.org (Robert D. Silverman) writes: >Let me also say, regarding the challenge contest, that anyone who uses >someone ELSE's computers [e.g. a student using University computers or >an employee using company computers] probably is NOT entitled to receive >money from the contest, because you won the award using someone else's >equipment. In fact, the people who have done the most work on the RSA >challenge contest [A. Lenstra et.al.], are to the best of my knowledge >donating their winnings to charity. I don't know if Peter Montgomery >is keeping his winnings. He is using UCLA computers [but his own >code. He has the best ecm implementation of anyone. It is superb.]. >He may have an agreement with UCLA. I don't know. My winnings ($590) have gone to the UCLA Mathematics Department. Nonetheless, UC registration fees increased 40% this academic year and will do so again next year. If you want a copy of my dissertation "An FFT Extension to the Elliptic Curve Method of Factorization" and didn't request it last month, please send me your postal address as it will be in late April, 1992. -- Peter L. Montgomery Internet: pmontgom@math.ucla.edu Department of Mathematics, UCLA, Los Angeles, CA 90024-1555 USA I've solved USENET problems and want to solve yours. I'll complete my PhD in March, 1992. Interested in computer performance and number theory.