Investigation of the k-ary GCD Algorithm for Natural Numbers
Ismail F. Amer, Sh. T. Ishmukhametov · 2020 International Multi-Conference on Industrial Engineering and Modern Technologies (FarEastCon) · 2020
In our paper we investigate the k-ary Algorithm for finding GCD of long natural numbers. We suggest an effective modification for the Algorithm which gives an essential acceleration for the whole procedure of finding GCD. The common task of GCD calculation plays an important role in different spheres of Number Theory and Cryptography. It has applications in arithmetic of Finite Fields and key generation for the Cryptography.