GitHub

README.md

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 ...
Scientific Research Publishing

Enhanced Euclid Algorithm for Modular Multiplicative Inverse and Its Application in Cryptographic Protocols ()

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

Efficient Computation of Modular Multiplicative Inverse w.r.t 2 i

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 ...
Scientific Research Publishing

B. Verkhovsky, “Space Complexity of Algorithm for Modular Multiplicative Inverse”, International Journal of Communications, Network and System Sciences, Vol. 4, No. 6, 2011 ...

ABSTRACT: This paper describes an algorithm for secure transmission of information via open communication channels based on the discrete logarithm problem. The proposed algorithm also provides sender ...