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

Let n/d∈Q,m be a positive integer and Let u=n/d mod m. Thus u is the image of a rational number modulo m. The rational reconstruction problem is: given u and m find n/d. Classical Euclidean Algorithm ...

Analysis of the proposed algorithm shows that it is more efficient than the Extended Euclid algorithm (XEA). In addition, if a MMI does not exist, then it is not necessary to use the Backtracking ...