The Accelerated Data Hashing Method

Abstract

The method of accelerated hashing of data on the basis of building a tree of intermediate hash values using parallelized calculations on the microprocessor cores is proposed. The message is divided into blocks of the same length, and the hash value is calculated by constructing a tree of intermediate results, which allows achieving an acceleration of the hashing process compared to the classical iteration method.