{"id":55092,"date":"2020-01-12T00:00:00","date_gmt":"2020-01-11T21:00:00","guid":{"rendered":"https:\/\/prohoster.info\/blog\/blog_prohoster\/dostupna-kriptograficheskaya-hesh-funktsiya-blake3-kotoraya-v-10-raz-bystree-sha-2"},"modified":"2020-02-18T14:03:10","modified_gmt":"2020-02-18T11:03:10","slug":"dostupna-kriptograficheskaya-hesh-funktsiya-blake3-kotoraya-v-10-raz-bystree-sha-2","status":"publish","type":"post","link":"https:\/\/prohoster.info\/en\/blog\/news\/dostupna-kriptograficheskaya-hesh-funktsiya-blake3-kotoraya-v-10-raz-bystree-sha-2","title":{"rendered":"A cryptographic hash function BLAKE3 is available, which is 10 times faster than SHA-2","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"

The final implementation of the algorithm has been published BLAKE3<\/a><\/noindex>, offering a cryptographic hash function designed for applications such as file integrity checks, message authentication, and data creation for digital signatures. BLAKE3 is not intended for hashing passwords (for passwords, use yescrypt, bcrypt, scrypt, or Argon2), as it aims for the fastest hash computations with guaranteed collision resistance, protection against preimage attacks<\/a><\/noindex> and insensitivity to the size of hashed data. The reference implementation of BLAKE3 published<\/a><\/noindex> under a dual license \u2014 public domain (CC0) and Apache 2.0.<\/p>\n

The key distinguishing feature of the new hash function is its very high hash computation performance while maintaining reliability at the level of SHA-3. By default, the resulting hash size in BLAKE3 is 32 bytes (256 bits), but it can be extended to arbitrary values. In a hash generation test for a file sized at 16 KB, BLAKE3 outperforms SHA3-256 by 15 times, SHA-256 by 12 times, SHA-512 by 8 times, SHA-1 by 6 times, and BLAKE2b by 4 times. A significant advantage is maintained even when processing very large volumes of data, for example, BLAKE3 turned out is faster<\/a><\/noindex> 8 times faster than SHA-256 when calculating the hash for 1 GB of random data.<\/p>\n

\"A<\/a><\/noindex><\/center><\/p>\n

The algorithm was developed by renowned cryptography experts (Jack O'Connor<\/a><\/noindex>, Jean-Philippe Aumasson<\/a><\/noindex>, Samuel Neves<\/a><\/noindex>, Zooko Wilcox-O'Hearn<\/a><\/noindex>) and continues to evolve the algorithm BLAKE2<\/a><\/noindex> and uses the block chain tree encoding mechanism Bao<\/a><\/noindex>. Unlike BLAKE2 (BLAKE2b, BLAKE2s), BLAKE3 offers a unified algorithm for all platforms, independent of bitness and hash size. <\/p>\n

Performance improvements have been achieved by reducing the number of rounds from 10 to 7 and hashing blocks in chunks of 1 KB. According to the creators, they found compelling evidence<\/a><\/noindex>, that it is possible to manage with 7 rounds instead of 10 while maintaining the same level of reliability (for clarity, an example can be given with mixing fruits in a blender \u2014 after 7 seconds the fruits are already completely mixed and the additional 3 seconds do not affect the consistency of the mixture). However, some researchers express doubts, believing that even if currently 7 rounds are sufficient to withstand all known attacks on hashes, the additional 3 rounds may be useful in case new attacks are discovered in the future. <\/p>\n

When it comes to block division, BLAKE3 splits the stream into chunks of 1 KB and hashes each chunk independently. Based on the hashes of the chunks, a Merkle tree<\/a><\/noindex> a single large hash is formed. This specified division allows solving the problem of parallel processing of data during hash computation \u2014 for example, 4-threaded SIMD instructions can be used to simultaneously compute hashes of 4 blocks. Traditional hash functions SHA-* process data sequentially. <\/p>\n

Features of BLAKE3:<\/p>\n