Comparative analysis of binary-decimal numbers summers on cryptography algorithms realizations

Abstract

Nowadays the maintenance of information systems without modern information security methods and means is impossible. Among them the primary role for security providing is assigned to cryptography. Most of encryption systems and digital signature systems use integer arithmetic modulo a large positive number. Therefore, to ensure the best performance of information security systems need effective methods of implementation of operations and multiply exponentiation for a large number of precision. High performance, simplicity, security and reliability can be achieved by hardware implementations of cryptographic algorithms using binary-decimal numbers summers. In the paper thecomparative analysis of existing binary-decimal numbers summers is carried out. Different variants of its making are identifying and binary-decimal numbers summers’ speed and complexity of implementation are estimating.