Salayev Alisher Kuralbayevich
dept. Information security
Urgench Branch of Tashkent University of Information Technologies named
after Muhammad al-Khwarizmi
Urgench,
Uzbekistan
salayevalisher@gmail.com
Aminboyev Javohir Alisher o’g’li dept. Information security
Urgench Branch of Tashkent University of Information Technologies named after Muhammad al-Khwarizmi
Urgench, Uzbekistan
aminboyevjavohir2323@gmail.com
Khaitbayev Azizbek Pirnazarovich
dept. Information security
Urgench Branch of Tashkent University of Information Technologies named after Muhammad al-Khwarizmi
Urgench, Uzbekistan
khaitboyev.a@gmail.com
Introduction: Modern hash functions like SHA-256 and BLAKE2 are meticulously designed to be highly collision-resistant, making it computationally infeasible to find collisions, thereby safeguarding the integrity of processed data. However, ensuring their effectiveness necessitates employing rigorous analysis methods to assess their security against potential attacks. This thesis explores various approaches used to analyze the collision tolerance of contemporary hash functions, highlighting their strengths and limitations.
Keywords: Hash function, collision resistance, cryptanalysis, cryptographic algorithms, differential cryptanalysis, empirical analysis, distribution analysis, collision finding experiments, correlation analysis, statistical modeling, randomness testing, SHA-256, BLAKE2.
Introduction
Modern hash functions like SHA-256 and BLAKE2 are meticulously designed to be highly collision-resistant, making it computationally infeasible to find collisions, thereby safeguarding the integrity of processed data. However, ensuring their effectiveness necessitates employing rigorous analysis methods to assess their security against potential attacks. This thesis explores various approaches used to analyze the collision tolerance of contemporary hash functions, highlighting their strengths and limitations.
