A new hashing algorithm - HAS01: development, cryptographic properties and inclusion in graduate studies
Kapalova N. Dyusenbayev D. Sakan K.
2022World Institute for Engineering and Technology Education
Global Journal of Engineering Education
2022#24Issue 2155 - 164 pp.
A new hashing algorithm - HAS01 is considered in this article. This algorithm is part of the hash function of the SHA-3 family, and was developed on the basis of the cryptographic sponge construction. The difference between the proposed scheme and the classical one is that at the absorption stage, the function f, which is part of the function F, is called more than once. Besides, when generating a hash value, each element of the sequence is determined by copying a certain column of the state matrix, i.e. the current state of the hash generated at the moment. The hashing algorithm HAS01 converts a plaintext M of arbitrary length, which is iteratively processed in 192-bit blocks, into a hash value of 256 or 512 bits. The maximum throughput, the simplicity of software and hardware implementation, and the required level of resistance to collisions were the main goals of the scientific work. To assess the reliability and conduct cryptographic analysis, HAS01 was software implemented in the C++ and Python programming languages. During the analysis, the avalanche effect was investigated, and the possibility of using the chaining technique and the differential cryptanalysis method to find collisions was considered. It is shown that the considered methods for finding collisions are not effective. Overall, HAS01 is efficient, simple to use and is recommended for inclusion in graduate studies.
chaining method , collision , cryptographic sponge construction , differential cryptanalysis , Hash function
Text of the article Перейти на текст статьи
Institute of Information and Computational Technologies, Almaty, Kazakhstan
Al-Farabi Kazakh National University, Almaty, Kazakhstan
Institute of Information and Computational Technologies
Al-Farabi Kazakh National University
10 лет помогаем публиковать статьи Международный издатель
Книга Публикация научной статьи Волощук 2026 Book Publication of a scientific article 2026