Statistical testing of blockchain hash algorithms

Various methods are used for statistical testing of cryptographic algorithms, for example, NIST STS (A Statistical Test Suite for the Validation of Random Number Generators and Pseudo Random Number Generators for Cryptographic Applications) and DIEHARD (Diehard Battery of Tests of Randomness). Tests consists of verification the hypothesis of randomness for sequences generated at the output of a cryptographic algorithm (for example, a keys generator, encryption algorithms, a hash function, etc.). In this paper, we use the NIST STS technique and study the statistical properties of the most common hashing functions that are used or can be used in modern blockchain networks. In particular, hashing algorithms are considered which specified in national and international standards, as well as little-known hash functions that were developed for limited use in specific applications. Thus, in this paper, we consider the most common hash functions used in more than 90% of blockchain networks. The research results are given as average by testing data of 100 sequences of 108 bytes long, which means that is, the size of the statistical sample for each algorithm was 1010 bytes. Moreover, each test (for each of the 100 sequences) was considered as an independent observation. In addition, the article presents statistical portraits for each algorithm under study (diagrams of the numbers of passing each test).