Hi,

First of all everything above RSA-512 is not duable for people without a large cluster to factorize this on, RSA-640 is the largest factorized RSA key till now, RSA-1024 is just impossible todo

For a fast quadratic sieve implementation for windows u can goto:

http://www.boo.net/~jasonp/qs.html
If the modulus is bigger then 110 digits i recommend using the General Number Field Sieve, u can find a implementation of it here:

http://www.math.ttu.edu/~cmonico/software/ggnfs/
I hope this info is of any use

Regards,

LibX / Reteam