pub fn basic_montgomery_mul<T>(
a_mont: T,
b_mont: T,
modulus: T,
n_prime: T,
r_bits: usize,
) -> Twhere
T: Copy + Zero + One + PartialOrd + Mul<Output = T> + Add<Output = T> + Sub<Output = T> + Rem<Output = T> + Shr<usize, Output = T> + Shl<usize, Output = T> + BitAnd<Output = T> + WrappingAdd + WrappingSub,Expand description
Montgomery multiplication (Basic): (a * R) * (b * R) -> (a * b * R) mod N