20090416, 15:51  #1 
Jan 2009
2^{3} Posts 
How to use my own polynomial with Msieve
Hello,
I want to factor RSA130 number. RSA130 = 18070820886874048059516561644059055662781025167694013491701270214\ 50056662540244048387341127590812303371781887966563182013214880557 And the polynomial that I want to use is: 5748,30224,87384,05200 X^5 + 9882,26191,74822,86102 X^4  13392,49938,91281,76685 X^3 + 16875,25245,88776,84989 X^2 + 3759,90017,48552,08738 X  46769,93055,39319,05995 and its root 125,74411,16841,80059,80468 modulo RSA130 How can I use Msieve to do this? Thanks!!!! 
20090416, 16:48  #2 
Tribal Bullet
Oct 2004
3·1,181 Posts 
Use this guide to build your own polynomial file, then use this guide to run the GGNFS tools (and msieve).
Note that modern polynomial selection tools can produce a polynomial that would allow the sieving to finish 34x faster than using this one. 
20090416, 16:53  #3 
Nov 2008
2×3^{3}×43 Posts 
WHY do you want to use that poly? Where did you get it from? pol51 and msieve produce far better polys.
And WHY do you want to factor RSA130? Personally, I think there is no point in factoring already factored numbers. 
20090416, 17:04  #4 
Jan 2009
2^{3} Posts 
I read the guide, but not says how can I use my polynomial, only says the two ways to find the polynomial with msieve or ggnfs :(
I want to get msieve.fb file from the polynomial, its possible? 
20090416, 17:07  #5 
Jan 2009
8_{16} Posts 
http://primes.utm.edu/notes/rsa130.html
The last time that I used msieve(1.38) to factor 130 digits was impossible no relations was found from a high range... 
20090416, 17:23  #6 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2
3·3,187 Posts 
You were probably trying to use msieve without other tools?
This indeed is not going to work above a certain limit. msieve is intended to be used with GGNFS tools. See the guides mentioned above and some topics in the subforum. 
20090416, 17:25  #7  
Nov 2008
100100010010_{2} Posts 
Quote:
2. That polynomial is suboptimal. Spend some time finding a better one with msieve, which will give you a msieve.fb file. 3. Don't sieve it with msieve. Use gnfslasieve4I13e, which comes with GGNFS. 4. Do use msieve for the postprocessing. 5. Think again about doing it in the first place. 6. I highly recommend that you do a small GNFS job (~100 digits), then go up in steps of 10 digits to get to RSA130. Don't start high. Last fiddled with by 10metreh on 20090416 at 17:28 

20090416, 17:41  #8  
"Nancy"
Aug 2002
Alexandria
100110100011_{2} Posts 
Quote:
Alex 

20090416, 17:51  #9 
Jan 2009
2^{3} Posts 
It's not possible then?

20090416, 18:29  #10 
Nov 2008
2×3^{3}×43 Posts 
He grabbed the poly from the page he posted the link to. It was the original one used to complete RSA130 for the first time.
Last fiddled with by akruppa on 20090416 at 18:39 Reason: Selective quoting at its finest 
20090416, 18:44  #11 
Oct 2006
vomit_frame_pointer
2^{3}×3^{2}×5 Posts 
Ahyup: I've factored RSA129 twice now. It's my reference stick, kept under a vacuumsealed bell jar at a steady temperature.

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Running msieve polynomial selection in parallel?  ryanp  Msieve  9  20191116 19:45 
reduce number of coefficient for polynomial selection with msieve on GPU  aein  Factoring  3  20170225 16:42 
Polynomial Discriminant is n^k for an n1 degree polynomial  carpetpool  Miscellaneous Math  14  20170218 19:46 
msieve 1.52 with GPU polynomial selection  cgy606  Msieve  16  20161006 14:16 
Polynomial  R.D. Silverman  NFSNET Discussion  13  20050916 20:07 