20100429, 19:44  #23  
Nov 2003
1110100100100_{2} Posts 
Quote:


20100429, 19:51  #24  
Apr 2010
19_{10} Posts 
Quote:


20100430, 08:41  #25  
Sep 2009
3550_{8} Posts 
Quote:
Chris K 

20100430, 10:20  #26  
Sep 2009
977 Posts 
The RSALS grid can definitely sieve GNFS tasks of difficulty 159: we've already sieved two GNFS C160s (XYYXF), two C163s (current XYYXF record, and a participation in the team sieving of a C163 in Aliquot sequence 4788) and a C165 (20009_241, current nearrepdigitrelated record).
Using GGNFS siever 14e, RSALS is helping factoring in a range of difficulty limited by: * on the "easy" side, integers reasonably sievable by a handful of cores; * on the "hard" side, integers on which the 14e siever produces unreasonably low yields (difficulty between 165 and 170 for GNFS, about 250 for SNFS). Those are the territory of 15e and higher sievers, used by NFS@Home and other organizations. We're not ruling out deploying 15e for a onceinawhile usage, but we have not deployed it so far. But as jasonp wrote, factoring a C159 by GNFS in one week is very hard: Quote:
* 1 day for polynomial selection on several leadingedge CUDAcapable GPUs; * 4 days for postprocessing on a leadingedge 2 x quadcore i7 featuring fast RAM handled in quadchannel mode. That leaves two days for sieving a C159... and the current power of the RSALS grid is too short to make sieving fit in that time budget, by a factor of at least two or even three. => Wesley/Romulas, even if factoring one of your schoolmates' short RSA keys in a week would be an excellent display of the power of grids, I'm afraid that RSALS can't help on the challenge of factoring a C159 in one week. It's too hard of a challenge. (if you were talking about 512bit RSA keys, we might consider... after all, the project was born to sieve keys of such length, and we've fully sieved 12 of them and partially sieved a 13th one in about a month) 

20100430, 14:03  #27  
Apr 2010
19_{10} Posts 
Quote:


20100430, 15:19  #28  
Nov 2003
2^{2}×5×373 Posts 
Quote:
your school's computer systems. Other students might have their code there as well. STEAL IT. If they used a simple PRNG you should be able to just brute force their RNG. If it is (say) a 32bit RNG, you can try all possible seeds very quickly. Now you can factor their RSA public modulus by trial division. 

20100504, 00:53  #29 
Apr 2010
19 Posts 
Well, the keys are posted.
Adam's modulus R is not a multiple of two large primes. It looks like an R that came from an Elliptic Curve key. Oh, by the way, R is the modulus, n is the public exponent. The notation is different from RSA, since this is LUC RSA. Last fiddled with by Romulas on 20100504 at 01:11 
20100604, 23:10  #30 
Sep 2004
13×41 Posts 
so have you tried ecm or fermat's method on them yet?

20100606, 04:25  #32 
Sep 2004
13·41 Posts 
his n following, is it weak?
P1 = 2 P1 = 2 P1 = 3 P4 = 1381 P4 = 1787 PRP5 = 40819 PRP5 = 62653 Last fiddled with by Joshua2 on 20100606 at 04:28 
20100606, 15:08  #33 
"Ed Hall"
Dec 2009
Adirondack Mtns
3,347 Posts 
I thought it was due to messing up the part about using the product of two 81 digit primes.
His R value is 2^{3} * 3^{4} * 13 * 19 * 31 * 53 * 431 * 228341 * c146 The fact that R was even, looked a bit odd. . . 
Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
factoring 90 512bit RSA Keys in 3 minutes  MiniGeek  Lounge  1  20150317 17:27 
openssl weak keys  Unregistered  Information & Answers  1  20111007 22:14 
Asymetric keys  JohnFullspeed  Factoring  3  20110723 12:24 
Assignment keys  NBtarheel_33  PrimeNet  17  20100218 04:38 
Where I find the best program to it factor keys? I use AMD.  chrow  Factoring  5  20040219 10:15 