The Extended Euclidean Algorithm is an extension of the Euclidean Algorithm, which is used to find the greatest common divisor (GCD) of two integers. The extended version not only finds the GCD, but ...

In certain computational systems the amount of space required to execute an algorithm is even more restrictive than the corresponding time necessary for solution of a problem. In this paper an ...

Numerous cryptographic algorithms (ElGamal, Rabin, RSA, NTRU etc) require multiple computations of modulo multiplicative inverses. This paper describes and validates a new algorithm, called the ...

Abstract: Multiplicative modular inverse is a vital operation carried out in most of the public-key systems that can accelerate the entire modular exponentiation process. In this paper a new algorithm ...

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 ...

A [modular multiplicative inverse][1] of an integer $a$ is an integer $x$ such that $a\cdot x$ is congruent to 1 modular some modulus $m$. To write it in a formal way ...