Key points are not available for this paper at this time.
Abstract The cryptographic hash function stands as a cornerstone among the trio of essential cryptographic algorithms that are ubiquitously utilized across blockchain technology, digital signature applications, cloud storage solutions, and numerous other domains. Currently, a series of MD4-inspired hash functions, including RIPEMD, RIPEMD128, MD5, and SHA-1, have been critically evaluated and deemed insufficient in terms of security10–13, thereby emphasizing the paramount importance of heightened vigilance towards safeguarding the integrity of cryptographic hash functions. Notably, the preponderance of prevalent hash functions relies heavily on inefficient serial architectures, posing limitations in terms of performance and scalability. To address these shortcomings, this paper introduces a groundbreaking cryptographic hash function, predicated on a parallel confusion and multi-compression structure (PCMCH). This innovative methodology innovatively fills the input data through a parallel confusion compression mechanism, concurrently executing multi-faceted confusion compression on each message block. Furthermore, it expedites message diffusion by meticulously tuning adaptable permutation parameters, enhancing both the speed and efficacy of the process. The exhaustive experimental analysis conducted underscores the exceptional security characteristics of the proposed hash function, including irregularity, the avalanche effect, high information entropy, and robust collision resistance. Moreover, its performance surpasses that of existing parallel hash functions, marking it as a promising contender that offers superior efficiency and security, thereby presenting a viable alternative for applications requiring heightened cryptographic safeguards.
Yang et al. (Thu,) studied this question.