In EDS ansehen

Performance analysis of arithmetic algorithms implemented in C++ and Python programming languages

Gespeichert in:
Bibliographische Detailangaben
Titel: Performance analysis of arithmetic algorithms implemented in C++ and Python programming languages
Autoren: Novokshonov, A.K.
Verlagsinformationen: Інститут програмних систем НАН України
Publikationsjahr: 2018
Schlagwörter: C++, Python, GMP, addition, subtraction, greatest common divisor, exponentiation, Fibonacci numbers, UDC 004.021
Beschreibung: 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.Problems in programming 2016; 2-3: 26-31
Publikationsart: other/unknown material
Sprache: Ukrainian
Verfügbarkeit: https://harvester.nas.gov.ua/Record/pp_isofts_kiev_ua-article-177
Dokumentencode: edsbas.FBF0D107
Datenbank: BASE
Beschreibung
Abstract: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.Problems in programming 2016; 2-3: 26-31