Performance Analysis of Cryptographic Hash Functions Suitable for Use in Blockchain

• Published in: International journal of computer network and information security Vol. 13; no. 2; pp. 1 - 15
• Main Authors: Kuznetsov, Alexandr, Oleshko, Inna, Tymchenko, Vladyslav, Lisitsky, Konstantin, Rodinko, Mariia, Kolhatin, Andrii
• Format: Journal Article
• Language: English
• Published: Hong Kong Modern Education and Computer Science Press 01.04.2021
• Subjects: Algorithms; Blockchain; Comparative analysis; Cryptography; Hash based algorithms; Information storage; Messages
• ISSN: 2074-9090; 2074-9104
• DOI: 10.5815/ijcnis.2021.02.01

A blockchain, or in other words a chain of transaction blocks, is a distributed database that maintains an ordered chain of blocks that reliably connect the information contained in them. Copies of chain blocks are usually stored on multiple computers and synchronized in accordance with the rules of building a chain of blocks, which provides secure and change-resistant storage of information. To build linked lists of blocks hashing is used. Hashing is a special cryptographic primitive that provides one-way, resistance to collisions and search for prototypes computation of hash value (hash or message digest). In this paper a comparative analysis of the performance of hashing algorithms that can be used in modern decentralized blockchain networks are conducted. Specifically, the hash performance on different desktop systems, the number of cycles per byte (Cycles/byte), the amount of hashed message per second (MB/s) and the hash rate (KHash/s) are investigated. The comparative analysis of different hashing algorithms allows us to choose the most suitable candidates for building decentralized systems type of blockchain.