Collisions-Resistant Hash Function Based on a Logistics Map

Hash functions play a pivotal role in the field of cryptography, serving as a fundamental technique for ensuring data security. Moreover, cryptographic hash functions can be utilized to maintain the integrity of expansive datasets, including those stored on hard drives or encompassing financial data. In this context, chaotic maps, renowned for their unpredictable characteristics, are incorporated into hash functions to generate a consistent-length message digest from the original input. This study introduces a novel hash function that utilizes the logistic map with varying initial conditions and control parameters, making the most of the logistic map's chaotic range. By integrating the pseudo-random behavior within our compression function, predicting the output becomes exceedingly complex, inheriting the sensitive nature of the logistic map. The testing phase yielded highly favorable results when compared to recent research outcomes.