num-prime 0.3.0-alpha

Generic and optimized primality test, factorization and various number theoretic functions with arbitrary precision based on `num`.
Documentation
1
2
3
4
5
6
7
8
9
10
11
12
13
# Roadmap for v0.2
- Implement SIQS
- Add benchmarks for factorization & primality test (ref: SageMath benchmark tests)
- Support no_std
- Use NumAssign as trait bounds and see if there's prominent performance improvement

# Roadmap for v1
- Support `rug` and `ibig` as backend
- Stablize API, determine minimal verison for each dependency
- Euler totient
- Implement a wrapper supporting fast modular arithmetics. (Maybe implement it as `Eiter<Integer, ModularInteger>`)
- [?] Support rug & primal or primesieve-sys as backend
- [?] Support async and multi-thread