Rust Prime Factorization Library

This Rust library provides various prime factorization algorithms for integers. Choose the most suitable algorithm for your needs.

Algorithms

The following prime factorization algorithms:

1. Trial Division
2. Pollard's Rho Algorithm
3. Fermat's Factorization Method
4. Euler's Factorization Method (TODO)
5. Special Number Field Sieve (TODO)
6. Dixon's Algorithm (TODO)
7. Continued Fraction Factorization (TODO)
8. Quadratic Sieve (TODO)
9. Rational Sieve (TODO)
10. General Number Field Sieve (TODO)
11. Shanks's Square Form Factorization (TODO)
12. Pollard's p-1 Factorization

Usage

To use this library, add it as a dependency in your Cargo.toml file:

[dependencies]
pfact = { path = "path/to/pfact"}

Then, import the desired algorithm(s) in your Rust source code:

extern crate pfact;

use pfact::trial_division;
use pfact::pollards_rho;
// ... import other algorithms as needed

To factorize a number using a specific algorithm:

use num_bigint::BigUint;
use pfact::trial_division;

fn main() {
    let number: BigUint = BigUint::from(1234567u32);
    let factor = trial_division::get_lowest_prime_factor(number);
    println!("Prime factors: {}", factor);
}
// Replace trial_division with the desired algorithm in the example above.