Factorization of 2^643-3 was initiated by Joe Crump back in 2001 in search for new solutions to the congruence 2^n=3(mod n). At that time he ended up with a...
This patch implements a simple matsolve save file facility for the ggnfs-0.77.1 20050930 snapshot. It adds one command line parameter to matsolve, '-save N',...
Sorry, the patch got mangled by the yahoo message editor. Use the original at http://www.geocities.com/g_w_reynolds/ggnfs/matsave.txt Geoff. Send instant...
... Geoffrey, could you please try to apply it to the current CVS version (see http://sourceforge.net/cvs/?group_id=140917 ) and adjust your patch if there are...
I access the internet from my local library and so don't have CVS client software installed. If you chould check out the latest version and email me a tarball,...
Thanks Max. I have submitted a feature request at sourceforge.org with an improved patch attached that should apply cleanly. Regards, Geoff. ... I've put...
Hello, Geoffrey. You wrote Saturday, March 11, 2006, 1:29:59 AM: GR> Thanks Max. I have submitted a feature request at sourceforge.org with GR> an improved...
Hello, Geoffrey. You wrote Saturday, March 11, 2006, 1:29:59 AM: GR> Thanks Max. I have submitted a feature request at sourceforge.org with GR> an improved...
... Hello everyone, I just found out about ggnfs a few days ago and have finally got it up and running and factoring numbers. I was able to factor a c112 with...
Hello everyone, Sorry for sending that e-mail to the list, I'm still new to using the yahoo interface and accidentally sent that message to the list instead of...
... For GNFS, you should use a 4th degree poly for factorizations up to about 100 digits, and should use a 5th degree poly for anything bigger. For SNFS the...
Jason Papadopoulos
jasonp@...
Mar 19, 2006 6:28 pm
1803
Hi all. I have been haveing some success with useing gnfs mode with severall numbers upto about 120 digits so far. So i thought i would try my hand at snfs...
Martin, An SNFS polynomial cannot be generated from just the decimal expansion of a number. Otherwise, GNFS would do it! :-) To generate an SNFS polynomial,...
Hi, Is their any replacement for mallinfo() ( which is used in mallocReport() in misc.c ) on 64 bit machines. Thanks & Regards, Raghu ... Jiyo cricket on...
... From what I have gleaned from discussions on this group and elsewhere, GGNFS is not yet up to the task of factoring a number of that size. It seems that it...
Sometimes 6th degree polys are useful in SNFS, e.g. I recently completed a 120-digit composite factor of 653^81 + 1 using a 6th-degree polynomial. Since...
... Bob Silverman showed that if your factor bases are too small you have *exponentially* more sieving to do; you cannot skimp on this parameter. See his paper...
Jason Papadopoulos
jasonp@...
Mar 31, 2006 5:03 pm
1811
Where can I read more about mfba and mfbr? If increasing mfbr&mfba cause noticeably increasing of yield, may I increase them without after-effects? For example...
s> Where can I read more about mfba and mfbr? s> If increasing mfbr&mfba cause noticeably increasing of yield, may I s> increase them without after-effects? ...
... mfbr and mfba are the bitsize cutoffs for the residues left over after trial division. The lattice siever will try MPQS and rho factorization on any...
... Those don't make as much difference. As msbr and mfba go up the lattice siever's MPQS routine does much much more work for very little gain. It is possible...
Jason Papadopoulos
jasonp@...
Apr 2, 2006 12:30 pm
1816
Dear answer, i am looking for the program which can process the filtering step of the number field sieve. if you have some information about this ,please tell...
Dear, I asked to have a copy of the CWI program. But for some reaon or another I never got reply to my e-mail request. Here is the link: (mersenneforum.org) ...
Having problems with message search?
Fill out this form to ensure your group is one of the first to be migrated to the new message search system.
