Programming of an Approximating K-Ary GCD Algorithm
2021 ◽
Vol 2096
(1)
◽
pp. 012097
Keyword(s):
Abstract In our paper, we consider the procedure for effective programming of an approximating k-ary GCD algorithm of natural numbers in the C++ programming language in the Visual Studio programming environment with the installed MPIR library of long numbers. There are also some theoretical calculations that justify the application of certain solutions. The task of GCD computation has an important efficient in different applications of Number Theory and Cybersecurity.
2014 ◽
Vol 1014
◽
pp. 371-374
2020 ◽
Vol 30
(3)
◽
pp. 28-33
◽
2020 ◽
Vol 2
(7)
◽
pp. 36-41