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

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

pub fn find_divisor_pollard_rho_repeat(
    n: u64,
    epochs: u8,
) -> Result<u64, &'static str> {
    let multiplier = MontgomeryMultiplication64::new(n);

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

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

    Err("no divisor found")
}

// TODO:
#[cfg(test)]

mod tests {

    #[test]

    fn test() {}
}