how much time to Factoring rsa512?
 

i use ggnfs to [URL="http://mersenneforum.org/forumdisplay.php?f=19"]Factoring[/URL] rsa512,i have 7 pc (Pentium(R) Dual CPU E2200) run it over 24 day.
but util now ,can't factoring it.

[QUOTE=wsgtrsys;165524]i use ggnfs to [URL="http://mersenneforum.org/forumdisplay.php?f=19"]Factoring[/URL] rsa512,i have 7 pc (Pentium(R) Dual CPU E2200) run it over 24 day.
but util now ,can't factoring it.[/QUOTE]About 3 to 6 cpu months, depending on your cpu.

It will almost certainly take a significant amount of personal effort to learn how to perform the factorization.

Paul

this is new log:

[quote]
-> ___________________________________________________________
-> | This is the factLat.pl script for GGNFS. |
-> | This program is copyright 2004, Chris Monico, and subject|
-> | to the terms of the GNU General Public License version 2.|
-> |__________________________________________________________|
-> This is client 14 of 14
-> Working with NAME=ros...
-> Selected default factorization parameters for 126 digit level.
-> Selected lattice siever: ../../bin/gnfs-lasieve4I14e
-> No parameter change detected. Resuming.
-> minimum number of FF's: 838596
-> Q0=123659687, QSTEP=60000.
-> makeJobFile(): q0=123600000, q1=123660000.
-> makeJobFile(): Adjusted to q0=123659687, q1=123660000.
-> Lattice sieving algebraic q-values from q=123659687 to 123660000.
=> "../../bin/gnfs-lasieve4I14e" -k -o spairs.out14 -v -n14 -a ros.job.14
FBsize 374316+0 (deg 5), 374361+0 (deg 1)
total yield: 32, q=123660001 (3.15132 sec/rel)
20 Special q, 72 reduction iterations
reports: 2186484->63130->51992->6568->3693->2255
Number of relations with k rational and l algebraic primes for (k,l)=:
Total yield: 32
0/0 mpqs failures, 2/2 vain mpqs
milliseconds total: Sieve 77320 Sched 0 medsched 5970
TD 9410 (Init 40, MPQS 0) Sieve-Change 5830
TD side 0: init/small/medium/large/search: 180 110 260 2410 1820
sieve: init/small/medium/large/search: 820 21120 550 17360 3200
TD side 1: init/small/medium/large/search: 170 110 290 2200 1780
sieve: init/small/medium/large/search: 530 15170 490 17870 210
=>"cat" spairs.out14 >> spairs.add.14
-> Q0=123660001, QSTEP=60000.
-> makeJobFile(): q0=124440000, q1=124500000.
-> makeJobFile(): Adjusted to q0=124440000, q1=124500000.
-> Lattice sieving algebraic q-values from q=124440000 to 124500000.
=> "../../bin/gnfs-lasieve4I14e" -k -o spairs.out14 -v -n14 -a ros.job.14
FBsize 374316+0 (deg 5), 374361+0 (deg 1)
total yield: 36, q=124440431 (3.10071 sec/rel)
[/quote]

[QUOTE]
There are 0 relations with 4 large primes.
There are 0 relations with 5 large primes.
There are 0 relations with 6 large primes.
Doing merge on chunk 1/1 (P0=0, P1=8470340)...
Doing 13 additions...
* There are now 5908 full relations.
pass 4...
Before sortByNumLP()... Doing ll_verify(P)...
ll_verify() reports that 'P' appears to be intact.
makePass:
There are 5908 relations with 0 large primes.
There are 13 relations with 1 large primes.
There are 0 relations with 2 large primes.
There are 0 relations with 3 large primes.
There are 0 relations with 4 large primes.
There are 0 relations with 5 large primes.
There are 0 relations with 6 large primes.
After sortByNumLP()... Doing ll_verify(P)...
ll_verify() reports that 'P' appears to be intact.
Deleting 13 singleton large primes.
Deleting 0 singleton large primes.
Total: 13 singletons deleted.
makePass:
There are 5908 relations with 0 large primes.
There are 0 relations with 1 large primes.
There are 0 relations with 2 large primes.
There are 0 relations with 3 large primes.
There are 0 relations with 4 large primes.
There are 0 relations with 5 large primes.
There are 0 relations with 6 large primes.
Doing merge on chunk 1/1 (P0=0, P1=0)...
mkLT: There appear to be no large primes in the specified range.
* There are now 5908 full relations.
After keepFulls(), R->numFields = 5908
More columns needed (current = 5908, min = 838596)
-> Found 5908 relation-sets versus minFF=838596.
-> More sieving needed.
-> Q0=120360001, QSTEP=60000.
-> makeJobFile(): q0=121140000, q1=121200000.
-> makeJobFile(): Adjusted to q0=121140000, q1=121200000.
-> Lattice sieving algebraic q-values from q=121140000 to 121200000.
=> "../../bin/gnfs-lasieve4I14e" -k -o spairs.out -v -n1 -a ros.job
FBsize 374316+0 (deg 5), 374361+0 (deg 1)
total yield: 1980, q=121170253 (3.36040 sec/rel)
[/QUOTE]

