20090529, 05:01  #12  
Oct 2004
Austria
2×17×73 Posts 
Quote:


20090529, 06:51  #13  
Nov 2008
2·3^{3}·43 Posts 
Quote:
Last fiddled with by 10metreh on 20090529 at 06:52 

20090604, 05:49  #14 
Jul 2004
2^{4}×3 Posts 
There is another quadratic sieve implementation which is called basicqs and available from http://code.google.com/p/basicqs.

20090606, 02:26  #15 
Einyen
Dec 2003
Denmark
3,037 Posts 
Maybe add links to sieving and primality proving programs?
Sieving: NewPGen: http://primes.utm.edu/programs/NewPGen/ / http://jpenne.free.fr/NewPGen/ (twin primes, Sophie Germain, Cunningham Chain) Multisieve: http://primes.utm.edu/bios/page.php?id=449 / http://www.primzahlenarchiv.de/softw...isieve_gui.zip (Cullens/Woodalls, Generalized/Hyper/Near Cullens/Woodalls, factorials, multifactorials, primodials and more) Fermat: http://www.fermatsearch.org/Fermat_44_beta.zip (sieve for fermat factors F24 ~ F2000) FermFact: http://www.fermatsearch.org/FermFact09b.zip (sieve for fermat factors F2000 ~ F500000) gcwsieve: http://primes.utm.edu/bios/page.php?id=1223 (Generalized Cullen/Woodall n*b^{n}+1 ) srsieve: http://www.geocities.com/g_w_reynolds/srsieve/ (k*b^n+c with fixed b,multiple fixed k,c and variable n) sr1sieve: http://www.geocities.com/g_w_reynolds/sr1sieve/ (specialised for sieving a single sequence k*b^n+/1) sr2sieve: http://www.geocities.com/g_w_reynolds/sr2sieve/ (a sieve for multiple sequences k*b^n+/1 and b^n+/k) sr5sieve: http://www.geocities.com/g_w_reynolds/sr5sieve/ (sieve for the Sierpinski/Riesel Base 5 projects) AP26: http://www.geocities.com/g_w_reynolds/AP26/ (BOINC app for finding record length 26 arithmetic progression of primes) APTreeSieve: http://primes.utm.edu/bios/page.php?id=809 (arithmetic progressions k*b + a with arbitrary a, b) Primality Proving: Primo: http://www.ellipsa.eu/public/misc/downloads.html (ECPP algorithm for general numbers, no special form) Proth: http://primes.utm.edu/programs/gallot/ (k*2^{n}+1 2^{n} > k) LLR: http://primes.utm.edu/bios/page.php?id=431 (k*2^{n}+/1 2^{n} > k) OpenPFGW (PrimeForm): http://primes.utm.edu/bios/page.php?lastname=PrimeForm / http://www.fermatsearch.org/pfgw_ver...gw_winpfgw.zip (probable prime tests of arbitrary expressions) GeneFer: http://galloty.chez.com/primes/pgm/ (large probable generalized Fermat primes) Last fiddled with by ATH on 20090606 at 03:00 
20090606, 12:39  #16  
"Mark"
Apr 2003
Between here and the
6,247 Posts 
Quote:


20090903, 05:29  #17 
Jul 2004
60_{8} Posts 
Another gnfs implementation, called kmGNFS, is available from http://kmgnfs.cti.gr/kmGNFS/Home.html.

20091130, 17:54  #18 
"Ben"
Feb 2007
3,371 Posts 
Potentially a CUDA implementation of QS. I wonder if he was successful, and if he will make his implementation public.

20100316, 10:13  #19 
Jul 2009
Tokyo
2×5×61 Posts 
To factor a Fermat number F_n = 2^(2^n)+1.
http://www.perfsci.com/freesoftware.asp#giantint 
20100316, 18:46  #20  
Banned
"Luigi"
Aug 2002
Team Italia
3·1,601 Posts 
Quote:
Luigi 

20101001, 11:24  #21 
Oct 2009
3^{2}×7 Posts 
Are there any simple tools to get p,q from D and N ?Or some good small hex calc that can do this work? Or applet.

20101001, 12:38  #22 
Tribal Bullet
Oct 2004
2×3×19×31 Posts 
If you know the private exponent d in RSA, then there's no point in factoring the modulus (you know the secret that can decrypt the communications of others). Now, if you don't care about the factors of the modulus but just want d, there are numbertheoretic attacks that can break a weak RSA key. CrypTool has implemented one of them.

Thread Tools  
Similar Threads  
Thread  Thread Starter  Forum  Replies  Last Post 
Links to Factoring Projects  rogue  Factoring  20  20141119 01:08 
Links to Factoring Programs  rogue  Factoring  32  20090917 11:40 
factoring programs  henryzz  Factoring  6  20070919 13:47 
looking for Fermat factoring programs  ixfd64  Factoring  1  20050908 12:13 
any good GNFS factoring programs?  ixfd64  Factoring  1  20040427 09:41 