A Sublinear Time Parallel GCD Algorithm for the EREW PRAM

We present a parallel algorithm that computes the greatest common divisor of two integers of n bits in length that takes O(n log log n / logn) expected time using n 6+ǫ processors on the EREW PRAM parallel model of computation. We believe this to be the first sublinear time algorithm on the EREW PRAM for this problem