That log indicates that you are using entirely wrong parameters; the sooner you stop, the less computer time you will have wasted.

In particular, you will have done vastly less polynomial searching than optimal, and you are using absurdly small factor-base and large-prime bounds, meaning that your yield per special-Q is so small that you will not get a usable number of relations before you run out of usable Q.

If you change the lines at the bottom of your .poly file to something like

lpbr: 29
lpba: 29
mfbr: 58
mfba: 58
alim: 40000000
rlim: 40000000

and start again, using factMsieve rather than factLat because ggnfs filtering tools aren't really capable enough for the 512-bit level, then I would expect you might be able to complete within six to twelve CPU-months.

If you don't understand any of the terms I've used here, please ask; but I assure you that any more time spent running with your current parameters will be as wasted as all the time you've put in so far has been: you've been trying to bale out the Titanic using a ladle with holes in.

[quote=wsgtrsys;165524]i use ggnfs to [URL="http://mersenneforum.org/forumdisplay.php?f=19"]Factoring[/URL] rsa512,i have 7 pc (Pentium(R) Dual CPU E2200) run it over 24 day.
but util now ,can't factoring it.[/quote]
You'll also need quite a bit of memory for the linear algebra.

ggnfs .poly file is:
[QUOTE]

mash1:/home/share/ggnfs3/trunk/tests/ros# cat ros.poly
name: template
n: 12199013741075092697277058272068699496175793947855350620131384560551132989998554364827157047947642499019264099857141857117583668732368414756143066697037831
skew: 1045136.28
# norm 2.27e+21
c5: 4603320
c4: -8643354678366
c3: -23229658654233831899
c2: 7591355774065335794017922
c1: 6896128775024703671131698569170
c0: -1654136390110887053567413679248552485
# alpha -6.93
Y1: 512796205383113353
Y0: -305246705185119988393049615458
# Murphy_E 3.24e-12
# M 7921936098026500576131940457651331092441421542491674881625716083161632403439301119746090727755858162458342336337844882563094889373873742763418115125234770
type: gnfs
rlim: 5400000
alim: 5400000
lpbr: 27
lpba: 27
mfbr: 51
mfba: 51
rlambda: 2.5
alambda: 2.5
qintsize: 60000

[/QUOTE]

