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

Finds the GCD using the euclidean algorithm or finds a linear combination of the GCD using the extended euclidean algorithm with all steps/work done shown ...

Improve this page Add a description, image, and links to the extended-euclidean-algorithm topic page so that developers can more easily learn about it.

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

A new parallelization of the extended Euclidean GCD algorithm is proposed. It matches the best existing integer GCD algorithms since it can be achieved in parallel O/sub eps/(n/log n) using only n/sup ...