20100108, 00:09  #34 
Tribal Bullet
Oct 2004
3^{2}×5×79 Posts 
The same way you find degree4 and degree5; the algorithm is independent of the polynomial degree, even if the code is not :)
While finding degree 6 polynomials is possible now, searching the space for good degree 6 polynomials is turning out to be surprisingly difficult unless the space is forced to be extremely small. Last fiddled with by jasonp on 20100108 at 00:13 
20100108, 01:37  #35 
Jul 2003
So Cal
19×137 Posts 
I'm a bit late to the party, but congrats! NFS@Home is honored to have earned a reference in the paper.
Last fiddled with by frmky on 20100108 at 01:37 
20100108, 02:07  #36 
Tribal Bullet
Oct 2004
3^{2}×5×79 Posts 
Comment in an Ars Technica thread, on why it's silly to base encryption on prime numbers because you can tabulate them all:
Code:
That's basically what they did. Instead of finding and storing all the primes they found and stored the products of all the primes. This took them 1500 years of processor time and 5TB to store the resulting data, so it's not quite as easy as you make it sound. Last fiddled with by jasonp on 20100108 at 02:07 
20100108, 02:35  #37  
Jun 2005
lehigh.edu
1024_{10} Posts 
Quote:
this correction. A friendly ammendment, certainly. BD 

20100108, 05:29  #38 
Bemusing Prompter
"Danny"
Dec 2002
California
5×499 Posts 
I wonder if RSA will mention this on its website despite having discontinued the contest in 2007. RSA did announce the factorization of RSA200 from the old contest that was also cancelled, so I'm pretty curious how this will go.
Last fiddled with by ixfd64 on 20100108 at 05:31 
20100108, 07:42  #39 
Nov 2008
2·3^{3}·43 Posts 
Would RSA1024 need a septic polynomial if it were ever done by GNFS?

20100108, 08:39  #41  
May 2009
2×11 Posts 
Quote:
 there's no real documentation on how to run it in an mpi environment (but it works  it's a matter of writing up some doc, and finish writing one matrix preparation tool).  the central matrix berlekampmassey code needs to be rewritten entirely in order to handle problems of this size. This is not trivial. The code we used for the factorization is not distributed presently. A block Lanczos using the mpi+pthreads matrix product from cadonfs would not be terribly hard to write. Might happen not too far from now. E. 

20100108, 08:46  #42  
May 2009
2×11 Posts 
Quote:
n=2^768 e(l(3*l(n)/l(l(n)))/3) 6.33644328171517744982 n=2^1024 e(l(3*l(n)/l(l(n)))/3) 6.87076171913041326630 So 1024 nears the 67 border. I haven't spent a second of work on the topic, but it seems likely that degree 6 still wins for 1024. Kleinjung's paper at sharc06 suggest a polynomial of degree 6 as well, which is a mild indication that perhaps he also tried 7 and found out that 6 was better. anyway. E. 

20100108, 08:58  #43  
May 2009
2×11 Posts 
Quote:
So group efforts at this scale are not necessarily frowned upon, but that's really a management and supervision issue. Much easier to split into a small number of groups, rather than to have 1000+ contributors. E. 

20100108, 09:02  #44  
Just call me Henry
"David"
Sep 2007
Liverpool (GMT/BST)
2^{4}×13×29 Posts 
Quote:


Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Modulus function on a linear convolution  lukerichards  Number Theory Discussion Group  4  20180406 12:57 
Extracting the Modulus from publickeyblob RSA 512  26B  Homework Help  2  20141130 07:31 
It's possible to calculate an unknown RSA modulus?  D2MAC  Math  8  20101226 16:32 
Fixed leading bits in RSA modulus, vs NFS  fgrieu  Factoring  7  20090923 11:45 
Factoring with Highly Composite Modulus  mgb  Math  3  20060909 10:35 