A Fast Euclidean Algorithm for Gaussian Integers |
| |
| Affiliation: | 1. Department of Computer and Information Sciences, University of Delaware, Newark, DE 19716, U.S.A. |
| |
| 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. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