i use another pc run msieve on freebsd,log is:
[quote]
www# cat msieve.log
Sun Jan 25 09:24:02 2009
Sun Jan 25 09:24:02 2009
Sun Jan 25 09:24:02 2009 Msieve v. 1.38
Sun Jan 25 09:24:02 2009 random seeds: 29a711b8 5df98af6
Sun Jan 25 09:24:02 2009 factoring 12199013741075092697277058272068699496175793947855350620131384560551132989998554364827157047947642499019264099857141857117583668732368414756143066697037831 (155 digits)
Sun Jan 25 09:24:03 2009 searching for 15-digit factors
Sun Jan 25 09:24:05 2009 commencing number field sieve (155-digit input)
Sun Jan 25 09:24:05 2009 commencing number field sieve polynomial selection
Sun Jan 25 09:24:05 2009 time limit set to 287.50 hours
Sun Feb 15 04:34:30 2009 polynomial selection complete
Sun Feb 15 04:34:30 2009 R0: -305246717784522754656144698668
Sun Feb 15 04:34:30 2009 R1: 512796205383113353
Sun Feb 15 04:34:30 2009 A0: -1818650123631236972398145274729234585
Sun Feb 15 04:34:30 2009 A1: 6481540569413776401145567758790
Sun Feb 15 04:34:30 2009 A2: 9271623948052928710452812
Sun Feb 15 04:34:30 2009 A3: -22352400208705341419
Sun Feb 15 04:34:30 2009 A4: -9208872540366
Sun Feb 15 04:34:30 2009 A5: 4603320
Sun Feb 15 04:34:30 2009 size score = 5.977823e-16, Murphy alpha = -6.933451, combined = 6.029243e-15
Sun Feb 15 04:34:30 2009 generating factor base
Sun Feb 15 04:34:44 2009 factor base complete:
Sun Feb 15 04:34:44 2009 1758111 rational roots (max prime = 28285711)
Sun Feb 15 04:34:44 2009 1758163 algebraic roots (max prime = 28285711)
Sun Feb 15 04:34:45 2009 a range: [-61714286, 61714286]
Sun Feb 15 04:34:45 2009 b range: [1, 4294967295]
Sun Feb 15 04:34:45 2009 number of hash buckets: 432
Sun Feb 15 04:34:45 2009 sieve block size: 65536
Sun Feb 15 04:34:45 2009
Sun Feb 15 04:34:45 2009 maximum RFB prime: 28285711
Sun Feb 15 04:34:45 2009 RFB entries: 1758111
Sun Feb 15 04:34:45 2009 medium RFB entries: 6542
Sun Feb 15 04:34:45 2009 resieved RFB entries: 6374
Sun Feb 15 04:34:45 2009 small RFB prime powers: 27
Sun Feb 15 04:34:45 2009 projective RFB roots: 8
Sun Feb 15 04:34:45 2009 RFB trial factoring cutoff: 64 or 97 bits
Sun Feb 15 04:34:45 2009 single large prime RFB range: 25 - 29 bits
Sun Feb 15 04:34:45 2009 double large prime RFB range: 50 - 56 bits
Sun Feb 15 04:34:45 2009 triple large prime RFB range: 77 - 85 bits
Sun Feb 15 04:34:45 2009
Sun Feb 15 04:34:45 2009 maximum AFB prime: 28285711
Sun Feb 15 04:34:45 2009 AFB entries: 1758163
Sun Feb 15 04:34:45 2009 medium AFB entries: 6581
Sun Feb 15 04:34:45 2009 resieved AFB entries: 6379
Sun Feb 15 04:34:45 2009 small AFB prime powers: 98
Sun Feb 15 04:34:45 2009 projective AFB roots: 5
Sun Feb 15 04:34:45 2009 AFB trial factoring cutoff: 64 or 97 bits
Sun Feb 15 04:34:45 2009 single large prime AFB range: 25 - 29 bits
Sun Feb 15 04:34:45 2009 double large prime AFB range: 50 - 56 bits
Sun Feb 15 04:34:45 2009 triple large prime AFB range: 77 - 85 bits
Sun Feb 15 04:34:45 2009
Sun Feb 15 04:34:46 2009 multiplying 5845443 primes from 28285711 to 134217728
Sun Feb 15 04:35:04 2009 multiply complete, product has 152815357 bits
Wed Feb 18 11:07:19 2009 completed b = 27093, found 241527 relations
Wed Feb 18 11:07:19 2009 elapsed time 577:43:17
Wed Feb 18 11:08:09 2009
Wed Feb 18 11:08:09 2009
Wed Feb 18 11:08:09 2009 Msieve v. 1.38
Wed Feb 18 11:08:09 2009 random seeds: 0bfc88d4 9eff3336
Wed Feb 18 11:08:09 2009 factoring 12199013741075092697277058272068699496175793947855350620131384560551132989998554364827157047947642499019264099857141857117583668732368414756143066697037831 (155 digits)
Wed Feb 18 11:08:10 2009 searching for 15-digit factors
Wed Feb 18 11:08:13 2009 commencing number field sieve (155-digit input)
Wed Feb 18 11:08:13 2009 R0: -305246717784522754656144698668
Wed Feb 18 11:08:13 2009 R1: 512796205383113353
Wed Feb 18 11:08:13 2009 A0: -1818650123631236972398145274729234585
Wed Feb 18 11:08:13 2009 A1: 6481540569413776401145567758790
Wed Feb 18 11:08:13 2009 A2: 9271623948052928710452812
Wed Feb 18 11:08:13 2009 A3: -22352400208705341419
Wed Feb 18 11:08:13 2009 A4: -9208872540366
Wed Feb 18 11:08:13 2009 A5: 4603320
Wed Feb 18 11:08:13 2009 size score = 5.977823e-16, Murphy alpha = -6.933451, combined = 6.029243e-15
Wed Feb 18 11:08:14 2009 factor base loaded:
Wed Feb 18 11:08:14 2009 1758111 rational ideals (max prime = 28285711)
Wed Feb 18 11:08:14 2009 1758163 algebraic ideals (max prime = 28285711)
Wed Feb 18 11:08:14 2009 a range: [-61714286, 61714286]
Wed Feb 18 11:08:14 2009 b range: [27094, 4294967295]
Wed Feb 18 11:08:14 2009 number of hash buckets: 432
Wed Feb 18 11:08:14 2009 sieve block size: 65536
Wed Feb 18 11:08:14 2009
Wed Feb 18 11:08:14 2009 maximum RFB prime: 28285711
Wed Feb 18 11:08:14 2009 RFB entries: 1758111
Wed Feb 18 11:08:14 2009 medium RFB entries: 6542
Wed Feb 18 11:08:14 2009 resieved RFB entries: 6374
Wed Feb 18 11:08:14 2009 small RFB prime powers: 27
Wed Feb 18 11:08:14 2009 projective RFB roots: 8
Wed Feb 18 11:08:14 2009 RFB trial factoring cutoff: 64 or 97 bits
Wed Feb 18 11:08:14 2009 single large prime RFB range: 25 - 29 bits
Wed Feb 18 11:08:14 2009 double large prime RFB range: 50 - 56 bits
Wed Feb 18 11:08:14 2009 triple large prime RFB range: 77 - 85 bits
Wed Feb 18 11:08:14 2009
Wed Feb 18 11:08:14 2009 maximum AFB prime: 28285711
Wed Feb 18 11:08:14 2009 AFB entries: 1758163
Wed Feb 18 11:08:14 2009 medium AFB entries: 6581
Wed Feb 18 11:08:14 2009 resieved AFB entries: 6379
Wed Feb 18 11:08:14 2009 small AFB prime powers: 98
Wed Feb 18 11:08:14 2009 projective AFB roots: 5
Wed Feb 18 11:08:14 2009 AFB trial factoring cutoff: 64 or 97 bits
Wed Feb 18 11:08:14 2009 single large prime AFB range: 25 - 29 bits
Wed Feb 18 11:08:14 2009 double large prime AFB range: 50 - 56 bits
Wed Feb 18 11:08:14 2009 triple large prime AFB range: 77 - 85 bits
Wed Feb 18 11:08:14 2009
Wed Feb 18 11:08:14 2009 multiplying 5845443 primes from 28285711 to 134217728
Wed Feb 18 11:08:35 2009 multiply complete, product has 152815357 bits
[/quote]

