How to use my own polynomial with Msieve

[jordis]

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!!!!

[jasonp]

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.

[10metreh]

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.

[jordis]

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]

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...

[Batalov]

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.

[10metreh]

Originally Posted by jordis

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.

[akruppa]

Originally Posted by 10metreh

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

[jordis]

It's not possible then?

[10metreh]

Originally Posted by akruppa

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.

[FactorEyes]

Originally Posted by akruppa

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.