Struct FixedMontgomery64 

pub struct FixedMontgomery64<const P: u64>;

A modular reducer based on Montgomery form for 64-bit operands, with the modulus P known at compile time.

Example

use num_modular::{FixedMontgomery64, Reducer};

const P: u64 = 97;
let reducer = FixedMontgomery64::<P>::new(&P);
let a = reducer.transform(10);
let b = reducer.transform(20);
assert_eq!(reducer.residue(reducer.mul(&a, &b)), (10u64 * 20) % 97);

Implementations

impl<const P: u64> FixedMontgomery64<P>

pub const MODULUS: u64 = P

Trait Implementations

impl<const P: u64> Clone for FixedMontgomery64<P>

fn clone(&self) -> FixedMontgomery64<P>

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<const P: u64> Copy for FixedMontgomery64<P>

impl<const P: u64> Debug for FixedMontgomery64<P>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<const P: u64> Reducer<u64> for FixedMontgomery64<P>

fn new(m: &u64) -> Self

Create a reducer for a modulus m

fn transform(&self, target: u64) -> u64

Transform a normal integer into reduced form

fn residue(&self, target: u64) -> u64

Transform a reduced form back to normal integer

fn check(&self, target: &u64) -> bool

Check whether target is a valid reduced form

fn modulus(&self) -> u64

Get the modulus in original integer type

fn is_zero(&self, target: &u64) -> bool

Test if the residue() == 0

fn add(&self, lhs: &u64, rhs: &u64) -> u64

Calculate (lhs + rhs) mod m in reduced form

fn sub(&self, lhs: &u64, rhs: &u64) -> u64

Calculate (lhs - rhs) mod m in reduced form

fn dbl(&self, target: u64) -> u64

Calculate 2*target mod m

fn neg(&self, target: u64) -> u64

Calculate -target mod m in reduced form

fn mul(&self, lhs: &u64, rhs: &u64) -> u64

Calculate (lhs * rhs) mod m in reduced form

fn sqr(&self, target: u64) -> u64

Calculate target^2 mod m in reduced form

fn inv(&self, target: u64) -> Option<u64>

Calculate target^-1 mod m in reduced form, it may return None when there is no modular inverse.

fn pow(&self, base: u64, exp: &u64) -> u64

Calculate base ^ exp mod m in reduced form

fn add_in_place(&self, lhs: &mut T, rhs: &T)

fn sub_in_place(&self, lhs: &mut T, rhs: &T)

fn mul_in_place(&self, lhs: &mut T, rhs: &T)