Scholarlink

<p>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 <i>T</i>, the scheme can generate a hash value of <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41598_2025_88764_Article_IEq1.gif" Format="GIF" Height="15" Rendition="HTML" Resolution="72" Type="Linedraw" Width="51" /> </InlineMediaObject> <EquationSource Format="TEX">\(32 \times T\)</EquationSource> </InlineEquation> 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.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

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

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年2月14日

查看全文
  • Hao Xing,
  • Rudong Min,
  • Shouliang Li,
  • Zhen Yang,
  • Yi Yang

摘要

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.