Struct Montgomery32 

pub struct Montgomery32 { /* private fields */ }

Montgomery $R=2^{32}$

use modulo_n_tools::montgomery::{MontgomeryOperation, Montgomery32};
let m = Montgomery32::new(89);
let a = m.powmod(3, 57);
assert_eq!(a, 23);

Trait Implementations

impl MontgomeryOperation<u32, u64> for Montgomery32

fn calc_n_prime(n: &u32, s: u32) -> u32

$NN' \equiv -1 \pmod R$

fn new(n: u32) -> Self

Constructor for ${}\bmod N$

fn reduction(&self, x: u64) -> u32

Montgomery Reduction

fn convert(&self, x: u32) -> u32

$x \mapsto xR \bmod N$

fn powmod<V>(&self, a: T, p: V) -> T

where T: From<u8>, U: Clone + for<'x> Mul<&'x U, Output = U> + From<T>, V: Clone + Ord + ShrAssign<u32> + From<u8> + for<'x> BitAnd<&'x V, Output = V>,

calcutate $a^p \bmod N$