RcppBigIntAlgos1.1.0 package

Features the multiple polynomial quadratic sieve (MPQS) algorithm for factoring large integers and a vectorized factoring function that returns the complete factorization of an integer. The MPQS is based off of the seminal work of Carl Pomerance (1984) <doi:10.1007/3-540-39757-4_17> along with the modification of multiple polynomials introduced by Peter Montgomery and J. Davis as outlined by Robert D. Silverman (1987) <doi:10.1090/S0025-5718-1987-0866119-8>. Utilizes the C library GMP (GNU Multiple Precision Arithmetic). For smaller integers, a simple Elliptic Curve algorithm is attempted followed by a constrained version of Pollard's rho algorithm. The Pollard's rho algorithm is the same algorithm used by the factorize function in the 'gmp' package.

Useful links

• https://github.com/jwood000/RcppBigIntAlgos/issues
• https://github.com/jwood000/RcppBigIntAlgos,
• http://mathworld.wolfram.com/QuadraticSieve.html
• https://micsymposium.org/mics_2011_proceedings/mics2011_submission_28.pdf
• https://www.math.colostate.edu/~hulpke/lectures/m400c/quadsievex.pdf
• https://blogs.msdn.microsoft.com/devdev/2006/06/19/factoring-large-numbers-with-quadratic-sieve/