Study of the k-ary GCD Algorithm

Abstract

In our paper, we consider some approaches to accelerating the calculation of the Greatest Common Divisor (GCD) of natural numbers for given A and B based on the k-ary GCD algorithm. Such a task arises in the implementation of many mathematical and number-theoretic algorithms, for example, in cryptography and number theory (see [8]).