Modular Inversion

- Mathematics & Logic -
Pure Mathematics Dictionary
The procedure of finding an integer x such that a·x ≡ 1 (mod m) when such x exists; equivalently finding the multiplicative inverse of a modulo m, typically computed via the Extended Euclidean Algorithm when gcd(a,m)=1.