The modular multiplicative inverse of a number /a/ is that number /x/ which satisfies /ax/ = 1 mod /p/. A fast algorithm for computing modular multiplicative inverses based on the extended Euclidean ...

Abstract: Computing Modular multiplicative inverse is an important step in many arithmetic algorithms used in Cryptography. For example, Montgomery modular multiplication [2] is required to find out ...