@hackage factor1.1

Factoring integers and polynomials

This package implements a library of factoring algorithms, including the number field sieve for factoring arbitrary integers, the elliptic curve method for finding small factors of integers, the Miller-Rabin probabilistic primality test for integers, the Berlekamp-Zassenhaus algorithm for factoring integer polynomials, the Berlekamp algorithm for factoring polynomials over GF(p) (for small primes p), and the Cantor–Zassenhaus algorithm for factoring polynomials over GF(p) (for arbitrary odd primes p).