pub fn strict_montgomery_mod_mul<T>(a: T, b: &T, modulus: &T) -> Option<T>where
for<'a> T: Zero + One + PartialEq + PartialOrd + Shl<usize, Output = T> + Sub<Output = T> + Shr<usize, Output = T> + OverflowingAdd + OverflowingSub + RemAssign<&'a T> + Mul<&'a T, Output = T> + Div<&'a T, Output = T> + Sub<&'a T, Output = T> + Add<&'a T, Output = T> + AddAssign<&'a T>,
for<'a> &'a T: Rem<&'a T, Output = T> + Mul<&'a T, Output = T> + Sub<&'a T, Output = T> + Div<&'a T, Output = T> + Sub<T, Output = T> + Add<&'a T, Output = T> + BitAnd<Output = T>,Expand description
Complete Montgomery modular multiplication (Strict): A * B mod N Uses reference-based operations throughout to minimize copying of large integers Returns None if Montgomery parameter computation fails