mersenneforum.org  

Go Back   mersenneforum.org > Factoring Projects > Msieve

Reply
 
Thread Tools
Old 2009-04-16, 15:51   #1
jordis
 
Jan 2009

23 Posts
Default How to use my own polynomial with Msieve

Hello,

I want to factor RSA-130 number.

RSA-130 = 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 RSA-130

How can I use Msieve to do this?

Thanks!!!!
jordis is offline   Reply With Quote
Old 2009-04-16, 16:48   #2
jasonp
Tribal Bullet
 
jasonp's Avatar
 
Oct 2004

3·1,163 Posts
Default

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 3-4x faster than using this one.
jasonp is offline   Reply With Quote
Old 2009-04-16, 16:53   #3
10metreh
 
10metreh's Avatar
 
Nov 2008

232210 Posts
Default

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.
10metreh is offline   Reply With Quote
Old 2009-04-16, 17:04   #4
jordis
 
Jan 2009

23 Posts
Default

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?
jordis is offline   Reply With Quote
Old 2009-04-16, 17:07   #5
jordis
 
Jan 2009

108 Posts
Default

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...
jordis is offline   Reply With Quote
Old 2009-04-16, 17:23   #6
Batalov
 
Batalov's Avatar
 
"Serge"
Mar 2008
Phi(4,2^7658614+1)/2

22·3·7·109 Posts
Default

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 sub-forum.
Batalov is offline   Reply With Quote
Old 2009-04-16, 17:25   #7
10metreh
 
10metreh's Avatar
 
Nov 2008

2×33×43 Posts
Default

Quote:
Originally Posted by jordis View Post
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...
1. Get Msieve 1.41.

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 gnfs-lasieve4I13e, 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 2009-04-16 at 17:28
10metreh is offline   Reply With Quote
Old 2009-04-16, 17:41   #8
akruppa
 
akruppa's Avatar
 
"Nancy"
Aug 2002
Alexandria

25·7·11 Posts
Default

Quote:
Originally Posted by 10metreh View Post
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.
Reproducing old factorizations to measure the effect of improvements elsewhere in the tool chain? Or experimenting with a home-grown polynomial selector? Both perfectly valid endeavours.

Alex
akruppa is offline   Reply With Quote
Old 2009-04-16, 17:51   #9
jordis
 
Jan 2009

23 Posts
Default

It's not possible then?
jordis is offline   Reply With Quote
Old 2009-04-16, 18:29   #10
10metreh
 
10metreh's Avatar
 
Nov 2008

2×33×43 Posts
Default

Quote:
Originally Posted by akruppa View Post
Or experimenting with a home-grown polynomial selector?
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 2009-04-16 at 18:39 Reason: Selective quoting at its finest
10metreh is offline   Reply With Quote
Old 2009-04-16, 18:44   #11
FactorEyes
 
FactorEyes's Avatar
 
Oct 2006
vomit_frame_pointer

5448 Posts
Red face

Quote:
Originally Posted by akruppa View Post
Reproducing old factorizations to measure the effect of improvements elsewhere in the tool chain? Or experimenting with a home-grown polynomial selector? Both perfectly valid endeavours.

Alex
Ah-yup: I've factored RSA-129 twice now. It's my reference stick, kept under a vacuum-sealed bell jar at a steady temperature.
FactorEyes is offline   Reply With Quote
Reply

Thread Tools


Similar Threads
Thread Thread Starter Forum Replies Last Post
Running msieve polynomial selection in parallel? ryanp Msieve 9 2019-11-16 19:45
reduce number of coefficient for polynomial selection with msieve on GPU aein Factoring 3 2017-02-25 16:42
Polynomial Discriminant is n^k for an n-1 degree polynomial carpetpool Miscellaneous Math 14 2017-02-18 19:46
msieve 1.52 with GPU polynomial selection cgy606 Msieve 16 2016-10-06 14:16
Polynomial R.D. Silverman NFSNET Discussion 13 2005-09-16 20:07

All times are UTC. The time now is 06:08.

Wed Nov 25 06:08:53 UTC 2020 up 76 days, 3:19, 4 users, load averages: 1.34, 1.43, 1.51

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, Jelsoft Enterprises Ltd.

This forum has received and complied with 0 (zero) government requests for information.

Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published by the Free Software Foundation.
A copy of the license is included in the FAQ.