num-modular
| Crates.io | num-modular |
| lib.rs | num-modular |
| version | 0.6.1 |
| source | src |
| created_at | 2022-02-02 04:03:45.238229 |
| updated_at | 2023-08-31 01:56:00.965909 |
| description | Implementation of efficient integer division and modular arithmetic operations with generic number types. Supports various backends including num-bigint, etc.. |
| homepage | |
| repository | https://github.com/cmpute/num-modular |
| max_upload_size | |
| id | 525534 |
| size | 158,850 |
Jacob Zhong (cmpute)
documentation
https://docs.rs/num-modular
README
num-modular
A generic implementation of integer division and modular arithmetics in Rust. It provide basic operators and an type to represent integers in a modulo ring. Specifically the following features are supported:
- Common modular arithmetics:
add,sub,mul,div,neg,double,square,inv,pow - Optimized modular arithmetics in Montgomery form
- Optimized modular arithmetics with pseudo Mersenne primes as moduli
- Fast integer divisibility check
- Legendre, Jacobi and Kronecker symbols
It also support various integer type backends, including primitive integers and num-bigint. Note that this crate also supports [no_std]. To enable std related functionalities, enable the std feature of the crate.