TECHNOLOGY FOR ANALYZING THE QUALITY OF HASH FUNCTION CHARACTERISTICS
Keywords:
hash function, collisions, function interpolation, function approximation, quality of a hash functionAbstract
The technology for analyzing the quality of a hash function is proposed. To test it, a specially developed hash function, which is a simplified analog of MD5, is used. It is shown that the traditional quality assessment of the obtained hash values based on the number of collisions has a significant drawback - high computational complexity. Therefore, the technology of quality assessment is reduced to the approximation of the analytical expression of the function, which is amenable to mathematical analysis by traditional methods applicable to polynomials. A better quality hash function is a hash function whose histogram is as close as possible to the graph of the function y=x. This will correspond to the Gaussian distribution of values. When using the proposed technology, it is necessary to develop criteria for classifying functions according to deviations from the ideal distribution of values by one or more of the following indicators: variance; mathematical expectation; arithmetic mean; geometric mean, etc.
References
1. Wang, X., & Yu, H. (2005). Collisions of SHA-1: Second-preimage and preimage attacks. Crypto 2005 Rump Session. https://www.iacr.org/archive/crypto2005/36210017/36210017.pdf.
2. Rivest, R. (1992). The MD5 Message-Digest Algorithm (RFC 1321). Internet Engineering Task Force (IETF). https://doi.org/10.17487/RFC1321.
3. Tanasiuk, Yu. V., Melnychuk, Kh. V., & Ostapov, S. E. (2017). Rozrobka i doslidzhennia kryptohrafichnykh khesh-funktsii na osnovi klitynnykh avtomativ [Development and research of cryptographic hash functions based on cellular automata]. Systemy Obrobky Informatsii [Information Processing Systems], 4(150), 122–127.
4. Brassard, G., Høyer, P., & Tapp, A. (1998). Quantum cryptanalysis of hash and claw-free functions. In C. L. Lucchesi & A. V. Moura (Eds.), LATIN'98: Theoretical informatics (pp. 163–169). Springer. https://doi.org/10.1007/BFb0054319.
5. Bellare, M., & Rogaway, P. (2005). The birthday problem. In Introduction to modern cryptography (pp. 273–274). https://web.cs.ucdavis.edu/~rogaway/classes/227/spring05/book/
main.pdf.
6. Horra, E., Beyene, A., & Yitagesu, S. (2024). Enhanced avalanche effect analysis algorithm considering both single and double key pair RSA algorithms (Preprint). Research Square. https://doi.org/10.21203/rs.3.rs-4113962/v1.
7. Telegin, V. (2023). Analysis of cryptographic strength of the modified MD5 algorithm. Universum: Tekhnicheskie Nauki [Universum: Technical Sciences], 114(9).
8. Goldberg, S. (1976). A direct attack on a birthday problem. Mathematics Magazine, 49(3), 130–132. https://doi.org/10.2307/2690270.
9. Shelevytskyi, I. V., Shutko, M. O., Shutko, V. M., & Kolganova, O. O. (2007). Splainy v tsyfrovii obrobtsi danykh i syhnaliv [Splines in digital data and signal processing].
10. Rivest, R. (1992). The MD5 Message-Digest Algorithm (RFC 1321). Internet Engineering Task Force (IETF). https://doi.org/10.17487/RFC1321.
11. Harasymchuk, O. I., & Maksymovych, V. M. (2003). Heheratory psevdownykhynykh chysel, yikh zastosuvannia, klasyfikatsiia, osnovni metody pobudovy i otsinky yakosti [Generators of pseudorandom numbers, their application, classification, main methods of construction and quality assessment]. Naukovo-tekhnichnyi zhurnal "Zakhyst informatsii" [Scientific and Technical Journal "Information Protection"], (3), 29–36.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Information technologies in economics and environmental sciences
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
