A fast Euclidean algorithm for Gaussian integers

Abstract

A new version of the Euclidean algorithm is developed for computing the greatest common divisor of two Gaussian integers. It uses approximation to obtain a sequence of remainders of decreasing absolute values. The algorithm is compared with the new (1+i)-ary algorithm of Weilert and found to be somewhat faster if properly implemented. © 2002 Elsevier Science Ltd.