is parameters best of ggnfs .poly?

Don't bother with the line sieve in msieve; this polynomial has a very large amount of skew, and no amount of line sieving is going to find enough relations. You need to use the lattice sieve from GGNFS to have any hope of completing the job.

Perhaps you should instead start with something small, like RSA100?

[quote=fivemack;165569]That log indicates that you are using entirely wrong parameters; the sooner you stop, the less computer time you will have wasted.
...
If you don't understand any of the terms I've used here, please ask; but I assure you that any more time spent running with your current parameters will be as wasted as all the time you've put in so far has been: you've been trying to bale out the Titanic using a ladle with holes in.[/quote]

I was afraid that I was the only one seeing that (in another thread). When I saw this clone of the OP's message I thought "was [URL="http://mersenneforum.org/showpost.php?p=165542&postcount=219"]my message[/URL] deleted as an obnoxious one?" Nope, it wasn't. It's just in a different place.

A ladder:
Try a RSA-100.
Then try a GNFS-120, that will take you 10 times longer.
Then try a GNFS-140, that will take you extra 10 times longer still.
Then try a GNFS-154 (RSA-512), it will take you 5 times longer still than the previous.

For every 20-21 extra digits you will need 10x more time to spend.
[B]And[/B] you need the correct parameters and an increasing understanding of what you are doing.

And msieve 1.38 is now out of date.

Some suggestions
 

[FONT=Times New Roman][SIZE=3]I thought I read on Wikipedia that there’s a European team that’s been factoring RSA-768 for months. In late March or early April, I contacted the webmaster of RSA asking if he knew anything about this or how I could join. He/she didn’t email me back information.[/SIZE][/FONT]

