Re: Mersenne: /. article

2002-02-28 Thread Nathan Russell
At 08:56 AM 2/27/2002 +, Brian J Beesley wrote: 1 an increase in the rate at which the NFS people are factoring awkward Mersenne numbers; I might point to the primenumbers Yahoogroup, which recently had a discussion to the effect that NFSnet might be restarting fairly soon Nathan

Re: Mersenne: /. article

2002-02-27 Thread Brian J. Beesley
On Wednesday 27 February 2002 05:07, you wrote: Well anything that can increase the speed of TF by even a wee amount is welcome by me. Unfortunately there is no impact on trial factoring. The technique suggested is an improvement requiring specialized hardware of a technique which is only

Re: Mersenne: /. article

2002-02-27 Thread Brian J. Beesley
On Wednesday 27 February 2002 19:28, Justin Valcourt wrote: Which brings up something that I just wondered about. As far as FFT operations go for LL and DC, if some crazy person who had millions to spend (ie we are talking pure theory here) to hire a chip maker, could a coprocessor be made

Mersenne: /. article

2002-02-26 Thread Henk Stokhorst
http://slashdot.org factoring breakthrough? YotN, Henk Stokhorst _ Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers

Re: Mersenne: /. article

2002-02-26 Thread Alexander Kruppa
That paper sounds like a genuine revolution. I have looked at two papers of Bernstein before, Prime Sieves Using Binary Quadratic Forms together with A.O.L. Atkin (algorithm a.k.a. Sieve of Atkin, implementation by Bernstein available under the name primegen), and How to Find Small Factors of

Re: Mersenne: /. article

2002-02-26 Thread bjb
On 26 Feb 2002, at 19:46, Henk Stokhorst wrote: http://slashdot.org factoring breakthrough? Doesn't look like a breakthrough, although there may be a very significant reduction in the amount of work required to factor awkward numbers. The implications in terms of public key cryptography

Re: Mersenne: /. article

2002-02-26 Thread Alexander Kruppa
[EMAIL PROTECTED] wrote: On 26 Feb 2002, at 19:46, Henk Stokhorst wrote: http://slashdot.org factoring breakthrough? Doesn't look like a breakthrough, although there may be a very significant reduction in the amount of work required to factor awkward numbers. The implications

Re: Mersenne: /. article

2002-02-26 Thread Justin Valcourt
Well anything that can increase the speed of TF by even a wee amount is welcome by me. _ Unsubscribe list info -- http://www.ndatech.com/mersenne/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers

Mersenne: Article about me and GIMPS

1998-09-29 Thread Aaron Blosser
There was an article in Monday's Rocky Mountain News about my case. I thought some of you here might find it interesting since our good friend George and Michael Lewis are quoted in the article. Plus there is a reference to the GIMPS home page. *Maybe* there will be more GIMPS members as a