To build the integer factorization program first install the GNU Multiple Precision Arithmetic Library.
Then to build type 'make'.
Now type ./factor [integer number] -[algorithm] [option 1] [option 2] [option 3] [option 4]
The algorithm type can be trial division ('-t'), Pollard's Rho ('-r') or Quadratic Sieve ('-q').
The options are only applicable to the quadratic sieve. option 1: '1' runs Multiple Polynomial Quadratic Sieve (MPQS). Otherwise use '0'. option 2: '1' runs One Large Prime Variation. Otherwise use '0'. option 3: '1' runs Cache Block "Optimization" (doesn't actually improve performance). Otherwise use '0'. option 4: '1' runs Two Large Prime Variation. Otherwise use '0'. Only seems to work for 70+ digit numbers.