Hyperchaotic hashing: a chaotic hash function based on 2D linear cross-coupled map with parallel feedback structure

Abstract

Abstract Chaotic systems have been widely employed in constructing hash functions because of their nonlinear characteristics. Nonetheless, some chaotic hash functions are intricately designed, significantly increasing their computational overhead, and some can only generate a single hash value of fixed length, thus lacking flexibility. To overcome the above problems, a novel hash function based on a 2D linear cross-coupled hyperchaotic map (HF-2DLCHM) is introduced and has a parallel feedback structure. Compared to the typical 1D chaotic maps, 2DLCHM has superior dynamic complexity, allowing HF-2DLCHM to resist phase space reconstruction attacks. A parallelizable structure is introduced, enhancing computational efficiency through concurrent processing of operational units. Simultaneously, the feedback mechanism is incorporated to augment the diffusion effect, ensuring better mixing and distribution of information. Moreover, by controlling the size of the input parameter T, the scheme can generate a hash value of $$32 \times T$$ bits. The experimental results illustrate that this scheme exhibits distribution, confusion, diffusion and collision resistance characteristics approaching their nearly ideal benchmarks while maintaining an acceptable speed. Therefore, this scheme holds substantial practical potential in the domain of data security and privacy protection.

Keywords

• Chaotic map
• Hash function
• Cryptographic systems
• Information security