math-prime-util-gmp

Math::Prime::Util::GMP is a Perl module for number theory that uses the GMP library directly, making it fast for large integers (bignums). It provides primality tests, prime generation in ranges, factoring, and related functions. While primarily intended for use within Math::Prime::Util, many functions can also be used in independent C programs. The module includes explicit support for building standalone executables. The ECPP primality proving code can be compiled using the provided xt/create-standalone.sh script. A standalone SIQS (Self-Initializing Quadratic Sieve) factoring executable can be built with `make siqs`, supporting positive inputs up to 366 bits. The SIQS tool reads whitespace-separated decimal integers from standard input when no arguments are given, retries composite cofactors, and marks unsplit composites as [incomplete]. Installation requires a C compiler compatible with the Perl build and the GMP development libraries. The module works with Perl 5.6.2 or later and uses no non-core Perl modules. It is distributed under the same terms as Perl itself.