In this paper an improved architecture of Extended-Euclidean Algorithm (EEA) for finding Modular Multiplicative Inverse (MMI) and Jacobi symbol is proposed. Implementation is done using Hardware ...

Now that we know the gcd is 1, we use the extended Euclidean algorithm to express 1 as a linear combination of 14 and 59. We work backwards from the Euclidean algorithm: ...

This paper describes and validates a new algorithm, called the Enhanced Euclid Algorithm, for modular multiplicative inverse (MMI). Analysis of the proposed algorithm shows that it is more efficient ...

in this case the loop runs for 21783 times to find the mmi in worst case which takes a huge time to compute for that we go for an algorithm called the EXTENDED EUCLIDEAN ALGORITHM to find the mmi ...