Open AccessPerformance analysis of arithmetic algorithms implemented in C++ and Python programming languages
Author(s) -
Andrey Novokshonov
Publication year - 2016
Publication title -
problemy programmirovaniâ
Language(s) - English
Resource type - Journals
ISSN - 1727-4907
DOI - 10.15407/pp2016.02-03.026
Subject(s) - arbitrary precision arithmetic , modulo , exponentiation , greatest common divisor , arithmetic , python (programming language) , computer science , modular arithmetic , saturation arithmetic , algorithm , subtraction , residue number system , mathematics , cryptography , programming language , discrete mathematics , mathematical analysis
This paper presents the results of the numerical experiment, which aims to clarify the actual performance of arithmetic algorithms implemented in C ++ and Python programming languages using arbitrary precision arithmetic. "Addition machine" has been chosen as a mathematical model for integer arithmetic algorithms. "Addition machine" is a mathematical abstraction, introduced by R. Floyd and D. Knuth. The essence of "addition machine" is the following: using only operations of addition, subtraction, comparison, assignment and a limited number of registers it is possible to calculate more complex operations such as finding the residue modulo, multiplication, finding the greatest common divisor, exponentiation modulo with reasonable computational efficiency. One of the features of this implementation is the use of arbitrary precision arithmetic, which may be useful in cryptographic algorithms.