{"id":100856,"date":"2021-07-26T22:22:38","date_gmt":"2021-07-26T20:22:38","guid":{"rendered":"https:\/\/prohoster.info\/blog\/novosti-interneta\/vypusk-etalonnoj-realizaczii-kriptograficheskoj-hesh-funkczii-blake3-1-0"},"modified":"2021-07-26T22:22:38","modified_gmt":"2021-07-26T20:22:38","slug":"vypusk-etalonnoj-realizaczii-kriptograficheskoj-hesh-funkczii-blake3-1-0","status":"publish","type":"post","link":"https:\/\/prohoster.info\/en\/blog\/news\/vypusk-etalonnoj-realizaczii-kriptograficheskoj-hesh-funkczii-blake3-1-0","title":{"rendered":"Release of the reference implementation of the cryptographic hash function BLAKE3 1.0","gt_translate_keys":[{"key":"rendered","format":"text"}]},"content":{"rendered":"

The release of the reference implementation of the cryptographic hash function BLAKE3 1.0 has taken place, noted for its very high hashing performance while ensuring reliability at the SHA-3 level. In the hash generation test for a 16 KB file, BLAKE3 with a 256-bit key outperforms SHA3-256 by 17 times, SHA-256 by 14 times, SHA-512 by 9 times, SHA-1 by 6 times, and BLAKE2b by 5 times. A significant lead is maintained even when processing very large volumes of data; for instance, BLAKE3 was found to be 8 times faster than SHA-256 when calculating the hash for 1GB of random data. The reference implementation code for BLAKE3 is available in C and Rust under a dual license \u2014 public domain (CC0) and Apache 2.0.

\"Release<\/center> <\/p>\n

The hash function is intended for applications such as file integrity verification, message authentication, and generating data for cryptographic digital signatures. BLAKE3 is not designed for password hashing, as it is aimed at maximum hash computation speed (for passwords, it is recommended to use slower hash functions like yescrypt, bcrypt, scrypt, or Argon2). This hash function is insensitive to the size of the data being hashed and is protected against collision attacks and preimage attacks. <\/p>\n

The algorithm was developed by renowned cryptography specialists (Jack O\u2019Connor, Jean-Philippe Aumasson, Samuel Neves, Zooko Wilcox-O\u2019Hearn) and continues the development of the BLAKE2 algorithm, applying the Bao mechanism for block chain tree encoding. 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 pieces of 1 KB. According to the creators, they found a convincing mathematical proof that 7 rounds are sufficient instead of 10 while maintaining the same level of reliability (for illustration, one might consider mixing fruits in a blender \u2014 after 7 seconds the fruits are fully blended, and the additional 3 seconds won\u2019t affect the consistency of the mixture). However, some researchers express skepticism, believing that even if 7 rounds are currently adequate to withstand all known hash attacks, the additional 3 rounds could prove beneficial in the event of new attacks arising in the future. <\/p>\n

In BLAKE3, the data stream is divided into chunks of 1 KB, and each chunk is hashed independently. Based on the hashes of these chunks, a single large hash is created using a Merkle tree. This division allows for parallel processing of data when calculating the hash \u2014 for instance, it enables the use of 4-threaded SIMD instructions to simultaneously compute the hashes of 4 blocks. Traditional SHA-* hash functions process data sequentially. <\/p>\n

Features of BLAKE3: <\/p>\n