20100511, 22:44  #1 
Oct 2007
106_{10} Posts 
Factorization of RSA180
This just showed up on ePrint:
"Factorization of RSA180"  http://eprint.iacr.org/2010/270 Another large factorization possible by ggnfs+msieve. 
20100512, 00:20  #2 
"CharlesgubOB"
Jul 2009
Germany
2·313 Posts 
I have done a Polynomial selection for RSA180 at Jan 19th 2010 with msieve_gpu.
results for example # norm 3.238498e018 alpha 5.244691 e 2.982e014 skew: 154808464.30 c0: 278552759242679896359919601738676051354776448 c1: 48023424149645535510809863817782915964 c2: 263808952653699707784808442634 c3: 291711014051391544978336 c4: 9424826240603 c5: 4320 Y0: 134640945149253025253619248206651255 Y1: 12665893392257695477 . . . 
20100512, 00:29  #3 
Feb 2006
Denmark
2·5·23 Posts 
It seems odd that the paper doesn't give the factorization. I wonder whether it is deliberate or they forgot this rather important detail in their eager to not be scooped again. As I mentioned in another thread, an anonymous Wikipedia edit does give the factorizarion and credits them: "RSA180 was factored on May 8, 2010 by S. A. Danilov and I. A. Popovyan from Moscow State University, Russia."

20100512, 12:14  #5  
Nov 2003
2^{2}×5×373 Posts 
Quote:
CODE. As it is, it is just a mostly mindless exercize in using someone else's code. It is not worth publishing. 

20100512, 13:53  #6 
Tribal Bullet
Oct 2004
3·1,181 Posts 
They are in the middle of adding MPI support to the block Lanczos code, which I have been wanting to start for months now.
It's an interesting question whether RSA190 is accessible now in the same way that RSA180 was. Last fiddled with by jasonp on 20100512 at 13:54 
20100512, 14:05  #7  
"William"
May 2003
New Haven
23×103 Posts 
Quote:
P.S. You fool no one. You would not have been impressed of they had written their own code implementing someone else's algorithm, either. Code writing is not the key to garnering your admiration. 

20100512, 14:12  #8 
Noodles
"Mr. Tuch"
Dec 2007
Chennai, India
3×419 Posts 
Once that this has been done entirely, we shall do M1061 together over within this forum. I will be ready at first of all, in order to run up the LA for that exactly, at once

20100512, 15:24  #9 
(loop (#_fork))
Feb 2006
Cambridge, England
2^{2}×1,613 Posts 
I'm confident that RSA190 is accessible; at least, I believe the software will run 33bit LA, I have a 32G machine that can do the matrixcreation step, I believe boinc is large enough to do the sieving, and after less than two weeks on a GTX275 I had a reasonable polynomial (E=9.253e15, yield (16e, alim=rlim=2e8) 2.4486 for q=3e8..3e8+1e4 at 1.06470 sec/rel) for the larger C192 from 2^10871 that Bos killed off by ECM in February.
I have no desire to do RSA190; to spend a kilowattdecade of electricity (ten thousand dollars!) on breaking apart something that we know can be broken apart and of whose constituents we have no interest is purely wasteful. 
20100512, 15:38  #10 
Bemusing Prompter
"Danny"
Dec 2002
California
11×13×17 Posts 
That's it, I'm quitting GIMPS right now. Since almost everybody uses Prime95 instead of writing their own program, discoveries of new Mersenne primes are obviously not newsworthy.

20100512, 16:18  #11  
Noodles
"Mr. Tuch"
Dec 2007
Chennai, India
4E9_{16} Posts 
Quote:
That's the problem with implementing with our own code. They will in no way comparable in speed with the world class one. Even by a factor of 10 to 100. Plenty of optimizations to be worked upon, what is the point in another person rewriting that same algorithm, that has already been implemented up by someone else by using their effort? It will take a while for me to understand about how that Fast Fourier Transform or that Discrete Weighted Transform works out, which right now plays a major roll with the ongoing Lucas Lehmer Tests. Even then, the 100% contribution cannot be from a single person at all, since one have to be dependent upon that GMP or some other library, which is surely, entirely written up by someone else (even especially as a team) only actually, after several months of manwork, rather. Last fiddled with by Raman on 20100512 at 16:21 

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Factorization on 2^p +1  kurtulmehtap  Math  25  20100912 14:13 
Factorization of 7,254+  dleclair  NFSNET Discussion  1  20060321 05:11 
Factorization of 11,212+  Wacky  NFSNET Discussion  1  20060320 23:43 
Factorization of 5,307  Jeff Gilchrist  NFSNET Discussion  7  20050223 19:46 
Factorization of M(738)  McBryce  Factoring  2  20030919 19:32 