<p>This paper presents a construction of a secure image encryption scheme with graph theory, Galois field, and substitution-permutation network (SPN) for enhanced multimedia data security. First of all, the authors begin by constructing a complete graph with 8 vertices to understand the structure of the graph <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41598_2025_21542_Article_IEq1.gif" Format="GIF" Height="17" Rendition="HTML" Resolution="72" Type="Linedraw" Width="20" /> </InlineMediaObject> <EquationSource Format="TEX">\(G,\)</EquationSource> </InlineEquation> and then draw the adjacency matrix <InlineEquation ID="IEq2"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41598_2025_21542_Article_IEq2.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="17" /> </InlineMediaObject> <EquationSource Format="TEX">\(A\)</EquationSource> </InlineEquation> of the graph <InlineEquation ID="IEq3"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41598_2025_21542_Article_IEq3.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="18" /> </InlineMediaObject> <EquationSource Format="TEX">\(G\)</EquationSource> </InlineEquation>. An elementary finite field <InlineEquation ID="IEq4"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41598_2025_21542_Article_IEq4.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="55" /> </InlineMediaObject> <EquationSource Format="TEX">\(GF({2}^{8})\)</EquationSource> </InlineEquation> by the use of the irreducible polynomial and give representation of the elements of <InlineEquation ID="IEq5"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41598_2025_21542_Article_IEq4.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="55" /> </InlineMediaObject> <EquationSource Format="TEX">\(GF({2}^{8})\)</EquationSource> </InlineEquation> in a form of a binary. An affine mapping is defined using an adjacency matrix A whose entries lie in <InlineEquation ID="IEq6"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41598_2025_21542_Article_IEq4.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="55" /> </InlineMediaObject> <EquationSource Format="TEX">\(GF({2}^{8})\)</EquationSource> </InlineEquation>; each entry is transformed by computing its multiplicative inverse in <InlineEquation ID="IEq7"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41598_2025_21542_Article_IEq4.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="55" /> </InlineMediaObject> <EquationSource Format="TEX">\(GF({2}^{8})\)</EquationSource> </InlineEquation> and then augmented with a parameter from <InlineEquation ID="IEq8"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41598_2025_21542_Article_IEq4.gif" Format="GIF" Height="20" Rendition="HTML" Resolution="72" Type="Linedraw" Width="55" /> </InlineMediaObject> <EquationSource Format="TEX">\(GF({2}^{8})\)</EquationSource> </InlineEquation>. This mapping is used to construct <InlineEquation ID="IEq9"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41598_2025_21542_Article_IEq9.gif" Format="GIF" Height="14" Rendition="HTML" Resolution="72" Type="Linedraw" Width="39" /> </InlineMediaObject> <EquationSource Format="TEX">\(8\times 8\)</EquationSource> </InlineEquation> S-boxes, which together with other components constitute the nonlinear portion of the SPN structure. This encryption method is applied to RGB images with three transformations proposed as below. Substitution in replacement of all the pixel’s R, G, and B channel values works with the help of S-box, which is <InlineEquation ID="IEq10"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41598_2025_21542_Article_IEq10.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="18" /> </InlineMediaObject> <EquationSource Format="TEX">\({S}_{1}\)</EquationSource> </InlineEquation>. Permutation is done with the help of the second S-box (<InlineEquation ID="IEq11"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41598_2025_21542_Article_IEq11.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="18" /> </InlineMediaObject> <EquationSource Format="TEX">\({S}_{2}\)</EquationSource> </InlineEquation>) the function of permutation is to shift the position of pixels in order to support both diffusion and confusion. Lastly, the third S-box <InlineEquation ID="IEq12"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="41598_2025_21542_Article_IEq12.gif" Format="GIF" Height="16" Rendition="HTML" Resolution="72" Type="Linedraw" Width="18" /> </InlineMediaObject> <EquationSource Format="TEX">\({S}_{3}\)</EquationSource> </InlineEquation> is utilized for the purpose of the XOR operation on the permuted pixel values, adding one more layer of confusion to the transformation. Finally, red, green, and blue channels are used to generate an encrypted RGB image. Test results and evaluations of the proposed scheme reveal that the encrypted images achieve entropy values in the range of 7.9971–7.9994, which are very close to the ideal value of 8, and exhibit minimal pixel correlation (close to zero). Moreover, the images are resistant to differential image cryptanalysis and linear image cryptanalysis. This demonstrates that the proposed approach provides strong randomness and ensures the secure protection of multimedia information, which is of critical importance in today’s applications.</p>

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

RGB image encryption using SPN with a novel block cipher over simple graph adjacency matrices and Galois fields

  • Muhammad Sajjad,
  • Nawaf A. Alqwaifly

摘要

This paper presents a construction of a secure image encryption scheme with graph theory, Galois field, and substitution-permutation network (SPN) for enhanced multimedia data security. First of all, the authors begin by constructing a complete graph with 8 vertices to understand the structure of the graph \(G,\) and then draw the adjacency matrix \(A\) of the graph \(G\) . An elementary finite field \(GF({2}^{8})\) by the use of the irreducible polynomial and give representation of the elements of \(GF({2}^{8})\) in a form of a binary. An affine mapping is defined using an adjacency matrix A whose entries lie in \(GF({2}^{8})\) ; each entry is transformed by computing its multiplicative inverse in \(GF({2}^{8})\) and then augmented with a parameter from \(GF({2}^{8})\) . This mapping is used to construct \(8\times 8\) S-boxes, which together with other components constitute the nonlinear portion of the SPN structure. This encryption method is applied to RGB images with three transformations proposed as below. Substitution in replacement of all the pixel’s R, G, and B channel values works with the help of S-box, which is \({S}_{1}\) . Permutation is done with the help of the second S-box ( \({S}_{2}\) ) the function of permutation is to shift the position of pixels in order to support both diffusion and confusion. Lastly, the third S-box \({S}_{3}\) is utilized for the purpose of the XOR operation on the permuted pixel values, adding one more layer of confusion to the transformation. Finally, red, green, and blue channels are used to generate an encrypted RGB image. Test results and evaluations of the proposed scheme reveal that the encrypted images achieve entropy values in the range of 7.9971–7.9994, which are very close to the ideal value of 8, and exhibit minimal pixel correlation (close to zero). Moreover, the images are resistant to differential image cryptanalysis and linear image cryptanalysis. This demonstrates that the proposed approach provides strong randomness and ensures the secure protection of multimedia information, which is of critical importance in today’s applications.