dsalgo 0.3.10

A package for Datastructures and Algorithms.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42

use crate::{
    find_divisor_pollard_rho_with_brent_cycle_detection::*,
    montgomery_modular_multiplication_64::*,
};

pub fn find_prime_factor_pollard_rho<F>(
    is_prime: &F,
    mut n: u64,
    epochs: u8,
) -> Result<u64, &'static str>
where
    F: Fn(u64) -> bool,
{
    let multiplier = MontgomeryMultiplication64::new(n);

    if is_prime(n) {
        return Ok(n);
    }

    for c in 1..=epochs {
        let prng = |x: u64| (multiplier.mul(x, x) + c as u64) % n;

        if let Ok(divisor) = find_divisor_pollard_rho_brent(n, &prng) {
            if is_prime(divisor) {
                return Ok(divisor);
            }

            n = divisor;
        }
    }

    Err("no divisor found")
}

#[cfg(test)]

mod tests {

    #[test]

    fn test() {}
}