A novel fast hybrid GCD computation algorithm

Authors:
Faraoun Kamel Mohamed
Affiliations:
EEDIS Laboratory, Department of Computer Science, Faculty of Technology, Djilalli Liabbes University, Sidi Bel Abbès, 22000, Algeria
Venue:
International Journal of Computing Science and Mathematics
Year:
2014

Citing 5
Cited 0

Two fast GCD algorithms

Journal of Algorithms
The accelerated integer GCD algorithm

ACM Transactions on Mathematical Software (TOMS)
A double-digit Lehmer-Euclid algorithm for finding the GCD of long integers

Journal of Symbolic Computation - Special issue on design and implementation of symbolic computation systems
Modern computer algebra

Modern computer algebra
Acceleration of Euclidean algorithm and extensions

Proceedings of the 2002 international symposium on Symbolic and algebraic computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a novel algorithm for integer's greatest common divisor GCD computation that hybridises both Euclidian and binary algorithms according to a new schema, in order to accelerate the GCD computation especially in the case of large bit difference between the two inputs. The proposed algorithm run slightly faster than existing algorithms and is very much easier to implement. We provide a simple proof of correctness for the algorithm, and we show that best performances can be achieved for large integers when subtraction operator complexity is relatively low with respect to the division one.