Struct FixedTrinomialSolinas64 

pub struct FixedTrinomialSolinas64<const P1: u8, const P2: u8, const K: i64>();

A modular reducer for trinomial Solinas numbers 2^P1 - 2^P2 + K as modulus with 64-bit operands.

Supports P1 up to 64, P2 < P1, and odd signed K with |K| < 2^P2. All inputs and outputs are u64. Uses u128 as the double-width intermediate for multiplication and reduction. The modulus 2^P1 - 2^P2 + K must be prime for modular inverse and Fermat-based operations to be valid.

Example

use num_modular::{FixedTrinomialSolinas64, Reducer};

const P1: u8 = 6;
const P2: u8 = 2;
const K: i64 = 1;
let modulus = (1u64 << P1) - (1u64 << P2) + (K as u64); // 2^6 - 2^2 + 1 = 61
let reducer = FixedTrinomialSolinas64::<P1, P2, K>::new(&modulus);
let a = reducer.transform(10);
let b = reducer.transform(20);
assert_eq!(reducer.residue(reducer.mul(&a, &b)), (10u64 * 20) % 61);

Implementations

impl<const P1: u8, const P2: u8, const K: i64> FixedTrinomialSolinas64<P1, P2, K>

pub const MODULUS: u64

Trait Implementations

impl<const P1: u8, const P2: u8, const K: i64> Clone for FixedTrinomialSolinas64<P1, P2, K>

fn clone(&self) -> FixedTrinomialSolinas64<P1, P2, K>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<const P1: u8, const P2: u8, const K: i64> Copy for FixedTrinomialSolinas64<P1, P2, K>

impl<const P1: u8, const P2: u8, const K: i64> Debug for FixedTrinomialSolinas64<P1, P2, K>

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

Formats the value using the given formatter.

impl<const P1: u8, const P2: u8, const K: i64> Reducer<u64> for FixedTrinomialSolinas64<P1, P2, K>

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 check(&self, target: &u64) -> bool

Check whether target is a valid reduced form

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

Transform a reduced form back to normal integer

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 -monty mod m in reduced form

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

Calculate (lhs * rhs) 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 sqr(&self, target: u64) -> u64

Calculate target^2 mod m in reduced form

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)