20051107, 17:34  #1  
Bamboozled!
"πΊππ·π·π"
May 2003
Down not across
2·61·83 Posts 
RSA640 factored
Apologies if this has been seen elsewhere. I've only just returned from a 4day trip to find the mail below in my inbox.
Another impressive result from Franke et al. Quote:
Paul 

20051107, 19:52  #2 
Aug 2004
New Zealand
3·73 Posts 
Yep, congratulation to Franke et al. again!
I believe the all time top 10 for GNFS is now: Code:
RSA200 2005 2799 C200=P100*P100 GNFS Bahr/Franke/Kleinjung/et al. RSA640 2005 3107 C193=P98*P98 GNFS Bahr/Franke/Kleinjung/et al. 11^281+1 2005 1009 C176=P87*P89 GNFS Aoki/Kida/Shimoyama/Ueda RSA576 2003 1881 C174=P87*P87 GNFS Bahr/Franke/Kleinjung/Montgomery/te Riele/Leclair/Leyland/Wackerbarth 2^1826+1 2003 9758 C164=P68*P97 GNFS Aoki/Kida/Shimoyama/Sonoda/Ueda RSA160 2003 2152 C160=P80*P80 GNFS Bahr/Franke/Kleinjung/Lochter/Bohm 2^953+1 2002 3950 C158=P73*P86 GNFS Bahr/Franke/Kleinjung RSA155 1999 1094 C155=P78*P78 GNFS te Riele/CWI et al. Code Book 2000 1074 C155=P78*P78 GNFS Almgren/Andersson/Granlund/Ivansson/Ulfberg HP49(95) 2003 2651 C153=P68*P85 GNFS Kruppa/Leyland 
20051107, 20:03  #3 
Jun 2003
3047_{8} Posts 
WHat program do you use for GNFS?
Citrix 
20051107, 20:10  #4  
Aug 2004
New Zealand
3×73 Posts 
Quote:
For these record breakers, Franke et al. almost certainly had to make several modifications to their own code. You need to start with something smaller than these record breakers, say in the range C110C135. The GGNFS implementation is probably a good place to start (although I haven't used it myself). 

20051107, 20:20  #5  
Jun 2003
3^{2}·5^{2}·7 Posts 
Quote:
Are there any binaries for windows? Citrix 

20051107, 20:24  #6  
"Mark"
Apr 2003
Between here and the
5,953 Posts 
Quote:


20051107, 20:42  #7 
Aug 2003
Europe
193 Posts 
Congrats to F. Bahr, M. Boehm, J. Franke, T. Kleinjung.
But running a cluster of 80 2.2 GHz Opterons can be a bit of energy consumption. But they also used the cluster in the solving of the matrix? Will this mean that they made a good matrix solving piece of code that spreads good on clusters? I am curious about their code. 
20051107, 21:39  #8  
Nov 2003
2^{6}·113 Posts 
Quote:
sieving...... 

20051108, 00:07  #9 
Oct 2005
Italy
3×113 Posts 
RSA 640 factored ?
A distributed computing project tried to solve it (http://www.primegrid.com). now they must change work ... 
20051108, 03:56  #10  
Aug 2002
2^{6}·5 Posts 
Quote:


20051108, 11:14  #11  
Bamboozled!
"πΊππ·π·π"
May 2003
Down not across
2×61×83 Posts 
Quote:
I'm sure they could have got the LA time down substantially if they had spent more sieving. However, they would have had an even harder time with the data handling and filtering. Asymptotically the sieving and LA times should be equal. I don't believe that RSA640 is anywhere near big enough for that rule to be particularly useful. Paul 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
RSA210 factored  ryanp  Factoring  6  20131126 09:33 
Factored vs. Completely factored  aketilander  Factoring  4  20120808 18:09 
F22 factored!  unconnected  Factoring  31  20100626 04:07 
F33 is factored !!  Raman  Factoring  4  20100401 13:57 
RSA100 factored!  ewmayer  Math  5  20030514 15:08 