Loading [MathJax]/jax/output/SVG/jax.js
Research article Special Issues

Designing pair of nonlinear components of a block cipher over quaternion integers

  • Received: 19 May 2023 Revised: 23 June 2023 Accepted: 23 June 2023 Published: 03 July 2023
  • MSC : 68P25, 68U15

  • In the field of cryptography, block ciphers are widely used to provide confidentiality and integrity of data. One of the key components of a block cipher is its nonlinear substitution function. In this paper, we propose a new design methodology for the nonlinear substitution function of a block cipher, based on the use of Quaternion integers (QI). Quaternions are an extension of complex numbers that allow for more complex arithmetic operations, which can enhance the security of the cipher. We demonstrate the effectiveness of our proposed design by implementing it in a block cipher and conducting extensive security analysis. Quaternion integers give pair of substitution boxes (S-boxes) after fixing parameters but other structures give only one S-box after fixing parameters. Our results show that the proposed design provides superior security compared to existing designs, two making on a promising approach for future cryptographic applications.

    Citation: Muhammad Sajjad, Tariq Shah, Huda Alsaud, Maha Alammari. Designing pair of nonlinear components of a block cipher over quaternion integers[J]. AIMS Mathematics, 2023, 8(9): 21089-21105. doi: 10.3934/math.20231074

    Related Papers:

    [1] Usman Babar, Haidar Ali, Shahid Hussain Arshad, Umber Sheikh . Multiplicative topological properties of graphs derived from honeycomb structure. AIMS Mathematics, 2020, 5(2): 1562-1587. doi: 10.3934/math.2020107
    [2] Ali N. A. Koam, Ali Ahmad, Azeem Haider, Moin A. Ansari . Computation of eccentric topological indices of zero-divisor graphs based on their edges. AIMS Mathematics, 2022, 7(7): 11509-11518. doi: 10.3934/math.2022641
    [3] R. Abu-Gdairi, A. A. El-Atik, M. K. El-Bably . Topological visualization and graph analysis of rough sets via neighborhoods: A medical application using human heart data. AIMS Mathematics, 2023, 8(11): 26945-26967. doi: 10.3934/math.20231379
    [4] Sadik Delen, Ismail Naci Cangul . Effect of edge and vertex addition on Albertson and Bell indices. AIMS Mathematics, 2021, 6(1): 925-937. doi: 10.3934/math.2021055
    [5] Sumiya Nasir, Nadeem ul Hassan Awan, Fozia Bashir Farooq, Saima Parveen . Topological indices of novel drugs used in blood cancer treatment and its QSPR modeling. AIMS Mathematics, 2022, 7(7): 11829-11850. doi: 10.3934/math.2022660
    [6] Wei Gao, Zahid Iqbal, Shehnaz Akhter, Muhammad Ishaq, Adnan Aslam . On irregularity descriptors of derived graphs. AIMS Mathematics, 2020, 5(5): 4085-4107. doi: 10.3934/math.2020262
    [7] Chenxu Yang, Meng Ji, Kinkar Chandra Das, Yaping Mao . Extreme graphs on the Sombor indices. AIMS Mathematics, 2022, 7(10): 19126-19146. doi: 10.3934/math.20221050
    [8] Edil D. Molina, José M. Rodríguez-García, José M. Sigarreta, Sergio J. Torralbas Fitz . On the Gutman-Milovanović index and chemical applications. AIMS Mathematics, 2025, 10(2): 1998-2020. doi: 10.3934/math.2025094
    [9] Fawaz E. Alsaadi, Faisal Ali, Imran Khalid, Masood Ur Rehman, Muhammad Salman, Madini Obad Alassafi, Jinde Cao . Quantifying some distance topological properties of the non-zero component graph. AIMS Mathematics, 2021, 6(4): 3512-3524. doi: 10.3934/math.2021209
    [10] Zhenhua Su, Zikai Tang . Extremal unicyclic and bicyclic graphs of the Euler Sombor index. AIMS Mathematics, 2025, 10(3): 6338-6354. doi: 10.3934/math.2025289
  • In the field of cryptography, block ciphers are widely used to provide confidentiality and integrity of data. One of the key components of a block cipher is its nonlinear substitution function. In this paper, we propose a new design methodology for the nonlinear substitution function of a block cipher, based on the use of Quaternion integers (QI). Quaternions are an extension of complex numbers that allow for more complex arithmetic operations, which can enhance the security of the cipher. We demonstrate the effectiveness of our proposed design by implementing it in a block cipher and conducting extensive security analysis. Quaternion integers give pair of substitution boxes (S-boxes) after fixing parameters but other structures give only one S-box after fixing parameters. Our results show that the proposed design provides superior security compared to existing designs, two making on a promising approach for future cryptographic applications.



    Since molecules and molecular compounds are used to generate molecular graphs. Any graph that simulates some molecular structure can use a topological index as a mathematical formula [1]. Topological indices play a significant role in chemistry, pharmacology, etc., [2]. A molecular graph, whose vertices and edges are represented by atoms and chemical bonds, respectively, illustrates the constructional outcome of a chemical compound in graph theory form. Cheminformatics, a field shared by information science, chemistry and mathematics, has recently gained notoriety. This new topic discusses the connection between QSAR and QSPR, which is used to investigate (with a given level of accuracy) the theoretical and biological activities of specific chemical compounds [3]. For quantitative structure-activity relationships (QSARs) and quantitative structure-property relationships (QSPRs), in which the physicochemical characteristics of molecules are correlated with their chemical structure, a topological index (TI) is a real number associated with chemical structures via their hydrogen-depleted graph [4,5,6].

    Chemical graph theory is a newly developed area of mathematical chemistry that combines graph theory with chemistry. The main objective of chemical graph theory is to acknowledge the structural effects of a molecular graph [7]. The molecules and molecular compounds aid in the construction of a molecular graph. Topological descriptors, which are typically graph invariants, are numerical characteristics of a graph that describe its topology [8]. The certain physiochemical characteristics of some chemical compounds, such as their boiling point, strain energy, and stability are correlated by degree-based topological indices [9].

    Chemical graph theory has many applications in many areas of life, including computer science, materials science, drug design, chemistry, biological networks, and electrical networks. For this reason, academics are currently very interested in this theory [10,11]. The numerical values attached to a simple, finite graph that represent its structure are called topological indices [12]. The multiplicative Zagreb indices for mathematical features, connection indices and applications see in [13,14,15,16,17,18,19,20]. In this study, a novel method for computing the topological indices of two different chemical networks is presented. The mathematical properties of molecular structure descriptors, particularly those that depend on graph degrees, have been examined in our research. We derive neighborhood multiplicative topological indices and concise mathematical analysis for product of graphs (L) and tetrahedral diamond lattices (Ω). The fifth multiplicative Zagreb index, the general fifth-multiplicative Zagreb index, the fifth-multiplicative hyper-Zagreb index, the fifth-multiplicative product connectivity index, the fifth-multiplicative sum connectivity index, the fifth-multiplicative geometric-arithmetic index, the fifth-multiplicative harmonic index, and the fifth-multiplicative redefined Zagreb index are the topological indices that are taken into consideration. In this paper, we consider G=(V,E) to be a simple, connected and finite graph contains vertices (atoms) atoms and edges (chemical bonds linking these atoms), for notation referee to [21].

    In 2017, the new neighborhood degree-based multiplicative topological indices were introduced by V. R. Kulli in [22]. Let §1  and §2  denote the fifth neighborhood multiplicative M-Zagreb index defined as:

    §1(G)=U1U2E(G)(L(U1)+L(U2))and§2(G)=U1U2E(G)L(U1)L(U2). (2.1)

    Let §3 and §5  denote the general fifth multiplicative Zagreb index that are defined as:

    §3(G)=U1U2E(G)[L(U1)+L(U2)]αand§5(G)=U1U2E(G)[L(U1)L(U2)]α, (2.2)

    where α is a real number.

    The fifth multiplicative hyper-Zagreb index is denoted by §4  and §6 defined as:

    §4(G)=U1U2E(G)[L(U1)+L(U2)]2and§6(G)=U1U2E(G)[L(U1)L(U2)]2. (2.3)

    The fifth multiplicative product connectivity index §8  is defined as:

    §8(G)=U1U2E(G)1L(U1)L(U2). (2.4)

    The fifth multiplicative sum-connectivity index of a graph G is defined as:

    §9(G)=U1U2E(G)1L(U1)+L(U2) (2.5)

    The fifth multiplicative geometric-arithmetic index §10  of a graph G and it is defined as:

    §10(G)=U1U2E(G)2L(U1)L(U2)L(U1)+L(U2). (2.6)

    Inspired by Kulli, Sarkar et al. [23] introduced the fifth multiplicative product connectivity index of first kind §7, the fifth multiplicative harmonic index §11 and the fifth multiplicative redefined Zagreb index §12, respectively defined as:

    §7(G)=U1U2E(G)L(U1)L(U2), (2.7)
    §11(G)=U1U2E(G)2L(U1)+L(U2), (2.8)
    §12(G)=U1U2E(G)L(U1)L(U2)[(L(U1)+L(U2]. (2.9)

    For any two graphs L and M, the tensor product of the graphs L and M is interpreted as LM. This product is also known as categorical product of graphs defined in [24,25]. The vertex set of LM is denoted by V (L)×V (M). For any integers p and q, the tensor product Lp and Lq is described by LpLq. This graph contains a.b number of vertices with vertex set

    {(t1,t2):1t1q, 1t2p},

    and edge between (t1, t2) and (t3, t4)exists if and only if:

    |t1t3||t2t4|=1.

    The graph LpLq is known as a L with vertex cardinality pq. The metric dimension of the categorial product of graphs is determined in [26] and edge irregular reflexive labeling of categorical product of two paths is determined in [27]. This shows the importance of this product in different areas. Ahmad [28] determined the upper bounds of irregularity measures of categorical product of two connected graphs. The edge partition of graph LpLq based on the degree of end vertices is given in Table 1. This edge partition is also given in [29]. For more understanding we depicted L9L10 in Figure 1.

    Table 1.  The edge partitions of LpLq.
    L(U1), L(U2) Frequency
    (1, 4) 4
    (2, 2) 4
    (2, 4) 4(p+q-6)
    (4, 4) 2(p-3)(q-3)

     | Show Table
    DownLoad: CSV
    Figure 1.  The graph of L9L10.

    Theorem 3.1. Let G be a tensor product of two paths. Then the fifth neighborhood multiplicative M-Zagreb indices for G are:

    §1(G)=122880(p2q+pq23p23q212pq+27p+27q54),
    §2(G)=262144(p2q+pq23p23q212pq+27p+27q54).

    Proof. From the definitions of §1(G), §2(G)  and Table 1, we have

    §1(G)=|P(1,4)|(1+4)×|P(2,2)|(2+2)×|P(2,4)|(2+4)×|P(4,4)|(4+4)=4(5)×4(4)×4(p+q6)(6)×2(p3)(q3)(8)=20×16×24(p+q6)×16(p3)(q3)=122880(p2q+pq23p23q212pq+27p+27q54).

    Similarly,

    §2(G)=|P(1,4)|(4)×|P(2,2)|(4)×|P(2,4)|(8)×|P(4,4)|(16)=4(4)×4(4)×4(p+q6)(8)×2(p3)(q3)(16)=262144(p+q6)(pq3p3q+9)=262144(p2q+pq23p23q212pq+27p+27q54).

    The graphical representation of the Theorem 3.1 is given in Figure 2(a), (b).

    Figure 2.  The graphical representations of Theorems 3.1–3.4 with p and q.

    Theorem 3.2. Let G be a tensor product of two paths. Then the general fifth multiplicative Zagreb indices of G are:

    §3(G)=128(960)α(p2q+pq23p23q212pq+27p+27q54),
    §5(G)=128(2048)α(p2q+pq23p23q212pq+27p+27q54).

    Proof. From the definitions of §3(G) and Table 1, we get

    §3(G)=|P(1,4)|(1+4)α×|P(2,2)|(2+2)α×|P(2,4)|(2+4)α×|P(4,4)|(4+4)α=4(5)α×4(4)α×4(p+q6)(6)α×2(p3)(q3)(8)α=128(960)α(p2q+pq23p23q212pq+27p+27q54).

    From the definitions of §5(G) and Table 1, we obtain

    §5(G)=|P(1,4)|(1 × 4)α×|P(2,2)|(2×2)α×|P(2,4)|(2×4)α×|P(4,4)|(4×4)α=4(4)α×4(4)α×4(p+q6)(8)α×2(p3)(q3)(16)α=128(2048)α(p2q+pq23p23q212pq+27p+27q54).

    Theorem 3.3. Let G be a tensor product of two paths. Then the fifth multiplicative hyper-Zagreb indices for G are:

    §4(G)=117964800(p2q+pq23p23q212pq+27p+27q54),
    §6(G)=536870912(p2q+pq23p23q212pq+27p+27q54).

    Proof. From the definitions of §4(G), §6(G) and Table 1, we obtain

    §4(G)=|P(1,4)|(1+4)2×|P(2,2)|(2+2)2×|P(2,4)|(2+4)2×|P(4,4)|(4+4)2=4(5)2×4(4)2×4(p+q6)(6)2×2(p3)(q3)(8)2=117964800(p2q+pq23p23q212pq+27p+27q54),
    §6(G)=|P(1,4)|(1 × 4)2×|P(2,2)|(22)2×|P(2,4)|(24)2×|P(4,4)|(44)2=4(4)2×4(4)2×4(p+q6)(8)2×2(p3)(q3)(16)2=536870912(p2q+pq23p23q212pq+27p+27q54).

    The graphical representations of Theorems 3.2 and 3.3 are shown in Figure 2(c)(f) with p and q, respectively.

    Theorem 3.4. The fifth multiplicative product connectivity index §8 for tensor product of two path G is:

    §8(G)=140962(p2q+pq23p23q212pq+27p+27q54).

    Proof. From the formulation of §8(G) and Table 1, it is easy to calculate that

    §8(G)=1|P(1,4)|(4)×1|P(2,2)|(4)×1|P(2,4)|(8)×1|P(4,4)|(16)=14(4)×14(4)×14(p+q6)(8)×12(p3)(q3)(16)=140962(p2q+pq23p23q212pq+27p+27q54).

    The graphical representation of fifth multiplicative product connectivity index §8 is shown in Figure 2(g) with p and q.

    Theorem 3.5. Let G be a tensor product of two paths. Then the fifth multiplicative sum-connectivity index of a graph G is:

    §9(G)=1102415(p2q+pq23p23q212pq+27p+27q54).

    Proof. From the formulation of §9(G) and Table 1, we get

    §9=1|P(1,4)|(5)×1|P(2,2)|(4)×1|P(2,4)|6×1|P(4,4)|8=14(5)×14(4)×14(p+q6)6×12(p3)(q3)8=1102415×(p2q+pq23p23q212pq+27p+27q54).

    Theorem 3.6. Let G be a tensor product of two paths. Then the fifth multiplicative geometric-arithmetic index §10 of a graph G is:

    §10(G)=64215.

    Proof. By the definition of §10(G) and using the values of Table 1, we have

    §10=2|P(1,4)|(4)|P(1,4)|(5)×2|P(2,2)|(4)|P(2,2)|(4)×2|P(2,4)|(8)|P(2,4)|6×2|P(4,4)|(16)|P(4,4)|(8)=24445×24444×24(p+q6)84(p+q6)6×22(p3)(q3)162(p3)(q3)8=64215.

    The graphical representations of fifth multiplicative sum-connectivity index §9 and fifth multiplicative geometric-arithmetic index §10 is shown in Figure 3(a), (b), respectively.

    Figure 3.  The graphical representations of Theorems 3.5–3.7 with p and q.

    Theorem 3.7. Let G be a tensor product of two paths. Then the fifth multiplicative product connectivity index of first kind is

    §7(G)=10242(p2q3p2+pq212pq+27p3q2+27q54),

    the fifth multiplicative harmonic index is

    §11(G)=16415(p2q3p2+pq212pq+27p3q2+27q54),

    the fifth multiplicative redefined Zagreb index is

    §12(G)=251658240(p+q6)(p3)(q3).

    Proof. By using Table 1, in the formulation of §7(G) §11(G) and §12(G) we get

    §7=|P(1,4)|(1×4)×|P(2,2)|(2×2)×|P(2,4)|(2×4)×|P(4,4)|(4×4)=44×44×4(p+q6)8×2(p3)(q3)16=10242(p2q3p2+pq212pq+27p3q2+27q54),
    §11(G)=2|P(1,4)|(5)×2|P(2,2)|(4)×2|P(2,4)|6×2|P(4,4)|(8)=12(5)×12(4)×12(p+q6)6×1(p3)(q3)8=16415(p2q3p2+pq212pq+27p3q2+27q54),
    §12(G)=|P(1,4)|(1× 4)(1+4)×|P(2,2)|(2×2)(2+2)×|P(2,4)|(2×4)(2+4)×|P(4,4)|(4×4)(4+4)=251658240(p+q6)(p3)(q3).

    The graphical representations of fifth multiplicative product connectivity index of first kind, the fifth multiplicative harmonic index and the fifth multiplicative redefined Zagreb index are shown in Figure 3(c)(e), respectively.

    A tetrahedral diamond lattice Ω is made up of t layers, each of which extends to lt. The initial layer only has one vertex, while the subsequent layer is isomorphic to S4 because it contains four vertices. Each layer l for t 3 has l2k=1k hexagons with 3 pendent vertices. We may set up each additional layer's vertices in accordance with the depth initial marking. To be more specific, we may use layer l to represent labels from l2k=1k2+1 to l2k=1k2. The vertex set of a Ω of size t contains vertices that are a and b while the edge set has edges that are 23(t2t). Ω have no odd cycles, making them bipartite graphs. The graph of tetrahedral diamond lattice Ω is shown in Figure 4 and the edge partition based on the degree of end vertices is given in Table 2.

    Figure 4.  The 5-dimension Ω.
    Table 2.  The edge partition of tetrahedral diamond lattice Ω.
    L(U1), L(U2) Frequency
    (1, 4) 4
    (2, 4) 12(t-2)
    (3, 4) 6(t-2)(t-3)
    (4, 4) 2/3(t39t2+26t24)

     | Show Table
    DownLoad: CSV

    Theorem 4.1. Let Ω tetrahedral diamond lattice then the fifth neighborhood multiplicative M-Zagreb indices for Ω are:

    §1(Ω)=40320(t37t2+16t12)(t39t2+26t24),
    §2(Ω)=1179648(t37t2+16t12)(t39t2+26t24).

    Proof. Using the values of Table 2 in Eq (2.1), we get

    §1(Ω)=|P(1,4)|(1+4)×|P(2,4)|(2+4)×|P(3,4)|(3+4)×|P(4,4)|(4+4)=4(5)×12(t2)(6)×6(t2)(t3)(7)×23(t39t2+26t24)(8)=40320(t37t2+16t12)(t39t2+26t24),
    §2(Ω)=|P(1,4)|(1×4)×|P(2,4)|(2×4)×|P(3,4)|(3×4)×|P(4,4)|(4×4)=4(4)×12(t2)(8)×6(t2)(t3)(12)×23(t39t2+26t24)(16)=1179648(t37t2+16t12)(t39t2+26t24).

    The graphical representations of §1(Ω) and §2(Ω)  with t is shown in Figure 5.

    Figure 5.  The graphical representations of §1(Ω)§6(Ω) and §8(Ω) with t.

    Theorem 4.2. Let Ω tetrahedral diamond lattice then the general fifth multiplicative Zagreb indices of Ω are:

    §3(Ω)=192(1680)α(t37t2+16t12)(t39t2+26t24),
    §5(Ω)=192(6144)α(t37t2+16t12)(t37t2+26t24).

    Proof. Using the values of Table 2 in Eq (2.2), we get

    §3(G)=[|P(1,4)|(1+4)α×|P(2,4)|(2+4)α×|P(3,4)|(3+4)α×|P(4,4)|(4+4)α]=4(5)α×12(t2)(6)α×6(t2)(t3)(7)α×23(t39t2+26t24)(8)α=192(1680)α(t37t2+16t12)(t39t2+26t24),
    §5(Ω)=[|P(1,4)|(1×4)α×|P(2,4)|(2×4)α×|P(3,4)|(3×4)α×|P(4,4)|(4×4)a]=[4(4)α×12(t2)(8)α×6(t2)(t3)(12)α×23(t39t2+26t24)(16)a=192(6144)a(t37t2+16t12)(t37t2+26t24).

    Theorem 4.3. Let Ω tetrahedral diamond lattice then the fifth multiplicative hyper-Zagreb indices Ω are:

    §4(Ω)=541900800(t37t2+16t12)(t39t2+26t24),
    §6(Ω)=7247757312(t37t2+16t12)(t37t2+26t24).

    Proof. Using the values of Table 2 in Eq (2.3), we get

    §4(Ω)=|P(1,4)|(1+4)2×|P(2,4)|(2+4)2×|P(3,4)|(3+4)2×|P(4,4)|(4+4)2=4(5)2×12(t2)(6)2×6(t2)(t3)(7)2×23(t39t2+26t24)(8)2=4×12×6×23×(5×6×7×8)2(t2)2(t3)(t39t2+26t24)=192(1680)2(t2+44t)(t3)(t39t2+26t24)=541900800(t37t2+16t12)(t39t2+26t24),
    §6(Ω)=|P(1,4)|(1×4)2×|P(2,4)|(2×4)2×|P(3,4)|(3×4)2×|P(4,4)|(4×4)2=4(4)2×12(t2)(8)2×6(t2)(t3)(12)2×23(t39t2+26t24)(16)2=4×12×6×23×(4×8×12×16)2(t37t2+16t12)(t37t2+26t24)=7247757312(t37t2+16t12)(t37t2+26t24).

    The graphical representations of §3(Ω)§6(Ω), with t is shown in Figure 5.

    Theorem 4.4. Let Ω tetrahedral diamond lattice then the fifth multiplicative product connectivity index Ω are:

    §8(Ω)=161446(t37t2+16t12)(t39t2+26t24).

    Proof. Using the values of Table 2 in Eq (2.4), we get

    §8=1|P(1,4)|(1×4)×1|P(2,4)|(2×4)×1|P(3,4)|(3×4)×1|P(4,4)|(4×4)=14(4)×112(t2)(8)×16(t2)(t3)(12)×123(t39t2+26t24)16=161446(t37t2+16t12)(t39t2+26t24).

    The graphical representation of the fifth multiplicative product connectivity index §8(Ω) with t is shown in Figure 5.

    Theorem 4.5. Let Ω tetrahedral diamond lattice then the fifth multiplicative sum-connectivity index Ω is:

    §9(Ω)=1768210(t37t2+16t12)(t39t2+26t24).

    Proof. Using the values of Table 2 in Eq (2.5), we get

    §9(Ω)=1|P(1,4)|(1+4)×1|P(2,4)|(2+4)×1|P(3,4)|(3+4)×1|P(4,4)|(4+4)=14(5)×112(t2)(6)×16(t2)(t3)(7)×123(t39t2+26t24)(8)=1768210(t37t2+16t12)(t39t2+26t24).

    Theorem 4.6. Let Ω tetrahedral diamond lattice then the fifth multiplicative geometric-arithmetic index Ω is

    §10(Ω)=128235.

    Proof. Using the values of Table 2 in Eq (2.6), we get

    §10=2|P(1,4)|(1×4)|P(1,4)|(1+4)×2|P(2,4)|(2×4)|P(2,4)|(2+4)×2|P(3,4)|(3×4)|P(3,4)|(3+4)×2|P(4,4)|(4×4)|P(4,4)|(4+4)=2×4445×2×12(t2)812(t2)6×2×6(t2)(t3)126(t2)(t3)7×2×23(t39t2+26t24)1623(t39t2+26t24)8=128235.

    Theorem 4.7. Let Ω tetrahedral diamond lattice. Then the fifth multiplicative product connectivity index of first kind is

    §7(Ω)=61446(t37t2+16t12)(t39t2+26t24),

    the fifth multiplicative harmonic index is

    §11(Ω)=148105(t37t2+16t12)(t39t2+26t24),

    the fifth multiplicative redefined Zagreb index is

    §12(Ω)=1981808640(t37t2+16t12)(t37t2+26t24).

    Proof. Using the values of Table 2 in Eq (2.7), we get

    §7(Ω)=|P(1,4)|(1×4)×|P(2,4)|(2×4)×|P(3,4)|(3×4)×|P(4,4)|(4×4)=4(4)×12(t2)(8)×6(t2)(t3)(12)×23(t39t2+26t24)16=61446(t37t2+16t12)(t39t2+26t24),
    §11(Ω)=2|P(1,4)|(1+4)×2|P(2,4)|(2+4)×2|P(3,4)|(3+4)×2|P(4,4)|(4+4)=24(5)×212(t2)(6)×26(t2)(t3)(7)×223(t39t2+26t24)(8)=148105(t37t2+16t12)(t39t2+26t24),
    §12(Ω)=|P(1,4)|(1×4)(1+4)×|P(2,4)|(2×4)(2+4)×|P(3,4)|(3×4)(3+4)×|P(4,4)|(4×4)(4+4)=4(4)5×12(t2)(8)6×6(t2)(t3)(12)(7)×23(t39t2+26t24)16(8)=1981808640(t37t2+16t12)(t37t2+26t24).

    The graphical representations of the fifth multiplicative product connectivity index of first kind §7(Ω), the fifth multiplicative sum-connectivity index §9(Ω), the fifth multiplicative geometric-arithmetic index §10(Ω), fifth multiplicative harmonic index §11(Ω) and fifth multiplicative redefined Zagreb index §12(Ω) are shown in Figure 6.

    Figure 6.  The graphical representations of §7(Ω) and §9(Ω)§12(Ω) with t.

    This study contains a novel method for computing the topological indices of different chemical networks and namely the networks are product of graphs (L) and tetrahedral diamond lattices (Ω). The mathematical topological properties of molecular structure descriptors, specifically those that depend on graph degrees, are examined in this research work. We derived neighborhood multiplicative topological indices and concise mathematical analysis for product of graphs (L) and tetrahedral diamond lattices (Ω). A few topological descriptors are studied namely, the fifth multiplicative Zagreb index, the general fifth-multiplicative Zagreb index, the fifth-multiplicative hyper-Zagreb index, the fifth-multiplicative product connectivity index, the fifth-multiplicative sum connectivity index, the fifth-multiplicative geometric-arithmetic index, the fifth-multiplicative harmonic index, and the fifth-multiplicative redefined Zagreb index are the topological indices that are taken into consideration. Moreover, a comparative study is also included in this work.

    The author is grateful to the Deanship of Scientific Research of Jazan University for supporting financially this work under Waed grant No. (W44-91).

    I declare that there is no conflict of interest of this article.



    [1] K. Jacobs, A survey of modern mathematical cryptology.Ruohonen, Mathematical Cryp., 1 (2011), 1–13. https://trace.tennessee.edu/utk_chanhonoproj/1406
    [2] C. E Shannon, Communication theory of secrecy systems, Bell Syst. Tech. J., 28 (1949), 656–715. https://doi.org/10.1002/j.1538-7305.1949.tb00928.x doi: 10.1002/j.1538-7305.1949.tb00928.x
    [3] E. Biham, A. Shamir, Differential cryptanalysis of the data encryption standard, Springer Sci. B. Med., 1 (1993), 1–13. https://doi.org/10.1007/978-1-4613-9314-6 doi: 10.1007/978-1-4613-9314-6
    [4] J. Daemen, V. Rijmen, The advanced encryption standard process, The Advanced Encryption Standard Process, In: The Design of Rijndael: AES., 1 (2002), 1–8. https://doi.org/10.1007/978-3-662-04722-4
    [5] N. Ferguson, B. Schneier, T. Kohno, Cryptography engineering: Design principles and practical applications, J. Wiley Sons, 1 (2011), 1–27. http://www.wiley.com/go/permissions
    [6] A. Anees, Y. P. P. Chen, Designing secure substitution boxes based on permutation of the symmetric group, NCA, 2 (2020), 7045–7056. https://doi.org/10.1007/s00521-019-04207-8 doi: 10.1007/s00521-019-04207-8
    [7] A. Javeed, T. Shah, A. Ullah, Construction of non-linear component of block cipher by means of chaotic dynamical system and symmetric group, Wireless Pers Commun., 112 (2020), 467–480. https://doi.org/10.1007/s11277-020-07052-4 doi: 10.1007/s11277-020-07052-4
    [8] T. Shah, A. Qureshi, S-Box on subgroup of galois field, Cryptography, 13 (2019), 1–9. https://doi.org/10.3390/cryptography3020013 doi: 10.3390/cryptography3020013
    [9] A. H. Zahid, M. J. Arshad, M. Ahmad, N. F. Soliman, W. El-Shafai, Dynamic S-Box generation using novel chaotic map with nonlinearity tweaking, CMC-Comput. Mater. Con., 75 (2023), 3011–3026. https://doi.org/10.32604/cmc.2023.037516 doi: 10.32604/cmc.2023.037516
    [10] L. C. N. Chew, E. S. Ismail, S-box construction based on linear fractional transformation and permutation function, Symmetry, 12 (2020), 826–842. https://doi.org/10.3390/sym12050826 doi: 10.3390/sym12050826
    [11] B. Arshad, N. Siddiqui, Z. Hussain, M. E. U. Haq, A novel scheme for designing secure substitution boxes (S-boxes) based on Mobius group and finite field, Wireless Pers Commun., 135 (2022), 3527–3548. https://doi.org/10.1007/s11277-022-09524-1 doi: 10.1007/s11277-022-09524-1
    [12] I. Hussain, T. Shah, M. A. Gondal, H. Mahmood, A novel image encryption algorithm based on chaotic maps and GF (2.8) exponent transformation, Nonlinear Dyn., 72 (2013), 399–406. https://doi.org/10.1007/s11071-012-0723-5 doi: 10.1007/s11071-012-0723-5
    [13] M. Sajjad, T. Shah, R. J. Serna, Designing pair of nonlinear components of a block cipher over Gaussian integers, CMC-Comput. Mater. Con., 75 (2023), 5287–5305. https://doi.org/10.32604/cmc.2023.035347 doi: 10.32604/cmc.2023.035347
    [14] M. Sajjad, T. Shah, R. J. Serna, A. Z. E. Suarez, O. S. Delgado, Fundamental results of cyclic codes over octonion integers and their decoding algorithm, Computation, 10 (2022), 1–12. https://doi.org/10.3390/computation10120219 doi: 10.3390/computation10120219
    [15] E. Biham, A. Shamir, Differential cryptanalysis of DES-like cryptosystems, J. Cryptol., 4 (1991), 3–72. https://doi.org/10.1007/BF00630563 doi: 10.1007/BF00630563
    [16] B. B. C. Quiroga, E. C. Cantón, Generation of dynamical S-boxes for block ciphers via extended logistic map, Math. Probl. Eng., 3 (2020), 1–12. https://doi.org/10.1155/2020/2702653 doi: 10.1155/2020/2702653
    [17] G. Tang, X. Liao, A method for designing dynamical S-boxes based on discretized chaotic map, Chaos Soliton. Fract., 23 (2005), 1901–1909. https://doi.org/10.1016/j.chaos.2004.07.033 doi: 10.1016/j.chaos.2004.07.033
    [18] G. Chen, Y. Chen, X. Liao, An extended method for obtaining S-boxes based on three-dimensional chaotic Baker maps, Chaos Soliton. Fract., 31 (2007), 571–579. https://doi.org/10.1016/j.chaos.2005.10.022 doi: 10.1016/j.chaos.2005.10.022
    [19] U. Çavuşoğlu, A. Zengin, I. Pehlivan, S. Kaçar, A novel approach for strong S-Box generation algorithm design based on chaotic scaled Zhongtang system, Nonlinear Dynam., 87 (2021), 1081–1094. https://doi.org/10.1007/s11071-016-3099-0 doi: 10.1007/s11071-016-3099-0
    [20] N. Siddiqui, A. Naseer, M. E. U. Haq, A novel scheme of substitution-box design based on modified Pascal's triangle and elliptic curve, Wireless Pers. Commun., 116 (2021), 3015–3030. https://doi.org/10.1007/s11277-020-07832-y doi: 10.1007/s11277-020-07832-y
    [21] A. K. Farhan, R. S. Ali, H. Natiq, N. M. Al-Saidi, A new S-box generation algorithm based on multistability behavior of a plasma perturbation model, IEEE Access, 7 (2021), 124914–124924. https://doi.org/10.1109/ACCESS.2019.2938513 doi: 10.1109/ACCESS.2019.2938513
    [22] A. Belazi, M. Khan, A. A. A. E. Latif, S. Belghith, Efficient cryptosystem approach: S-boxes and permutation, substitution, based encryption, Nonlinear Dynam., 87 (2017), 337–361. https://doi.org/10.1007/s11071-016-3046-0 doi: 10.1007/s11071-016-3046-0
    [23] G. Jakimoski, L. Kocarev, Chaos and cryptography: block encryption ciphers based on chaotic maps, IEEE T. Circuits-I, 48 (2001), 163–169. https://doi.org/10.1109/81.904880 doi: 10.1109/81.904880
    [24] M. Khan, T. Shah, H. Mahmood, M. A. Gondal, I. Hussain, A novel technique for the construction of strong S-boxes based on chaotic Lorenz systems, Nonlinear Dynam., 70 (2012), 2303–2311. https://doi.org/10.1007/s11071-012-0621-x doi: 10.1007/s11071-012-0621-x
    [25] W. R. Hamilton, On a new species of imaginary quantities, connected with the theory of quaternions, P. Roy. Irish Aca. C., 2 (1840), 424–434. https://www.jstor.org/stable/20520177
    [26] C. A Deavours, The quaternion calculus, Am. Math. Mon., 80 (1973), 995–1008. https://www.jstor.org/stable/2318774
    [27] J. B. Kuipers, Quaternions and rotation sequences: A primer with applications to orbits, aerospace, and virtual reality, In: Princeton University Press, 1 (1999), 127–143. https://doi.org/10.1017/S0001924000065039
    [28] M. Özen, M. Güzeltepe, Cyclic codes over some finite quaternion integer rings, J. Franklin I, 348 (2011), 1312–1317. https://doi.org/10.1016/j.jfranklin.2010.02.008 doi: 10.1016/j.jfranklin.2010.02.008
    [29] T. Shah, S. S. Rasool, On codes over quaternion integers, Appl. Algebr. Eng. Comm., 24 (2013), 477–496. https://doi.org/10.1007/s00200-013-0203-2 doi: 10.1007/s00200-013-0203-2
    [30] M. Sajjad, T. Shah, M. M. Hazzazi, A. R. Alharbi, I. Hussain, Quaternion integers based higher length cyclic codes and their decoding algorithm, CMC, 73 (2022), 1177–1194. https://doi.org/10.32604/cmc.2022.025245 doi: 10.32604/cmc.2022.025245
    [31] S. Gao, R. Wu, X. Wang, J. Liu, Q. Li, C. Wang, et al., Asynchronous updating Boolean network encryption algorithm, IEEE T. Circuits, 62 (2022), 1–12. https://doi.org/10.1109/TCSVT.2023.3237136 doi: 10.1109/TCSVT.2023.3237136
    [32] S. Gao, R. Wu, X. Wang, J. Wang, Q. Li, C. Wang, et al., A 3D model encryption scheme based on a cascaded chaotic system, Signal Process., 202 (2023), 1–13. https://doi.org/10.1016/j.sigpro.2022.108745 doi: 10.1016/j.sigpro.2022.108745
    [33] S. Gao, R. Wu, X. Wang, J. Liu, Q. Li, X. Tang, EFR-CSTP: Encryption for face recognition based on the chaos and semi-tensor product theory, Inf. Sci., 621 (2023), 766–781. https://doi.org/10.1016/j.ins.2022.11.121 doi: 10.1016/j.ins.2022.11.121
    [34] R. Wu, S. Gao, X. Wang, S. Liu, Q. Li, U. Erkan, et al., AEA-NCS: An audio encryption algorithm based on a nested chaotic system, Chaos Soliton. Fract., 165 (2023), 1–10. https://doi.org/10.1016/j.chaos.2022.112770 doi: 10.1016/j.chaos.2022.112770
    [35] Y. Chen, C. Tang, R. Ye, Cryptanalysis and improvement of medical image encryption using high-speed scrambling and pixel adaptive diffusion, Signal Process, 167 (2020), 1–12. https://doi.org/10.1016/j.sigpro.2019.107286 doi: 10.1016/j.sigpro.2019.107286
    [36] X. Wang, H. Sun, A chaotic image encryption algorithm based on improved Joseph traversal and cyclic shift function, Opt. Laser Technol., 122 (2020), 1–12. https://doi.org/10.1016/j.optlastec.2019.105854 doi: 10.1016/j.optlastec.2019.105854
    [37] J. Chen, L. Chen, Y. Zhou, Cryptanalysis of a DNA-based image encryption scheme, Inf. Sci., 520 (2020), 130–141. https://doi.org/10.1016/j.ins.2020.02.024 doi: 10.1016/j.ins.2020.02.024
    [38] H. Zhu, J. Ge, W. Qi, X. Zhang, X. Lu, Dynamic analysis and image encryption application of a sinusoidal-polynomial composite chaotic system, Math. Comput. Simulat., 198 (2022), 188–210. https://doi.org/10.1016/j.matcom.2022.02.029 doi: 10.1016/j.matcom.2022.02.029
    [39] Y. Xian, X. Wang, X. Yan, Q. Li, X. Wang, Image encryption based on chaotic sub-block scrambling and chaotic digit selection diffusion, Opt. Laser Eng., 134 (2020), 1–13. https://doi.org/10.1016/j.optlaseng.2020.106202 doi: 10.1016/j.optlaseng.2020.106202
    [40] C. Li, Y. Zhang, E. Y. Xie, When an attacker meets a cipher-image: A year in review, J. Inf. Secur. Appl., 48 (2019), 1–9. https://doi.org/10.1016/j.jisa.2019.102361 doi: 10.1016/j.jisa.2019.102361
  • This article has been cited by:

    1. Ali Ahmad, Ali N. A. Koam, Ibtisam Masmali, Muhammad Azeem, Haleemah Ghazwani, Connection number topological aspect for backbone DNA networks, 2023, 46, 1292-8941, 10.1140/epje/s10189-023-00381-9
    2. Ibtisam Masmali, Muhammad Azeem, Muhammad Kamran Jamil, Ali Ahmad, Ali N. A. Koam, Study of some graph theoretical parameters for the structures of anticancer drugs, 2024, 14, 2045-2322, 10.1038/s41598-024-64086-5
    3. Hani Shaker, Sabeen Javaid, Usman Babar, Muhammad Kamran Siddiqui, Asim Naseem, Characterizing superlattice topologies via fifth M-Zagreb polynomials and structural indices, 2023, 138, 2190-5444, 10.1140/epjp/s13360-023-04645-3
    4. Ali N. A. Koam, Ali Ahmad, Ibtisam Masmali, Muhammad Azeem, Mehwish Sarfraz, Naeem Jan, Several intuitionistic fuzzy hamy mean operators with complex interval values and their application in assessing the quality of tourism services, 2024, 19, 1932-6203, e0305319, 10.1371/journal.pone.0305319
    5. Ali N. A. Koam, Ali Ahmad, Maryam Salem Alatawi, Adnan Khalil, Muhammad Azeem, Ammar Alsinai, On the Constant Partition Dimension of Some Generalized Families of Toeplitz Graph, 2024, 2024, 2314-4629, 10.1155/2024/4721104
    6. Ali N. A. Koam, Ali Ahmad, Raed Qahiti, Muhammad Azeem, Waleed Hamali, Shonak Bansal, Enhanced Chemical Insights into Fullerene Structures via Modified Polynomials, 2024, 2024, 1076-2787, 10.1155/2024/9220686
    7. Ali Ahmad, Ali N. A. Koam, Muhammad Azeem, Ibtisam Masmali, Rehab Alharbi, Eyas Mahmoud, Edge based metric dimension of various coffee compounds, 2024, 19, 1932-6203, e0294932, 10.1371/journal.pone.0294932
    8. Muhammad Shoaib Sardar, Khalil Hadi Hakami, Vinod Kumar Tiwari, QSPR Analysis of Some Alzheimer’s Compounds via Topological Indices and Regression Models, 2024, 2024, 2090-9063, 10.1155/2024/5520607
    9. Ali N. A. Koam, Ali Ahmad, Shahid Zaman, Ibtisam Masmali, Haleemah Ghazwani, Fundamental aspects of the molecular topology of fuchsine acid dye with connection numbers, 2024, 47, 1292-8941, 10.1140/epje/s10189-024-00418-7
    10. Haleemah Ghazwani, Muhammad Kamran Jamil, Ali Ahmad, Muhammad Azeem, Ali N. A. Koam, Applications of magnesium iodide structure via modified-polynomials, 2024, 14, 2045-2322, 10.1038/s41598-024-64344-6
    11. Ali N.A. Koam, Muhammad Azeem, Ali Ahmad, Ibtisam Masmali, Connection number-based molecular descriptors of skin cancer drugs, 2024, 15, 20904479, 102750, 10.1016/j.asej.2024.102750
    12. Khawlah Alhulwah, Ali N.A. Koam, Nasreen Almohanna, Muhammad Faisal Nadeem, Ali Ahmad, Topological indices and their correlation with structural properties of carbon nanotube Y-junctions, 2025, 70, 22113797, 108141, 10.1016/j.rinp.2025.108141
  • Reader Comments
  • © 2023 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(1659) PDF downloads(62) Cited by(5)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog