Regular Article
A Fast Euclidean Algorithm for Gaussian Integers

https://doi.org/10.1006/jsco.2001.0518Get rights and content
Under an Elsevier user license
open archive

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.

Cited by (0)