Improvements on the accelerated integer GCD algorithm

The present paper analyses and presents several improvements to the algorithm for finding the $(a,b)$-pairs of integers used in the $k$-ary reduction of the right-shift $k$-ary integer GCD algorithm. While the worst-case complexity of Weber's "Accelerated integer GCD algorithm" is $\cOł(\log_ϕ(k)^2\... View More