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)
ax\equiv 1 \pmod{m}
ax\equiv b \pmod{m}
AGPL-3.0-or-later