Differential Analysis of a Cryptographic Hashing Algorithm HBC-256
Algazy K. Sakan K. Kapalova N. Nyssanbayeva S. Dyusenbayev D.
October 2022MDPI
Applied Sciences (Switzerland)
2022#12Issue 19
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.
algorithm , collision , cryptanalysis , cryptography , differential cryptanalysis , hash function
Text of the article Перейти на текст статьи
Institute of Information and Computational Technologies, Almaty, 050010, Kazakhstan
Faculty of Information Technology, Al-Farabi Kazakh National University, Almaty, 050010, Kazakhstan
Institute of Information and Computational Technologies
Faculty of Information Technology
10 лет помогаем публиковать статьи Международный издатель
Книга Публикация научной статьи Волощук 2026 Book Publication of a scientific article 2026