This crate provides utilities for integer modular arithmetics and prime related functionalities:
- Modular Arithmetics
- Modular operators: add, sub, mul, pow, neg, inv
- Jacobi Symbol
- Related Number theoretic functions
- Moebius function
- Primality check
- Fermat probable prime test
- Miller-rabin probable prime test
- (strong/extra strong) Lucas probable prime test
- Baillie-PSW test
- Deterministic checks of u64 integers (using very a fast Miller-rabin variant with hashing)
- Primes generation and indexing
- A naive implementation of the sieve of Eratosthenes
- Unified API to support other prime generation backends
- Integer factorization
- Trial division
- Pollard's rho algorithm
- Shanks's square forms factorization (SQUFOF)
- Fast implementation of u64 integers
It's based on the num creates.