<p>In image encryption, the effectiveness of chaotic maps significantly affects the effect of image encryption technology. However, existing chaotic maps have an issue of uneven value distribution when generating chaotic sequences, which could pose a threat to information security. To address this issue, a new two-dimensional Cubic-Tent map (2D-CTM) has been developed based on the Cubic and Tent maps. A series of comparative experiments on the 2D-CTM effectively validate its excellent chaotic properties. A novel image encryption algorithm utilizing 2D-CTM (CTM-IEA) is developed to encrypt images. This algorithm includes bit-level random scrambling, bit-level flipping, and improved 3D Hilbert diffusion process. First, the binary elements corresponding to different pixels in the plaintext image are randomly scrambled. Subsequently, the scrambled binary elements are flipped using a chaotic matrix, thoroughly obfuscating the binary information of the plaintext image and successfully hiding the plaintext information. Finally, the improved 3D Hilbert diffusion is applied to the image, eliminating pixel correlation in the original image and enhancing its security. Additionally, bit-level scrambling and diffusion are carried out in three rounds, which bolster the image’s defense against differential attacks. Compared to traditional encryption methods, this approach offers improved security by ensuring more uniform chaotic sequences and integrating a multi-round, bit-level encryption process. The security analysis shows that the key space reaches <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10489_2025_6414_Article_IEq1.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="27" /> </InlineMediaObject> <EquationSource Format="TEX">\({2}^{471}\)</EquationSource> <EquationSource Format="MATHML"><math> <msup> <mrow> <mn>2</mn> </mrow> <mn>471</mn> </msup> </math></EquationSource> </InlineEquation>, with correlation coefficients of 0.0006, 0.00004, and <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="10489_2025_6414_Article_IEq2.gif" Format="GIF" Height="13" Rendition="HTML" Resolution="72" Type="Linedraw" Width="19" /> </InlineMediaObject> <EquationSource Format="TEX">\(-\)</EquationSource> <EquationSource Format="MATHML"><math> <mo>-</mo> </math></EquationSource> </InlineEquation> 0.0010, and an information entropy of 7.9998. The NPCR is 99.6084%, and the UACI is 33.4620%, which prove the effectiveness and reliability of the algorithm.</p>

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

New 2D hyperchaotic Cubic-Tent map and improved 3D Hilbert diffusion for image encryption

  • Xin-li Xu,
  • Xin-guang Song,
  • Si-hang Liu,
  • Nan-run Zhou,
  • Meng-meng Wang

摘要

In image encryption, the effectiveness of chaotic maps significantly affects the effect of image encryption technology. However, existing chaotic maps have an issue of uneven value distribution when generating chaotic sequences, which could pose a threat to information security. To address this issue, a new two-dimensional Cubic-Tent map (2D-CTM) has been developed based on the Cubic and Tent maps. A series of comparative experiments on the 2D-CTM effectively validate its excellent chaotic properties. A novel image encryption algorithm utilizing 2D-CTM (CTM-IEA) is developed to encrypt images. This algorithm includes bit-level random scrambling, bit-level flipping, and improved 3D Hilbert diffusion process. First, the binary elements corresponding to different pixels in the plaintext image are randomly scrambled. Subsequently, the scrambled binary elements are flipped using a chaotic matrix, thoroughly obfuscating the binary information of the plaintext image and successfully hiding the plaintext information. Finally, the improved 3D Hilbert diffusion is applied to the image, eliminating pixel correlation in the original image and enhancing its security. Additionally, bit-level scrambling and diffusion are carried out in three rounds, which bolster the image’s defense against differential attacks. Compared to traditional encryption methods, this approach offers improved security by ensuring more uniform chaotic sequences and integrating a multi-round, bit-level encryption process. The security analysis shows that the key space reaches \({2}^{471}\) 2 471 , with correlation coefficients of 0.0006, 0.00004, and \(-\) - 0.0010, and an information entropy of 7.9998. The NPCR is 99.6084%, and the UACI is 33.4620%, which prove the effectiveness and reliability of the algorithm.