Crate ring_algorithm
source · [−]Traits
Functions
Chinese remainder theorem
extended euclidian algorithm
calcurate greatest common divisor
test $\gcd(x, y) = 1$
division in modulo
calc inverse in modulo
extended euclidian algorithm with normalize
calcurate $a^p$ with exponentiation by squaring
calcurate $pa$ with mutliprecation by doubling