Program using quadratic sieve to factor integers

 This package includes William Hart's program to find prime factors of large
 integers (at least forty digits).
 .
 It does so using highly optimized multi-polynomial quadratic sieve.