Development and analysis of the new hashing algorithm based on block cipher

Abstract

This paper proposes the new hash algorithm HBC-256 (Hash based on Block Cipher) based on the symmetric block cipher of the CF (Compression Function). The algorithm is based on the wipe-pipe construct, a modified version of the Merkle-Damgard construct. To transform the block cipher CF into a one-way compression function, the Davis-Meyer scheme is used, which, according to the results of research, is recognized as a strong and secure scheme for constructing hash functions based on block ciphers. The symmetric CF block cipher algorithm used consists of three transformations (Stage-1, Stage-2, and Stage-3), which include modulo two addition, circular shift, and substitution box (four-bit S-boxes). The four substitution boxes are selected from the “golden” set of S-boxes, which have ideal cryptographic properties. The HBC-256 scheme is designed to strike an effective balance between computational speed and protection against a preimage attack. The CF algorithm uses an AES-like primitive as an internal transformation. The hash image was tested for randomness using the NIST (National Institute of Standards and Technology) statistical test suite, the results were examined for the presence of an avalanche effect in the CF encryption algorithm and the HBC-256 hash algorithm itself. The resistance of HBC-256 to near collisions has been practically tested. Since the classical block cipher key expansion algorithms slow down the hash function, the proposed algorithm is adapted for hardware and software implementation by applying parallel computing. A hashing algorithm was developed that has a sufficiently large freedom to select the sizes of the input blocks and the output hash digest. This will make it possible to create an almost universal hashing algorithm and use it in any cryptographic protocols and electronic digital signature algorithms

Evaluation of the strength and performance of a new hashing algorithm based on a block cipher

“…The hash-based on block cipher (HBC-256) hashing algorithm is new and belongs to the class of new hash functions. A detailed description of the algorithm and some approaches to its analysis are presented in [21]. The HBC-256 hash function is built on the Merkle-Damgard construction.…”

“…After all, three blocks have been processed, they are shuffled and the first 256 bits form the desired hash value. If the length of the original message is less than 384 bits, then the message is padded as described in [21]. For Stage-1 and Stage-3 operations, data is represented as a 4×4 matrix, where each element of the matrix is one byte.…”

Development of a New Post-Quantum Digital Signature Algorithm: Syrga-1

“…For the Syrga-1 algorithm, we consider the variant where l = 4, making the hash value size 256 bits. A full mathematical description of the HAS01 hashing algorithm, as well as its security and efficiency analysis, can be found in references [23,24], where it is demonstrated to meet all the properties and requirements expected of hash functions, showing excellent performance in all aspects.…”

Illuminating the Path of Post-Quantum Cryptographic Protocols: A Survey of some Recent Literatures

“…The development of this hashing algorithm offers significant flexibility in selecting input block sizes and output hash digests. This adaptability enables the creation of a versatile hashing algorithm applicable across various cryptographic protocols and electronic digital signature schemes [25].…”