modmath

Function strict_from_montgomery

Source 
pub fn strict_from_montgomery<T>(
    a_mont: T,
    modulus: &T,
    n_prime: &T,
    r_bits: usize,
) -> T
where
    for<'a> T: Zero + One + PartialOrd + Shl<usize, Output = T> + Shr<usize, Output = T> + Sub<Output = T> + OverflowingAdd + Mul<&'a T, Output = T> + RemAssign<&'a T> + Sub<&'a T, Output = T>,
    for<'a> &'a T: Rem<&'a T, Output = T> + Sub<&'a T, Output = T> + Mul<&'a T, Output = T>,
Expand description

Convert from Montgomery form (Strict): (a * R) -> a mod N Uses Montgomery reduction algorithm with reference-based operations to minimize copying of large integers