github.com/bohutang/crypto-in-action @main

Computes two numbers product in modulo arithmetic. ```text a * b (mod m) ``` # Examples ```rust use algebra::arith; fn main() { …

Computes two numbers subtract in modulo arithmetic. ```text a - b (mod m) ``` # Examples ```rust use algebra::arith; fn main() { …

Computes two numbers division in modulo arithmetic. ```text a / b (mod m) ``` # Examples ```rust use algebra::arith; fn main() { …

Computes two numbers sum in modulo arithmetic. ```text a + b (mod m) ``` # Examples ```rust use algebra::arith; fn main() { let x …

Implements Extended Euclidean algorithm with non-recursive Given integers a and b, compute integers a and b such that ```text a * …

Computes exponention in modulo arithmetic. ```text a ^ b (mod m) ``` # Examples ```rust use algebra::arith; fn main() { let x = …