[FONT=Times New Roman][SIZE=3][quote=10metreh;165714]And msieve 1.38 is now out of date.[/quote]Go to [/SIZE][/FONT][URL="http://www.mersenneforum.org/showthread.php?t=11601"][FONT=Times New Roman][SIZE=3][COLOR=#0000ff]http://www.mersenneforum.org/showthread.php?t=11601[/COLOR][/SIZE][/FONT][/URL][SIZE=3][FONT=Times New Roman] and read down it including the link to Msieve 1.41.[/FONT][/SIZE]

[FONT=Times New Roman][SIZE=3]From the RSA Factoring Challenge, Jens Franke seems to be a step ahead of everybody: [/SIZE][/FONT][URL="http://en.wikipedia.org/wiki/RSA_Factoring_Challenge"][FONT=Times New Roman][SIZE=3][COLOR=#800080]http://en.wikipedia.org/wiki/RSA_Factoring_Challenge[/COLOR][/SIZE][/FONT][/URL][SIZE=3][FONT=Times New Roman] I typed “Jens Franke” into the internet and I found his info and email: [/FONT][/SIZE][URL="http://www.hausdorff-center.uni-bonn.de/old/faculty/Franke/"][FONT=Times New Roman][SIZE=3][COLOR=#0000ff]http://www.hausdorff-center.uni-bonn.de/old/faculty/Franke/[/COLOR][/SIZE][/FONT][/URL][SIZE=3][FONT=Times New Roman] I didn’t get around to emailing him though. However, I would email asking him a couple questions including about the computer time if I were you. Ask him if he knows anything about the European team that’s factoring RSA-768.[/FONT][/SIZE]

[FONT=Times New Roman][SIZE=3]I know enough about RSA-170 that I shouldn’t try to factor it unless I either get about 7 computers or several more people to use their computing time to help me. I have just one computer. It’s going to possibly be years until there are faster computers or I get enough people that want to help me with RSA-170. Some of the suggestions that I’ve gotten are that I should factor a Cunningham Tables number or an aliquot number.[/SIZE][/FONT]

[FONT=Times New Roman][SIZE=3]My advice to you would be to start with a smaller number like one with 99 to 121 digits just to be sure that you can use the GGNFS factoring software correctly. Jeff Gilchrist’s Guide should help: [/SIZE][/FONT][URL="http://gilchrist.ca/jeff/factoring/nfs_beginners_guide.html"][FONT=Times New Roman][SIZE=3][COLOR=#0000ff]http://gilchrist.ca/jeff/factoring/nfs_beginners_guide.html[/COLOR][/SIZE][/FONT][/URL][SIZE=3][FONT=Times New Roman] Then look at the polynomial search for 109!+1: [/FONT][/SIZE][URL="http://www.mersenneforum.org/showthread.php?t=11454"][FONT=Times New Roman][SIZE=3][COLOR=#0000ff]http://www.mersenneforum.org/showthread.php?t=11454[/COLOR][/SIZE][/FONT][/URL][FONT=Times New Roman][SIZE=3] and how the sieving for it is going: [/SIZE][/FONT][URL="http://www.mersenneforum.org/showthread.php?t=11529"][FONT=Times New Roman][SIZE=3][COLOR=#0000ff]http://www.mersenneforum.org/showthread.php?t=11529[/COLOR][/SIZE][/FONT][/URL][SIZE=3][FONT=Times New Roman] . I try to remember to check back at these 109!+1 pages every two days or so.[/FONT][/SIZE]

[FONT=Times New Roman][SIZE=3]You said you have 7 PCs. Maybe you should start where I left off at RSA-170. Or maybe you should use your computer time to help the European team with RSA-768.[/SIZE][/FONT]

[SIZE=3][FONT=Times New Roman]That’s about all I know that I can help you with. Remember that the people here on the forum are here to help you if you have any more questions.[/FONT][/SIZE]

[quote=stathmk;172128][FONT=Times New Roman][SIZE=3]Or maybe you should use your computer time to help the European team with RSA-768.[/SIZE][/FONT]

[SIZE=3][FONT=Times New Roman]That’s about all I know that I can help you with. Remember that the people here on the forum are here to help you if you have any more questions.[/FONT][/SIZE][/quote]

Don't do any sieving on RSA768. The team has already finished sieving and the linear algebra is in progress. Anyway, the sievers they used are not in the public domain.

There are many people on the forum who are MUCH more experienced with NFS than you. You are behaving as if you want to become a moderator. Sander and Tom are the moderators in this forum because they are experienced and know a lot about how factoring works.