Scholarlink

<p>Chaotic maps are widely used to design different data security applications due to their interesting features. The new classes of higher-order chaotic polynomial maps are constructed in this article. Firstly, applying the Li–Yorke theorem theoretically proves that these maps are chaotic. Secondly, we numerically analyzed the dynamic behavior of these maps using bifurcation, Lyapunov exponent, histogram, correlation dimension analysis, and 0–1 test. Thirdly, we take a specific map from each class and design the pseudorandom generator based on these maps. Finally, pseudorandom sequences are tested to analyze the performance of the pseudorandom generators. The results of these tests show that it has good randomness, uniformity, and high sensitivity to the initial parameters. The performance analysis shows that the pseudorandom generators generate high-quality sequences.</p>

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

Construction and application of new classes of higher order chaotic polynomial maps

  • 期刊论文

  • 发表日期：

    2025年4月24日

查看全文
  • M. G. Abbas Malik,
  • Muhammad Hayat,
  • Zia Bashir

摘要

Chaotic maps are widely used to design different data security applications due to their interesting features. The new classes of higher-order chaotic polynomial maps are constructed in this article. Firstly, applying the Li–Yorke theorem theoretically proves that these maps are chaotic. Secondly, we numerically analyzed the dynamic behavior of these maps using bifurcation, Lyapunov exponent, histogram, correlation dimension analysis, and 0–1 test. Thirdly, we take a specific map from each class and design the pseudorandom generator based on these maps. Finally, pseudorandom sequences are tested to analyze the performance of the pseudorandom generators. The results of these tests show that it has good randomness, uniformity, and high sensitivity to the initial parameters. The performance analysis shows that the pseudorandom generators generate high-quality sequences.