用基本二次筛分解

This code is a result of hobby programming on linux during 3rd year of my degree (bachelor of engineering), It is a implementation of basic quadritic sieve, that is without self initializing multi polinomial sieve. if u want to factorize seriously large numbers better consider one of these : ggnfs (implements number field sieve) or msieve (implements self initializing mutiple polynomial quadratic sieve). This code is an Implementation of Basic Quadratic Sieve, and uses Gaussian elimination method at the final stage. User can control the amount the memory used, no of primes to be used, etc .....see --help option Source: _DOWNLOAD FROM TRUNK USING SVN._ REQUIREMENTS Basic programming environment under Linux(gcc, make, etc....) and gmp library. Papers (Referred) Carl Pomerance - A Tale of two Sieves link: http://www.ams.org/notices/199612/pomerance.pdf Eric Landquist

basicqs
README
factorize.c
factorize_old.c
output.txt
rsa_main.c
primes.txt
main.c
input.txt
Makefile
qfs.h
tmp
factor_base.c
gaussian.c