Abstract: 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 Oeps(n/log n) using only n1+eps processors on a Priority CRCW PRAM, for any constant eps > 0.