mersenneforum.org My plan for RSA factoring distributed computing
 Register FAQ Search Today's Posts Mark Forums Read

2009-03-16, 02:55   #2
bsquared

"Ben"
Feb 2007

70028 Posts

Quote:
 Originally Posted by stathmk There are different programs that I could use to factor the RSA-170 number from the Wikipedia page. Which GNFS program do you recommend to me? I’ve used Alpertron, PrimeForm, NewPGen, and Proth, but never a SNFS, MPQS, GNFS or ECPP program yet.
Leaders of projects are generally knowledgable about what they are leading... you have some homework to do.

For starters, for RSA type numbers, GNFS is your only option. The best publicly available implementation is called GGNFS (google). Threads on this forum and the yahoo group has info to get you going on learning how to use it.

Best of luck. My CPUs will be busy elsewhere.

 2009-03-16, 05:05 #3 frmky     Jul 2003 So Cal 24×3×47 Posts RSA-170 is a bit easier than 109!+1. Take a look at the 109!+1 poly search and sieving threads to get an idea of the amount of work involved.
 2009-03-16, 16:37 #4 stathmk     Mar 2009 Indiana, United Stat 608 Posts Re: RSA semiprimes, 109!+1 Thanks, guys. Yes, I already knew that I have some homework to do. I did an internet search for GGNFS and it seems to be helpful. Frmky, please link me to the 109!+1 pages that you're talking about. I did an internet search for 109!+1 polynomial search and it wasn't helpful. It returned results like page 109, chapter 109, or volume 109.
 2009-03-16, 16:43 #5 fivemack (loop (#_fork))     Feb 2006 Cambridge, England 22·1,613 Posts
 2009-03-16, 16:46 #6 bsquared     "Ben" Feb 2007 2×11×163 Posts And for the sieving... http://www.mersenneforum.org/showthread.php?t=11529 I see that the sieving so far has consumed about 944 CPU days, and isn't done yet.
2009-03-16, 16:58   #7
stathmk

Mar 2009
Indiana, United Stat

24·3 Posts
Re: 109!+1

Quote:
Thank you. Now I'll first try 109!+1 a bit before going on to the RSA numbers.

2009-03-16, 17:14   #8
alpertron

Aug 2002
Buenos Aires, Argentina

2×32×79 Posts

Quote:
 Originally Posted by stathmk I also have a different prime record. Go to http://www.alpertron.com.ar/ECM.htm and part of the way down the screen click on “See Factorization Records.” My 49-digit factor is first place for now. It took over six months to factor using Dario Alejandro Alpern’s ECM Applet. For now, I’m trying to break my record again.
With the new version of my factoring applet it should take less than 2 days to factor RSA-99 using SIQS. I haven't ran that number but you can do it easily: after the factorization starts, type the number zero on the lower-left input box and then press New Curve button.

Of course applets are not as fast as native code, so msieve can factor the same number in about 8 hours (the exact number depends on the processor you are using).

I appreciate you post the output from the applet after the factorization finishes.

Last fiddled with by alpertron on 2009-03-16 at 17:15

2009-03-16, 18:06   #9
stathmk

Mar 2009
Indiana, United Stat

24×3 Posts
RSA-99

Hi Dario.
Quote:
 Originally Posted by alpertron With the new version of my factoring applet it should take less than 2 days to factor RSA-99 using SIQS. I haven't ran that number but you can do it easily: after the factorization starts, type the number zero on the lower-left input box and then press New Curve button. ...
Yes, I will try that before too many days. According to both our records, I finished factoring it by curves on July 10, 2008. You've been updating your SIQS code about every week since January 1st, 2009, so it's very different since July.

 2009-03-16, 18:25 #10 10metreh     Nov 2008 1001000100102 Posts I'd try doing something like RSA-100 with GNFS before you get to the big jobs like RSA-170. And ECM would take millennia. I mean millennia. Well CPU-millennia, anyway, for RSA-170, that is. And Dario's applet is only really competitive with GMP-ECM for the 25-digit level and below. There are several people who go around trying to factor huge numbers with ECM or even (fanfare) trial division. Some are told off and continue. I hope you are not one of them.
2009-03-16, 20:49   #11
stathmk

Mar 2009
Indiana, United Stat

24×3 Posts

Quote:
 Originally Posted by 10metreh I'd try doing something like RSA-100 with GNFS before you get to the big jobs like RSA-170. And ECM would take millennia. I mean millennia. Well CPU-millennia, anyway, for RSA-170, that is. And Dario's applet is only really competitive with GMP-ECM for the 25-digit level and below. There are several people who go around trying to factor huge numbers with ECM or even (fanfare) trial division. Some are told off and continue. I hope you are not one of them.
I'm factoring a 119-digit number using Alpertron's web site. I'll eventually have people sign up for ranges for the 119-digit number. I'm still studying ECMNET and GGNFS. Now, instead of using Alpertron's web site to factor RSA-170, I'll have to use ECMNET http://www.loria.fr/~zimmerma/records/ecmnet.html or GGFNS. It will be GGFNS for everything above RSA-170.

 Similar Threads Thread Thread Starter Forum Replies Last Post a1call Miscellaneous Math 8 2018-05-21 16:25 flouran Math 2 2009-11-21 05:30 garo Lounge 11 2004-09-01 03:31 GP2 Lounge 2 2003-12-03 14:13 jocelynl Math 2 2002-11-23 00:27

All times are UTC. The time now is 11:11.

Tue Jan 25 11:11:58 UTC 2022 up 186 days, 5:40, 0 users, load averages: 1.25, 1.05, 1.03