IsInIntervalLEps returns true if n ∈ [-2ˡ⁺ᵉ,…,2ˡ⁺ᵉ].

IsInIntervalLEpsPlus1RootN returns true if n ∈ [-2¹⁺ˡ⁺ᵉ√N,…,2¹⁺ˡ⁺ᵉ√N], for a Paillier modulus N.

IsInIntervalLPrimeEps returns true if n ∈ [-2ˡ'⁺ᵉ,…,2ˡ'⁺ᵉ].

IsValidBigModN checks that ints are all in the range [1,…,N-1] and co-prime to N.

IsValidNatModN checks that ints are all in the range [1,…,N-1] and co-prime to N.

ModulusFromFactors creates the necessary cached values to accelerate exponentiation mod n.

ModulusFromN creates a simple wrapper around a given modulus n.

Modulus wraps a saferith.Modulus and enables faster modular exponentiation when the factorization is known.