modmath 0.2.0

Modular math implemented with traits.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47

//! Schoolbook modular arithmetic for `Clone`-bound types with mixed
//! by-value and by-reference parameters.
//!
//! Use this module when the operand type satisfies `T: Clone + ...`
//! but not necessarily `Copy` — heap-allocated bigints like
//! `num_bigint::BigUint`, `ibig::UBig`, and `bnum` types fit here.
//!
//! See [`modmath::basic`](crate::basic) for the simpler `Copy`-bound
//! surface and [`modmath::strict`](crate::strict) for the
//! reference-only surface (works with backends that don't expose
//! `WrappingMul` / `WrappingSub` on owned values).
//!
//! ## Pre-reduced variants
//!
//! [`pre_reduced`] re-exports `add` / `sub` / `mul` / `exp` siblings that
//! assume inputs are already in `[0, m)` and skip the `% m` reduction
//! step. Works for backends without `core::ops::Rem` and is the right
//! entry point inside loops where reduction is handled separately.
//! Note: `inv` has no pre-reduced sibling — modular inverse via the
//! extended Euclidean algorithm inside `inv` performs its own
//! magnitude-dependent loop, with no useful "pre-reduced" shortcut.

#[doc(inline)]
pub use crate::add::constrained_mod_add as add;
#[doc(inline)]
pub use crate::exp::constrained_mod_exp as exp;
#[doc(inline)]
pub use crate::inv::constrained_mod_inv as inv;
#[doc(inline)]
pub use crate::mul::constrained_mod_mul as mul;
#[doc(inline)]
pub use crate::sub::constrained_mod_sub as sub;

pub mod montgomery;

/// Pre-reduced variants. Caller guarantees inputs are in `[0, m)`;
/// no `Rem` bound.
pub mod pre_reduced {
    #[doc(inline)]
    pub use crate::add::constrained_mod_add_pr as add;
    #[doc(inline)]
    pub use crate::exp::constrained_mod_exp_pr as exp;
    #[doc(inline)]
    pub use crate::mul::constrained_mod_mul_pr as mul;
    #[doc(inline)]
    pub use crate::sub::constrained_mod_sub_pr as sub;
}