On implementation of an approximating k-ary GCD algorithm

Abstract

© Published under licence by IOP Publishing Ltd. In our paper, we investigate some implementations of an approximating k-ary GCD algorithm (AKA) for calculating the greatest common divisor of natural numbers for given A and B. This task has a great importance in the development of parameters for cryptographic encryption methods.