20100107, 19:45  #23 
Account Deleted
"Tim Sorbera"
Aug 2006
San Antonio, TX USA
1000010110111_{2} Posts 
Well, there's always a very, very slight chance that an ECM curve might find one of the factors. You're probably more likely to be struck by lightning while winning 5 lotteries, but it's possible.
Edit: Out of curiosity, how long, and how much memory, would it take to find one of these factors by P1 or P+1, knowing what their factorizations are? P1 bounds could be B1=1e30 and B2=1e47 or B1=360 and B2=1e113, P+1 bounds could be B1=1e44 and B2=1e71 or B1=1e21 and B2=1e90. BTW here are FactorDB links for a few of the related numbers here: N: http://factordb.com/search.php?id=9946820 p: http://factordb.com/search.php?id=91768521 p1: http://factordb.com/search.php?id=91919514 p+1: http://factordb.com/search.php?id=91919521 q: http://factordb.com/search.php?id=91768522 q1: http://factordb.com/search.php?id=91919525 q+1: http://factordb.com/search.php?id=91919527 Last fiddled with by TimSorbet on 20100107 at 20:00 
20100107, 19:49  #24 
Bamboozled!
"๐บ๐๐ท๐ท๐ญ"
May 2003
Down not across
2·7^{3}·17 Posts 
Remember the Golden Rule: Never ascribe to malice that which is adequately explained by incompetence.
If I were a betting man, I would put much more money on incompetence by the ECM people than on malice(*) by Bob (or incompetence, for that matter!). My instincts were proven correct in this case. The best response to those who propose to run ECM on RSA moduli is: do you feel lucky, punk? Paul (*)I freely admit to malice when creating the RSA modulus in The Code Book challenge. It was a source of some amusement, and reassurance, that noone tried P1 with sufficiently large limits on the modulus. 
20100107, 20:00  #25 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
3×7×479 Posts 
Congratulations on the fantastic job!

20100107, 20:03  #26 
Tribal Bullet
Oct 2004
DE3_{16} Posts 
Congratulations to everyone involved; we were long overdue for a GNFS record, and this moves the state of the art far in front of what's reasonably possible with individual contributors.
Msieve can now handle arbitrary numbers of large primes per relation, up to 48 bits each (this size keeps down the expansion in the size of the hashtable used in the singleton removal phase). It's also limited to 4 billion relations, but this is 10x larger than what anyone has tried. Edit: Andi, I think GNFS232 is well within the range where a degree 6 polynomial is a better idea than degree 5 Last fiddled with by jasonp on 20100107 at 20:06 
20100107, 20:09  #27 
Nov 2008
2·3^{3}·43 Posts 
An amazing achievement!
This shows that HP49:100 is a possibility if we have a degree 6 poyfinder and a block Wiedemann implementation; is there a chance that any of the software used could become available to the public? Last fiddled with by 10metreh on 20100107 at 20:10 Reason: i before e except after c (grrr...) 
20100107, 20:12  #28  
A Sunny Moo
Aug 2007
USA (GMT5)
1869_{16} Posts 
Quote:


20100107, 20:16  #29 
Just call me Henry
"David"
Sep 2007
Liverpool (GMT/BST)
1011110010000_{2} Posts 

20100107, 20:18  #30 
A Sunny Moo
Aug 2007
USA (GMT5)
3·2,083 Posts 

20100107, 21:06  #31 
Oct 2004
Austria
2·17·73 Posts 

20100107, 22:16  #32 
"Ben"
Feb 2007
3733_{10} Posts 
Fantastic! Cheers to all involved!
The paper mentions that a deliberate decision was made to not BOINCify or otherwise open up the sieving stage of the computation; mostly I gather from the desire to set a reasonably precise completion date and from a data management standpoint. I wonder how much could be gained if they opened it up, assuming the resources (administration/data management) were available? If not BOINC then at least a more widespread invitation to contribute. It seems like there would be lots of interest from the community to contribute to a record factorization, but maybe that's just the euphoria talking. Anyway, congrats again! 
20100107, 23:29  #33  
Jun 2005
lehigh.edu
2^{10} Posts 
Quote:
serious consideration was given to opening up this computation to the public. Neither BSI nor NTT are inclined toward having their interests reported before they're ready. Bruce 

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 