Package: RcppBigIntAlgos
Type: Package
Title: Factor Big Integers with the Parallel Quadratic Sieve
Version: 0.3.3
Authors@R: c(person("Joseph","Wood", role=c("aut","cre"), email="jwood000@gmail.com"),
             person("Free Software Foundation, Inc.", role ="cph"),
             person("Mike","Tryczak", role="ctb"))
Maintainer: Joseph Wood <jwood000@gmail.com>
Description: 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) and 'RcppThread' for sieving
    multiple polynomials in parallel. The Pollard's rho algorithm for
    factoring smaller numbers is the same algorithm used by the factorize
    function in the 'gmp' package.
License: GPL (>= 2)
Encoding: UTF-8
SystemRequirements: C++11, gmp (>= 4.2.3)
Depends: gmp
Imports: Rcpp
LinkingTo: Rcpp, RcppThread
Suggests: testthat, numbers, RcppAlgos
NeedsCompilation: yes
URL: https://github.com/jwood000/RcppBigIntAlgos, https://gmplib.org/,
        http://mathworld.wolfram.com/QuadraticSieve.html,
        http://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/
BugReports: https://github.com/jwood000/RcppBigIntAlgos/issues
RoxygenNote: 7.1.0
Packaged: 2020-10-06 23:26:15 UTC; josephwood
Author: Joseph Wood [aut, cre],
  Free Software Foundation, Inc. [cph],
  Mike Tryczak [ctb]
Repository: CRAN
Date/Publication: 2020-10-14 00:00:02 UTC
