Article · Applied Sciences · October 10, 2022
Differential Analysis of a Cryptographic Hashing Algorithm HBC-256
Kunbolat T. Algazy, Kairat Sakan, Nursulu A. Kapalova, Saule Nyssanbayeva, Dilmukhanbet Dyusenbayev
Abstract
The article observes the new hashing algorithm HBC-256. The HBC-256 algorithm is based on the block cipher of the compression function CF (Compression Function) and produces a 256-bits hash value. Like any new cryptographic structure, the HBC-256 algorithm requires careful research process in order to confirm its cryptographic properties, namely: pre-image resistance and resistance to collisions of the first and second order. As a result of the research, for the HBC-256 hashing algorithm differential properties of nonlinear elements (S-boxes) and various options for constructing round characteristics are considered. A hypothesis has been advanced about the existence of paired differences, which will make it possible to construct round characteristics for hashing and for the function of round keys generating. It is shown that even for the most optimal way of constructing chains of differences, the probability of finding correct pairs of texts is less than the probability of a complete enumeration of one 128-bit block of input data, which makes the method of differential cryptanalysis unsuitable for finding collisions.
More by Kairat Sakan
- Design of a New Lightweight Hash Function FLUX-128 and Experimental Evaluation of Its Diffusion and Statistical PropertiesComputers · 2026
- CONSTRUCTION OF LATTICE-BASED VECTOR COMMITMENTS FOR VERKLE STRUCTURESThe Proceeding Bulletin MILF · 2026
- VERKLE АҒАШТАРЫНА АРНАЛҒАН ТОРЛЫҚ ВЕКТОРЛЫҚ МІНДЕТТЕМЕЛЕРNEWS OF THE NATIONAL ACADEMY OF SCIENCES OF THE REPUBLIC OF KAZAKHSTAN · 2026
- VERKLE АҒАШЫНА НЕГІЗДЕЛГЕН ЦИФРЛЫҚ ҚОЛТАҢБАНЫҢ ТИІМДІЛІГІН БАҒАЛАУ ЖӘНЕ САЛЫСТЫРМАЛЫ ТАЛДАУ ЖҮРГІЗУВестник Академии гражданской авиации · 2026
