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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
