8 results for tags
factoring x
-
Factoring relatively large semi-primes: or, why you should probably just give up, and use YAFU instead
In order to factor (relatively) large semi-primes (i.e. semi-primes larger than 150-bits), you should (probably) just ask YAFU (Yet Another Factoring Utility, https://github.com/DarkenCode/yafu) to try to factor the number for you in parallel using a highly-optimized number field sieve such as GGNFS (GPL General Number Field Sieve) or SIQS (Self-Initialising Quadratic Sieve). By using YAFU I was able to factor a 302-bit semi-prime in a little over half an hour , as opposed to over the course of 72 minutes using Sage’s Quadratic Sieve (QS).Sat Apr 23 23:44:34 2016 - permalink -- http://tylerfisher.org/factoring/
-
NFS@Home
NFS@Home is a research project that uses Internet-connected computers to do the lattice sieving step in the Number Field Sieve factorization of large integers.Wed Oct 14 16:49:25 2009 - permalink -- http://escatter11.fullerton.edu/nfs/
-
Faktorisierung
Another applet to factor integers using trial division, p-1, Pollard rho and ECM. From MP.Mon Oct 22 23:05:10 2007 - permalink -
On 2022-09-07, it is no longer available.- http://www2.informatik.hu-berlin.de/~schoenbe/
-
Factorization using the Elliptic Curve Method
Java program to factor large numbers. In addition to ECM, it detects algebraic factors for Cunningham numbers and can use the Self Initialising Quadratic Sieve algorithm.Mon Oct 22 17:24:59 2007 - permalink -- http://www.alpertron.com.ar/ECM.HTM
-
This directory lists the old pages of new factors from the Cunningham Project.
Factors of numbers b^n+/-1, together with the names of the researchers and the methods used.Tue Jan 16 11:55:54 2007 - permalink -- http://homes.cerias.purdue.edu/~ssw/cun/oldp/index.html
-
AMS Online Books/Factorizations of b^{n}+/- 1, b=2,3,5,6,7,10,11,12 Up to High Powers/conm22
Could be interesting for my partial factorisation of r1030.Mon Jan 8 10:48:50 2007 - permalink -- http://www.ams.org/online_bks/conm22/
-
New Prime Factorisation Record obtained using the General Number Field Sieve
A 158-digit number was factored using GNFS on a cluster of PCs on 18 January 2002.Thu Jan 4 15:35:14 2007 - permalink -- http://www.ercim.org/publication/Ercim_News/enw49/franke.html
-
Integer Factorization Source Code (msieve)
Self-initializing quadratic sieve (SIQS), on a 2GHz Opteron, a 95 digit factorization takes 4 hours, and a 100-digit factorization takes just under 12 hours (possibly more). Public domain library for integer factorization, implementing Pollard-rho, ECM, self-initializing Quadratic Sieve and parts of NFS.Thu Jan 4 15:19:11 2007 - permalink -
On 2022-06-21, the original page http://www.boo.net/~jasonp/qs.html is off-line: "All Delmarva Online services have been discontinued. December 27, 2014"
With the help of http://web.archive.org/web/20110723030828/http://www.boo.net/~jasonp/qs.html, I could locate the repository https://sourceforge.net/projects/msieve/files/msieve/ which has been updated 2016-11-11. I changed the URL for the bookmark to the sourceforge repository.- https://sourceforge.net/projects/msieve