Crate large_primes
Source - fermat
- gcd
- miller_rabin
- pow
- standard
- utils
- fermat
- Performs a probabilistic primality test using Fermat’s little theorem.
- gcd
- Computes the greatest common divisor (GCD) of two
BigUint numbers using the Euclidean algorithm. - get_max_primes
- Generates all prime numbers up to a given maximum value.
- lucas_lehmer_test
- Performs the Lucas-Lehmer test for Mersenne primes.
- miller_rabin
- Performs the Miller-Rabin primality test.
- pow
- Computes the power of a
BigUint base raised to a BigUint exponent. - pow_mod
- Computes the modular exponentiation of a
BigUint base raised to a BigUint exponent modulo another BigUint. - standard
- Performs the standard primality test by checking for prime factors from 2 to the square root of the given number.