Module ring::arithmetic::bigint::modulus

source ·

Structs§

  • The modulus m for a ring ℤ/mℤ, along with the precomputed values needed for efficient Montgomery multiplication modulo m. The value must be odd and larger than 2. The larger-than-1 requirement is imposed, at least, by the modular inversion code.

Constants§

  • The x86 implementation of bn_mul_mont, at least, requires at least 4 limbs. For a long time we have required 4 limbs for all targets, though this may be unnecessary. TODO: Replace this with n.len() < 256 / LIMB_BITS so that 32-bit and 64-bit platforms behave the same.