ring-algorithm
| Crates.io | ring-algorithm |
| lib.rs | ring-algorithm |
| version | |
| source | src |
| created_at | 2020-03-14 16:02:32.733501+00 |
| updated_at | 2025-02-02 09:59:19.355448+00 |
| description | algorithms on ring (Abstruct Algebra) |
| homepage | https://crates.io/crates/ring-algorithm |
| repository | https://gitlab.com/Toru3/ring-algorithm |
| max_upload_size | |
| id | 218588 |
| Cargo.toml error: | TOML parse error at line 19, column 1 | 19 | autolib = false | ^^^^^^^ unknown field `autolib`, expected one of `name`, `version`, `edition`, `authors`, `description`, `readme`, `license`, `repository`, `homepage`, `documentation`, `build`, `resolver`, `links`, `default-run`, `default_dash_run`, `rust-version`, `rust_dash_version`, `rust_version`, `license-file`, `license_dash_file`, `license_file`, `licenseFile`, `license_capital_file`, `forced-target`, `forced_dash_target`, `autobins`, `autotests`, `autoexamples`, `autobenches`, `publish`, `metadata`, `keywords`, `categories`, `exclude`, `include` |
| size | 0 |
(Toru3)
documentation
https://docs.rs/ring-algorithm/
README
Ring Algorithm
Algorithms on ring.
- GCD (Greatest Common Divisor)
- coprime test
- EEA (Extended Euclidean Algorithm)
- solve $
ax\equiv 1 \pmod{m}$ (inverse) - solve $
ax\equiv b \pmod{m}$ (division) - CRT (Chinese Remainder Theorem)
- power in modulo $
a^p \pmod{m}$
Licence
AGPL-3.0-or-later