An approximating k-ary GCD algorithm
Sh. T. Ishmukhametov · Lobachevskii Journal of Mathematics · 2016
In our paper we elaborate a new version of the k -ary GCD algorithm. Our algorithm is based on the Farey Series and surpasses all existing realizations of the k-ary algorithm. It can have practical applications inMathematics and Cryptography.