Crate ring_algorithm
source ·Traits
Normarize ring element
Functions
calc subproduct tree
calc subsum tree
Chinese remainder theorem
extended euclidian algorithm
Chinese remainder theorem
calcurate greatest common divisor
test $
\gcd(x, y) = 1
$modular reduction
division in modulo
calc inverse in modulo
calcurate $
a^p \pmod{m}
$extended euclidian algorithm with normalize
calcurate $
a^p
$ with exponentiation by squaringcalcurate $
pa
$ with mutliprecation by doubling