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

Securing air defense visual information with hyperchaotic Folded Towel Map-Based encryption

  • In modern air defense systems, safeguarding sensitive information is crucial to prevent unauthorized access and cyber-attacks. Here, we present an innovative image encryption approach, leveraging chaotic logistic maps and hyperchaotic Folded Towel Map sequence generation. The proposed image encryption is a multi-layered procedure intended to secure image transmission. It initiates with permutation, where a chaotic logistic map generates pseudo-random sequences to scramble pixel positions. Next, key mixing creates complexity, randomness, and nonlinearity using an invertible key matrix. Finally, the diffusion phase employs hyperchaotic maps to produce a new sequence XORed with the pixels through a bitwise operation, further encrypting the image. This three-stage process efficiently protects images from unauthorized access, ensuring secure transmission. The proposed method enhances security by leveraging non-linearity, sensitivity, and robust mixing, properties making it highly resistant to cryptographic attacks. The experimental results showed robust encryption performance as established by metrics such as an entropy value of 7.9991, a UACI of 33.21%, and an NPCR of 99.61%. The proposed encryption approach outperformed existing methods in securing image transmission and storage, offering a reliable solution for protecting air defense communication strategic data.

    Citation: Shamsa Kanwal, Saba Inam, Fahima Hajjej, Ala Saleh Alluhaidan. Securing air defense visual information with hyperchaotic Folded Towel Map-Based encryption[J]. AIMS Mathematics, 2024, 9(11): 31217-31238. doi: 10.3934/math.20241505

    Related Papers:

    [1] Monica-Felicia Bota, Liliana Guran . Existence of a solution of fractional differential equations using the fixed point technique in extended b-metric spaces. AIMS Mathematics, 2022, 7(1): 518-535. doi: 10.3934/math.2022033
    [2] Aftab Hussain . Fractional convex type contraction with solution of fractional differential equation. AIMS Mathematics, 2020, 5(5): 5364-5380. doi: 10.3934/math.2020344
    [3] Muhammad Sarwar, Aiman Mukheimer, Syed Khayyam Shah, Arshad Khan . Existence of solutions of fractal fractional partial differential equations through different contractions. AIMS Mathematics, 2024, 9(5): 12399-12411. doi: 10.3934/math.2024606
    [4] Abdullah Eqal Al-Mazrooei, Jamshaid Ahmad . Fixed point approach to solve nonlinear fractional differential equations in orthogonal F-metric spaces. AIMS Mathematics, 2023, 8(3): 5080-5098. doi: 10.3934/math.2023255
    [5] Rajagopalan Ramaswamy, Gunaseelan Mani . Application of fixed point result to solve integral equation in the setting of graphical Branciari -metric spaces. AIMS Mathematics, 2024, 9(11): 32945-32961. doi: 10.3934/math.20241576
    [6] Müzeyyen Sangurlu Sezen . Interpolative best proximity point results via γ-contraction with applications. AIMS Mathematics, 2025, 10(1): 1350-1366. doi: 10.3934/math.2025062
    [7] Mohammed Shehu Shagari, Akbar Azam . Integral type contractions of soft set-valued maps with application to neutral differential equations. AIMS Mathematics, 2020, 5(1): 342-358. doi: 10.3934/math.2020023
    [8] Gonca Durmaz Güngör, Ishak Altun . Fixed point results for almost (ζθρ)-contractions on quasi metric spaces and an application. AIMS Mathematics, 2024, 9(1): 763-774. doi: 10.3934/math.2024039
    [9] Ahmed Morsy, Kottakkaran Sooppy Nisar, Chokkalingam Ravichandran, Chandran Anusha . Sequential fractional order Neutral functional Integro differential equations on time scales with Caputo fractional operator over Banach spaces. AIMS Mathematics, 2023, 8(3): 5934-5949. doi: 10.3934/math.2023299
    [10] Mohammed Shehu Shagari, Qiu-Hong Shi, Saima Rashid, Usamot Idayat Foluke, Khadijah M. Abualnaja . Fixed points of nonlinear contractions with applications. AIMS Mathematics, 2021, 6(9): 9378-9396. doi: 10.3934/math.2021545
  • In modern air defense systems, safeguarding sensitive information is crucial to prevent unauthorized access and cyber-attacks. Here, we present an innovative image encryption approach, leveraging chaotic logistic maps and hyperchaotic Folded Towel Map sequence generation. The proposed image encryption is a multi-layered procedure intended to secure image transmission. It initiates with permutation, where a chaotic logistic map generates pseudo-random sequences to scramble pixel positions. Next, key mixing creates complexity, randomness, and nonlinearity using an invertible key matrix. Finally, the diffusion phase employs hyperchaotic maps to produce a new sequence XORed with the pixels through a bitwise operation, further encrypting the image. This three-stage process efficiently protects images from unauthorized access, ensuring secure transmission. The proposed method enhances security by leveraging non-linearity, sensitivity, and robust mixing, properties making it highly resistant to cryptographic attacks. The experimental results showed robust encryption performance as established by metrics such as an entropy value of 7.9991, a UACI of 33.21%, and an NPCR of 99.61%. The proposed encryption approach outperformed existing methods in securing image transmission and storage, offering a reliable solution for protecting air defense communication strategic data.



    One of the concepts which have significant impact in Clifford analysis is studying the approximation of a Cliffordian function h(m)(x), xRm+1 as a series of the form:

    n=0Q(m)n(x) a(m)n,  a(m)nCm, (1.1)

    where {Q(m)n(x), xRm+1} is a prescribed base of Cllifordian polynomials and Cm is the real Clifford algebra of dimension 2m. In 1990, this problem was addressed by the authors of [1]. The polynomials are assumed to form a Hamel basis of Sm(x) (the Clifford linear space of all special monogenic polynomials (SMPs) with Clifford algebra coefficients). The series (1.1) is called the basic series associated with the base of SMPs. Many results about the approximation of SMFs and ESMFs by basic series, which can be associated with bases of SMPs [2,3].

    The theory of basic series in the case of one complex variable was originally discovered by Whittaker and Cannon [4,5,6,7] about 90 years ago. As we have mentioned earlier, the attempt done by authors of [1] were the first to extend the notion of basic series in the case of Clifford analysis.

    In the case of a single complex variable, the approximation properties of the derivative and integral bases of a certain base of polynomials of in a disk of center origin have been studied by many authors, of whom we may mention Makar [8], Mikhail [9], and Newns [10]. In the case of of several complex variables the domains of representation are hyperspherical, hyperelliptical and polycylinderical regions (see [11,12]). Afterwards, the authors of [13,14] generalized this problem in Clifford analysis, which is called hypercomplex primitive and derivative bases of SMPs and their representations is in closed hyperballs.

    Approximation theory is a rich topic which has numerous applications in various scientific disciplines such that mathematical analysis, statistics, engineering and physics. Recently, order moment of the wind power time series has been studied in [15]. Although our study is narrowed to theoretical aspects, the basic sets (bases) of polynomials proved its efficiency in as solutions to important partial differential equations, such as the heat equation [16] and wave equation [17,18].

    The authors of [19] introduced an expansion of a SMF by basic series of generalized Bessel SMPs. They proved that the GBSMPs are solutions of second order homogeneous differential equations. Furthermore, in [3], the authors proved an extended version of Hadamard's three-hyperballs theorem to study the overconvergence properties. One of the recent fascinating research findings can be found in [20] where the authors of used the Hadamard's three-hyperballs theorem to generalize the Whittaker-Cannon theorem in open hyperballs in Rm+1. Precisely, they proved that the hypercomplex Cannon functions preserved the effectiveness properties of both Cannon and non-Cannon bases. In the very recent paper [21] the authors derived a new base of SMPs in F-modules, named the equivalent base. They have also studied the convergence properties (effectiveness, order and type, Tρ-property) of these base.

    In 2017, a study based primarily on combination of Clifford analysis and functional analysis [26] when the considered bases {Q(m)n(x)} are not necessarily consisting of polynomials. The convergence properties of these general bases had been studied in F-modules. Precisely, a general criterion for effectiveness of basic series in F-modules was constructed.

    Recently in [22], the authors have studied a new base called hypercomplex Ruscheweyh derivative bases (HRDBs). They investigated the effectiveness properties of HRDBs of a given base of SMPs in different regions of convergence in F-modules. The above treatment is considered to extend and improve the results in Clifford and complex given in [8,9,10,13,14].

    Motivated by the preceding discussion, the current work introduces a modified generalization of the Hasse derivative operator (HDO). Acting by hypercomplex HDO on bases, we derive a base of SMPs, which we may call the hypercomplex Hasse derivative bases of SMPs (HHDBSMPs). Consequently, we discuss the effectiveness properties, mode of increase, and the Tρ-property of such a base in several regions: closed and open hyperballs, open regions surrounding closed hyperball, at the origin, and for all entire SMFs. Some applications on the HHD of Bernoulli SMPs (BSMPs), Euler SMPs (ESMPs), proper Bessel SMPs (PBSMPs), general Bessel SMPs (GBSMPs) and Chebyshev SMPs (CSMPs) are also provided. The obtained results offer new generalizations of existing work concerning the convergence properties of polynomials bases in both complex and Clifford settings.

    This section collects some notations and basic results which are needed throughout the paper. More details can be found in the literature, see [1,23,24,25,26]. The real Clifford algebra over R is defined as

    Cm={b=B{1,...m} bBeB, bBR},

    where ei=e{i}, i=1,,m, e0=eϕ=1 and eB=eβ1...eβh, with 1β1<β2<<βhm. The product in Cm is determined by the relations eiej+ejei=2δij where δij denotes the Kronecker delta and e0=1 for 1ijm (for details on the main concepts about Cm, see [25]). The norm of a Clifford number is given by |b|=(BN|bB|2)12 where N stands for {1,,m}.

    Since Cm is isomorphic to R2m we may provide it with the R2m-norm |b| and one sees easily that for any b,cCm, |bc|2m2 |b||c|.

    The elements (x0,x)=(x0,x1,...,xm)Rm+1 will be identified with the Clifford numbers x0+x_=x0+mj=1ejxj. Note that if x=x0+x_Rm+1, ¯x=x0x_.

    Definition 2.1. Let xRm+1 and ΩRm+1 be an open set, then the function h(m)(x) is called left monogenic in Ω if D[h(m)(x)]=0 where

    D=mi=0eixi

    is the generalized Cauchy-Riemann operator. Similarly, h(m)(x) is a right monogenic function if [h(m)(x)]D=0.

    Definition 2.2. A polynomial Q(m)(x) is SMP iff DQ(m)(x)=0 and has the form:

    Q(m)(x)=finitei,j¯xixja(m)i,j,

    where a(m)i,jCm.

    Let Sm[x] be the space of all SMPs is the right Cm-module defined by

    Sm[x]=spanCm{Q(m)n(x): nN},

    where Q(m)n(x) was given in [1] as follows:

    Q(m)n(x)=n!(m)nr+s=n(m12)r(m+12)sr!s!¯xrxs, (2.1)

    where for βR, (β)l=β(β+1)(β+l1) is the Pochhamer symbol.

    Definition 2.3. Let ΩRm+1 be a connected open containing 0 and h(m) is monogenic in Ω. The function h(m) is said to be SMF in Ω if and only if its Taylor series near zero exists and cab be expressed as: h(m)(x)=n=0Q(m)n(x) a(m)n for some SMPs Q(m)n(x).

    If Q(m)n(x) is a homogeneous SMP has degree n in x, (see [1])

    Q(m)n(x)=Q(m)n(x) β(m)n,

    where β(m)nCm is a constant. Accordingly, it follows that:

    Q(m)nR=sup¯B(R)|Q(m)n(x)|=Rn.

    Next, we recall the definition of F-module.

    Definition 2.4. An F-module E over Cm is a complete Hausdorff topological vector space by countable family of a proper system of semi-norms Q={.s}s0 such that s<th(m)sh(m)t; (h(m)E), Hence WE is open iff h(m)W, ϵ>0, M0 such that {g(m)E:h(m)g(m)s)ϵ}W,sM.

    Definition 2.5. A sequence {h(m)n} in an F-module E converges to g(m) in E if

    limn h(m)ng(m)s=0

    for all .sQ.

    The domains of representation adopted here are the open hyperball B(R), the closed hyperball ¯B(R) and B+(R); R>0, where B+(R) any open hyperball enclosing closed hyperball, these are the sets defined by

    B(R)={xRm+1:|x|<R},
    ¯B(R)={xRm+1:|x|R},
    B+(R)={xRm+1:|x|<R+}.

    Table 1 summarizes certain classes of SMFs which represent F-modules where xRm+1 and each space is associated with the a proper countable system of semi-norms as follows.

    Table 1.  F-modules.
    Space The Associated Semi-Norms
    M[B(R)]: Class of SMFs in B(R) h(m)r=sup¯B(r)|h(m)(x)|,  r<R, h(m)M[B(R)],
    M[¯B(R)]: Classe of SMFs in ¯B(R) h(m)R=sup¯B(R)|h(m)(x)|,   h(m)M[¯B(R)],
    M[B+(R)]: Class of SMFs in B+(R) h(m)r=sup¯B(r)|h(m)(x)|,  R<r, h(m)M[B+(R)],
    M[0+]: Class of SMFs at the origin h(m)ϵ=sup¯B(ϵ)|h(m)(x)|, ϵ>0  h(m)M[0+] ,
    M[]: Class of ESMFs on Rm+1 h(m)n=sup¯B(n)|h(m)(x)|, n<  h(m)M[].

     | Show Table
    DownLoad: CSV

    Now, let {Q(m)n(x)} be a base of an F-module E such that

    Q(m)n(x)=k=0Q(m)k(x) Q(m)n,k,  Q(m)n,kCm, (2.2)
    Q(m)n(x)=k=0 Q(m)k(x) π(m)n,k,  π(m)n,kCm, (2.3)
    Q(m)nR=sup¯B(R)|Q(m)n(x)|, (2.4)
    ΨQ(m)n(R)=kQ(m)k π(m)n,kR, (2.5)

    this sum is called hypercomplex Cannon sum, where

    Q(m)k π(m)n,kR=sup¯B(R)|Q(m)k(x) π(m)n,k|,ΨQ(m)(R)=lim supn{ΨQ(m)n(R)}1n, (2.6)

    where ΨQ(m)(R) is called the hypercomplex Cannon function of the base {Q(m)n(x)} in closed hyperball ¯B(R).

    Let Dn is the degree of the polynomial of highest degree in the representation (2.3) the following restrictions are imposed.

    limn{Dn}1n=1, (2.7)
    Dn=O[na],  a1,  (2.8)
    Dn=o(nlogn). (2.9)

    If dk is the degree of the polynomials {Q(m)k(x)}, then dkDn for all kn (see [1]).

    If Q(m)=(Q(m)n,k) and Π(m)=(π(m)n,k) are the Clifford matrices of coefficients and operators respectively of the set {Q(m)n(x)}. Thus according to [1] the set {Q(m)n(x)} will be base iff

    Q(m)Π(m)=Π(m)Q(m)=I, (2.10)

    where I is the unit matrix.

    Let h(m)(x)=n=0Q(m)n(x) an(h(m)) be any function which is SMF at the origin, substituting for Q(m)n(x) from (2.3) we obtain the basic series

    h(m)(x)n=0Q(m)n(x) Πn(h(m)), (2.11)

    where

    Πn(h(m))=k=0π(m)k,n ak(h(m)) . (2.12)

    The authors in [22,26] introduced the idea of effectiveness for the class M[¯B(R)]. A base {Q(m)n(x)} is effective for the class M[¯B(R)] If the basic series (2.11) converges normally to every function h(m)(x)M[¯B(R)] which is SMF in ¯B(R). Similar definitions are used for the classes M[B(R)], M[B+(R)], M[] and M[0+].

    They also proved:

    Theorem 2.1. A base {Q(m)n(x)} is effective for the classes M[¯B(R)], M[B(R)], M[B+(R)], M[] or M[0+] if and only if ΨQ(m)(R)=R, ΨQ(m)(r)<R   r<R, ΨQ(m)(R+)=R, ΨQ(m)(R)<  R<, or ΨQ(m)(0+)=0.

    For the definition of bases of SMPs and theorems governing the effectiveness properties of bases of SMPs, the reader is referred to the authors [21,22,26].

    The complex Hasse derivative operator (CHDO) of order i is defined in [28,29,30]. Using the definition of the complex Hasse derivative, we can define a new operator in the case of Clifford setting called the hypercomplex Hasse derivative (HHD) as follows:

    Definition 3.1. For each integer i0 the HHD H(i) of order i is defined by

    H(i)(Q(m)n(x))=ζn,i Q(m)ni(x), (3.1)

    where

    ζn,i=nii!i1j=1(1jn)

    and H(i) is closely related to the higher hypercomplex derivative (12¯D)i: H(i)=1i!(12¯D)i.

    The set {Q(m)n(x)} is an Appell sequence with respect to x0 or 12¯D : 12¯DQ(m)n(x)=nQ(m)n1(x).

    Remark 3.1. If xC1 then (3.1) is reduced to the ordinary Hasse derivative of order i (see [28,29,30]),

    Definition 3.2. Let {Q(m)n(x)} be a base. By acting on both sides of Eq (2.2) with the operator H(i), we get

    H(i)Q(m)n(x)=k  ζk,i Q(m)ki(x)Q(m)n,k. (3.2)

    The set {H(i)Q(m)n(x)} = {H(i,m)(x)} is defined the Hypercomplex Hasse derivative bases (HHDBs).

    The present work deals principally with the convergence properties of certain classes of bases, namely HHDBs. In fact we shall study the convergence of the expansion of certain classes of functions as series of HHDBs. This study will be based on the already established theorems dealing with the convergence of basic series of HHDBs. The convergence properties of HHDBs are mainly classified as follows:

    (1) The region of effectiveness of HHDBs for the classes M[B(R)], M[¯B(R)], M[B+(R)], M[0+], and M[].

    (2) The mode of increase of HHDBs which determined by the order and type.

    (3) The Tρ-property of HHDBs.

    In the following sections, we will investigated all of these problems.

    In the current section, the property of effectiveness concerning the HHDBs in several regions such as M[B(R)], M[0+], M[] and M[B+(R)] are demonstrated.

    Theorem 4.1. If {Q(m)n(x)} is a base, then the HHD set {H(i,m)(x)} is also base.

    Proof. We form the coefficient matrix H(i,m) by defining the HHDBs in (2.2)

    H(i,m)n(x)=k Q(m)ki(x) ζk,iQ(m)n,k.

    Hence, the coefficients matrix H(i,m) is given by the following:

    H(i,m)=(H(i,m)n,k)=(ζk,i Q(m)n,k).

    Also, the operators matrix Π(i,m) follows from the effect H(i) on both sides of the representation (2.3) where

    Q(m)ki(x)=1ζn,ikπ(m)n,kH(i,m)k(x),

    and

    Π(i,m)=(π(i,m)n,k)=(1ζn,i π(m)n,k).

    Consequently,

    H(i,m)Π(i,m)=(kH(i,m)n,kπ(i,m)k,h)=(kQ(m)n,kπ(m)k,h)=(δn,h)=I.

    Moreover,

    Π(i,m)H(i,m)=(kπ(i,m)n,kH(i,m)k,h)=(k1ζn,iπ(m)n,k ζh,i Q(m)k,h)=(ζh,iζn,iδn,h)=I.

    We easily obtain from (2.10) that the set {H(i,m)n(x)} is a base.

    Theorem 4.2. The base {Q(m)n(x)} and its HHDBs {H(i,m)n(x)} have the same region of effectiveness for the class M[B(R)].

    Proof. If Q(m)n(x) is a base, Q(m)nr=sup¯B(r)|Q(m)n(x)| and H(i,m)nr=sup¯B(r)|H(i,m)n(x)|, then

    H(i,m)nr=sup¯B(r)|H(i,m)n(x)|=sup¯B(r)|jζj,i Q(m)ji(x)Qn,j|2m/2jζj,i rjiQ(m)nRRj=2m/2riΥ(r,R) Q(m)nR=K1 Q(m)nR    for all r<R, (4.1)

    where K1=2m/2riΥ(r,R) and Υ(r,R)=j=0ζj,i(rR)j<.

    Using (2.5) and (4.1), it follows that the hypercomplex Cannon sum of the HHDBs {H(i,m)n(x)} is given by

    ΨH(i,m)n(r)=kH(i,m)kπ(i,m)n,krK1kQ(m)k π(i,m)n,kR=K1ζn,ikQ(m)kπ(m)n,kR=K1ζn,iΨQ(m)n(R). (4.2)

    Using (2.6) and (4.2), we obtain that the hypercomplex Cannon function of the HHDBs is given by:

    ΨH(i,m)(r)ΨQ(m)(R),   r<R. (4.3)

    Now, suppose that the base {Q(m)n(x)} is effective for M[B(R)], we can apply Theorem 2.1, we have

    ΨQ(m)(r)<R,   r<R. (4.4)

    Hence there is a number r1 such that r<r1<R, then from (4.3) and (4.4), we deduce that

    ΨH(i,m)(r)ΨQ(m)(r1)<R,   r<R,

    that is to say the base {H(i,m)n(x)} is effective for M[B(R)].

    Theorem 4.3. The base {Q(m)n(x)} and its HHDBs {H(i,m)n(x)} have the same region of effectiveness for the class M[0+] or M[].

    Proof. Suppose that the base {Q(m)n(x)} is effective for M[0+], we can apply Theorem 2.1, it follows that ΨQ(m)(0+)=0. Making R,r0+ in (4.3), we have ΨH(i,m)(0+)ΨQ(m)(0+)=0 but we know that ΨH(i,m)(0+)0, thus, ΨH(i,m)(0+)=0. Therefore, the base {H(i,m)n(x)} is effective for M[0+].

    Now, suppose that the base {Q(m)n(x)} is effective for M[]. Applying Theorem 2.1 we conclude that

    ΨQ(m)(r)<, r<. (4.5)

    Thus if we choose the number r2 such that r<r2<R, making R in (4.3). Then, by using (4.5), we obtain that

    ΨH(i,m)(r)ΨQ(m)(r2)<, r<,

    and, the base {H(i,m)n(x)} will be effective for M[].

    Theorem 4.4. The base {Q(m)n(x)} and its HHDBs {H(i,m)n(x)} have the same region of effectiveness for the class M[B+(R)].

    Proof. If the base {Q(m)n(x)} is effective for M[B+(r3)] and r3 is any positive number such that r3<r, we can apply Theorem 2.1, we obtain

    ΨQ(m)(r+3)=r3,  r3<r<R. (4.6)

    Making Rr+3 in (4.3), we easily obtain, from (4.6) that ΨH(i,m)(r+3)ΨQ(m)(r+3)=r3, but ΨH(i,m)(r+3)r3 which implies that ΨH(i,m)(r+3)=r3. Hence, the base {H(i,m)n(x)} is indeed effective for M[B+(r3)] as required.

    When the representation (2.3) is finite then the base is called SMPs. In this section we will discuss the region of effectiveness of HHDBSMPs for the class of SMFs in ¯B(R). The following result states the purpose of this section.

    Theorem 5.1. The base {Q(m)n(x)} for which the condition (2.7) is satisfied and its HHDBSMPs {H(i,m)n(x)} have the same region of effectiveness for the class M[¯B(R)].

    Proof. If Q(m)n(x) is a base of SMPs, Q(m)nR=sup¯B(R)|Q(m)n(x)| and H(i,m)nR=sup¯B(R)|H(i,m)n(x)|, then

    H(i,m)nR=sup¯B(R)|H(i,m)n(x)|=sup¯B(R)|jQ(m)n,j ζj,i Q(m)ji(x)|jQ(m)nRRj ζj,i Rji=Q(m)nRRij ζj,iQ(m)nRRi ζdn,i (ζdn,i+1), (5.1)

    where dn is the degree of the polynomial Q(m)n(x), dnDn. Applying (2.5) and (5.1), it follows that

    ΨH(i,m)n(R)=k H(i,m)k π(i,m)n,kR1ζn,iRikQ(m)k π(m)n,kR ζdk,i (ζdk,i+1)1ζn,iRiζDn,i (ζDn,i+1) ΨQ(m)n(R). (5.2)

    A combination of (2.6), (2.7) and (5.2), gives ΨH(i,m)n(R)ΨP(m)(R)R.

    But ΨH(i,m)n(R)R. We finally deduce that

    ΨH(i,m)n(R)=R. (5.3)

    and the HHDBSMPs {H(i,m)n(x)} is effective for M[¯B(R)].

    The following example shows that the condition (2.7) imposed on the class of the base {Q(m)n(x)} cannot be relaxed.

    Example 5.1. Theorem 5.1 is not always correct if the condition (2.7) is not satisfied. Let

    Q(m)n(x)={Q(m)n(x),n is even,Q(m)n(x)+ Q(m)b(x), b=2n,n is odd.

    When n is even, we have Q(m)n(x)=Q(m)n(x) and hence ΨQ(m)n(R)=Rn. Thus, by taking R=1, then ΨQ(m)n(1)=1, and limn{ΨQ(m)2n(1)}12n=1.

    Furthermore, Q(m)n(x)=Q(m)n(x)Q(m)b(x), when n is odd, then

    ΨQ(m)n(R)=Rn+2 Rb.

    So that when R=1, ΨQ(m)n(1)=3, we get

    limn {ΨQ(m)2n+1(1)}12n+1=1.

    Consequently, ΨQ(m)(1)=lim supn {ΨQ(m)n(1)}1n=1, and the base {Q(m)n(x)} is effective for M[¯B(1)].

    Forming the HHDBSMPs {H(i,m)n(x)}, we easily get

    H(i,m)n(x)={ζn,i Q(m)ni(x),n is even, and 2,ζn,i Q(m)ni(x)+ζb,iQ(m)bi(x), n is odd.

    Since Q(m)ni(x)=(1ζn,i) H(i,m)n(x), when n is even, then ΨH(i,m)n(R)=Rni, taking R=1, ΨH(i,m)n(1)=1. Hence,

    limn {ΨH(i,m)2n(1)}12n=1.

    When n is odd, Q(m)ni(x)=(1ζn,i)[H(i,m)Pn(x)ζb,iH(i,m)b(x)]. Hence we have, ΨH(i,m)n(R)=(1ζn,i)[ζn,iRni+2 ζb,iRbi].

    Taking R=1, then we get

    ΨH(i,m)(1)=lim supn {ΨH(i,m)2n+1(1)}12n+1=2>1,

    and the HHDBSMPs {H(i,m)n(x)} is not effective for M[¯B(1)].

    For a simple base of SMPs (Dn=n) (see [1]), we obtain the following corollary.

    Corollary 5.1. When the simple base {Q(m)n(x)} of SMPs is effective for M[¯B(R)], so also will be the HHDBSMPs {H(i,m)n(x)}.

    In [1,23], the idea of the order and type of the base {Q(m)n(x} of SMPs was introduced as follows:

    ρQ(m)=limRlim supnlog ΨQ(m)n(R)n log n. (6.1)

    and

    τQ(m)=limReρQ(m)lim supn{ΨQ(m)n(R)}1n ρQ(m)n. (6.2)

    Importantly, if the base {Q(m)n(x)} has finite order ρQ(m) and finite type τQ(m), then it can represent every ESMF of order less than 1ρQ(m) and type less than 1τQ(m) in any finite hyperball. Rich investigation on the order of certain classes of bases can be found in [31,32].

    Now, we explore the relation between the order and type of SMPs {Q(m)n(x)} and our constructed base; {H(i,m)n(x)} as follows.

    Theorem 6.1. Let ρQ(m) and τQ(m) be the order and type of the base of SMPs {Q(m)n(x)} satisfying the condition (2.8). Then the HHDBSMPs {H(i,m)n(x)} will be of order ρH(i,m)ρQ(m) and type τH(i,m)τQ(m) whenever ρH(i,m)=ρQ(m). The values of ρQ(m) and τQ(m) are attainable.

    Proof. The proof of this theorem denoted on the inequality (5.2), since

    ΨH(i,m)n(R)1ζn,iRαζDn,i (ζDn,i+1) ΨQ(m)n(R).

    Then

    limRlim supnlog ΨH(i,m)n(R)n log nlimRlim supnlog ζDn,i (ζDn,i+1)+log ΨQ(m)n(R)n log n.

    It follows, in view of (6.1), that the HHDBSMPs is at most ρQ(m).

    If ρH(i,m)=ρQ(m), we have

    limReρH(i,m)lim supn{Ψ(i)Hn(R)}1n(ρH(i,m))nlimReρQ(m)lim supn{ΨQn(R)}1n(ρQ(m))n,

    and the type of the HHDBSMPs is at most τQ(m).

    Note that the upper bound given in this theorem is attainable. We will illustrate this fact by introducing the following example:

    Example 6.1. Let {Q(m)n(x)} be the base of SMPs given by Q(m)n(x)=nn+Q(m)n(x), Q(m)0(x)=1, for which

    ΨQ(m)n(R)=nn[2+(Rn)n].

    It is easily seen that the base {Q(m)n(x)} is of order ρQ(m)=1 and type τQ(m)=e. Construct now the base {H(i,m)n(x)} such that

    H(i,m)n(x)=nn+ζn,i Q(m)ni(x),  Q(m)0(x)=1.

    Hence,

    ΨH(i,m)n(R)=nnζn,i[2+ζn,iRi(Rn)n].

    Therefore, the base {H(i,m)n(x)} is of order ρH(i,m)=1 and type τH(i,m)=e.

    The following example illustrates the best possibility of condition (2.8).

    Example 6.2. Let the base {Q(m)n(x)} of SMPs be defined by

    Q(m)n(x)={Q(m)n(x),n is even,Q(m)n(x)+μb2μ Q(m)2μ(x),n is odd and μ=nn,b>1.

    Hence,

    Q(m)n(x)=Q(m)n(x)μb2μQ(m)2μ(x),

    and

    ΨQ(m)n(R)=Rn+2μ(Rb)2μ.

    It is easy to see that the base Q(m)n(x) is of order ρQ(m)=1.

    For the HHDBSMPs {H(i,m)n(x)} it can verified that

    H(i,m)n(x)={ζn,i Q(m)ni(x),n is even,ζn,i Q(m)ni(x)+μb2μ ζ2μ,i Q(m)2μi(x),n is odd.

    Thus,

    Q(m)ni(x)=1ζn,iH(i,m)n(x)μb2μ ζ2μ,iζn,i H(i,m)2μ(x).

    Consequently,

    ΨH(i,m)n(R)=Rni+2μbi ζ2μ,iζn,i (Rb)2μi.

    Therefore, ρH(i,m)=2 and ρH(i,m)>ρQ(m). This completes the proof.

    If the base of SMPs {Q(m)n(x)} is simple base (Dn=n) (see [1]), then the following corollary is a special case of Theorem 6.1.

    Corollary 6.1. When the simple base {Q(m)n(x)} of SMPs is of order ρQ(m) and type τQ(m), then the HHDBSMPs {H(i,m)n(x)} will be of order ρH(i,m)ρQ(m) and type τH(i,m)τQ(m) whenever ρH(i,m)=ρQ(m).

    In the following, we determine the TρQ(m)-property of the HHDBs. The authors of [2] deduced TρQ(m)-property of the base {Q(m)n(x)} in Clifford analysis in open hyperball B(R), closed hyperball ¯B(R) and at the origin are defined as follows:

    Definition 6.1 If the base {Q(m)n(x)} represents all ESMFs of order less than ρQ(m) in ¯B(R), B(R) or at the origin, then it is said to have property TρQ(m) in ¯B(R), B(R) or at the origin.

    Let

    ΨQ(m)(R)=lim supn log ΨQ(m)n(R)n log n.

    The following theorem concerning the property TρQ(m) of the base {Q(m)n(x)} (see [2]).

    Theorem 6.2. A base {Q(m)n(x)} to have the property TρQ(m) for all ESMF of order less than ρQ(m) in closed hyperball ¯B(R), open hyperball B(R) or at the origin iff, ΨQ(m)(R)1ρQ(m), ΨQ(m)(r)1ρQ(m) for all r<R or ΨQ(m)(0+)1ρQ(m).

    Next, we construct the TρH(i,m)-property of the HHDBSMPs in the closed hyperball ¯B(R), for R>0.

    Theorem 6.3. Let {Q(m)n(x)} be the base of SMPs have TρQ(m)-property in ¯B(R), where R>0 and for which the condition (2.9) is satisfied. Then the HHDBSMPs {H(i,m)n(x)} have the same property.

    Proof. Suppose that the function ΨH(i,m)(R) given by:

    ΨH(i,m)(R)=lim supn log ΨH(i,m)n(R)n log n, (6.3)

    where ΨH(i,m)n(R) is the Cannon sum of the HHDBSMPs {H(i,m)n(x)}. Then by using (2.9), (5.2) and (6.3), we obtain that

    ΨH(i,m)(R)lim supnlogζDn,i (ζDn,i+1)+log ΨQ(m)n(R)n log nΨQ(m)(R). (6.4)

    Since the base {Q(m)n(x)} has the property TρQ(m) in ¯B(R), R>0. Hence by inequality (6.4) and Theorem 6.2, we have

    ΨH(i,m)(R)ΨQ(m)(R)1ρQ(m),

    and the base {H(i,m)n(x)} has the property TρQ(m) in ¯B(R), R>0.

    The fact that HHDBSMPs {H(i,m)n(x)} does not have the property TρQ(m) in ¯B(R) if the condition (2.9) is not satisfied is illustrated by the following example.

    Example 6.3. Let {Q(m)n(x)} be the base of SMPs, is defined by:

    Q(m)n(x)={Q(m)n(x),n is even,Q(m)n(x)+ Q(m)s(n)(x)2(nn),n is odd,

    where s(n) is the nearest even integer to nlogn+nn.

    When n is odd, we obtain:

    Q(m)n(x)=Q(m)n(x)Q(m)t(n)(x)2(nn).

    Hence,

    ΨQ(m)n(R)=Rn+2Rt(n)2(nn).

    Putting R=2, it follows that

    ΨQ(m)n(2)=2n+2nlogn+1,

    so that

    ΨQ(m)(2)=lim supn log ΨQ(m)n(2)n log nlog2.

    It follows that, the base Q(m)n(x) has the T1log2-property in ¯B(2). The HHDBSMPs {H(i,m)n(x)} is

    H(i,m)n(x)={ζn,iQ(m)ni(x),n is even, ζn,iQ(m)ni(x)+ζt(n),iQ(m)t(n)i(x)2(nn),n is odd.

    Hence, when n is odd, we obtain

    ΨH(i,m)n(R)=Rni+2ζt(n),iζn,i Rt(n)i2(nn),

    so that when R=2,

    ΨH(i,m)n(2)=2ni+2ζt(n),iζn,i 2t(n)i2(nn).

    Thus,

    ΨH(i,m)(2)=lim supn log ΨH(i,m)n(2)n log n1+log2,

    and the HHDBSMPs H(i,m)n(x), does not have the T1log2-property in ¯B(2) as required.

    If the base of SMPs {Q(m)n(x)} is simple base (Dn=n) (see [1]), then the following corollary is a special case of Theorem 6.3.

    Corollary 6.2. When the simple base {Q(m)n(x)} of SMPs have TρQ(m)-property in ¯B(R), R>0. Then the HHDBSMPs {H(i,m)n(x)} is also have the TρQ(m)-property.

    In the following, we deduce that the base {Q(m)n(x)} and the HHDBs {H(i,m)n(x)} have the same TρQ(m) in an open hyperball B(R), where R>0 or at the origin.

    Theorem 6.4. Let {Q(m)n(x)} be a base of SMPs have the TρQ(m)-property in B(R), R>0 or at the origin. Then the HHDBs {H(i,m)n(x)} have the same property.

    Proof. Let {Q(m)n(x)} be have the property TρQ(m) in B(R), R>0, then

    ΨQ(m)(r)1ρQ(m)  r<R. (6.5)

    It follows from (4.2) that

    ΨH(i,m)(r)=lim supn log ΨH(i,m)n(r)nlog nΨQ(m)(r1), (6.6)

    such that r<r1<R. Using (6.5) and (6.6), we have ΨH(i,m)n(r)1ρQ(m) r<R and the base {H(i,m)n(x)} has the property TρQ(m) in an open hyperball B(R), R>0.

    Suppose that the base {Q(m)n(x)} has the property TρQ(m) at the origin, then we get

    ΨQ(m)(o+)1ρQ(m). (6.7)

    Let r10+ in (6.6), then by (6.7), we have

    ΨH(i,m)(o+)ΨQ(m)(o+)1ρQ(m),

    and the base {H(i,m)n(x)} has the property TρQ(m) at the origin.

    The problem of classical special functions can be considered as an application of bases of SMPs. Recently, the authors in [19,33] proved that the proper Bessel SMPs (PBSMPs) {P(m)n(x)} and the general Bessel SMPs (GBSMPs) {G(m)n(x)} are effective for M[¯B(R)]. Furthermore, recently in [34], the authors proved that the Chebyshev SMPs (CSMPs) {Tn(x)} is effective for M[¯B(1)].

    The following results follows directly by applying Theorem 5.1.

    Corollary 7.1. The base of PBSMPs {P(m)n(x)} and the HHD of PBSMPs {P(i,m)n(x)} have the same region of effectiveness for the class M[¯B(R)].

    Corollary 7.2. The base of GBSMPs {G(m)n(x)} and the HHD of GBSMPs {G(i,m)n(x)} have the same region of effectiveness for the class M[¯B(R)].

    Corollary 7.3. The base of CSMPs {Tn(x)} and the HHD of CSMPs {T(i,m)n(x)} have the same region of effectiveness for the class M[¯B(1)].

    In [27] the authors proved that the Bernoulli SMPs (BSMPs) {B(m)n(x)} is of order 1 and type 12π and the Euler SMPs (ESMPs)) {E(m)n(x)} is of order 1 and type 1π.

    According to Theorem 6.1, we obtain the following corollaries:

    Corollary 7.4. The base of BSMPs {B(m)n(x)} and the HHD of BSMPs {B(i,m)n(x)} are of the same order 1 and type 12π.

    Corollary 7.5. The base of ESMPs {B(m)n(x)} and the HHD of ESMPs {B(i,m)n(x)} are of the same order 1 and type 1π.

    Moreover, in [27], the BSMPs {B(m)n(x)} and the ESMPs {E(m)n(x)} have the property T1. According to Theorem 6.3, we conclude directly the following corollary:

    Corollary 7.6. If the BSMPs {B(m)n(x)} and the ESMPs {E(m)n(x)} have the property T1, then the HHD of BSMPs {B(i,m)n(x)} and ESMPs {E(i,m)n(x)} have the same property, respectively.

    Now, suppose that JN(H(i)) is a polynomial of the operator H(i) as given in (3.1) such that

    JN(H(i))=Nj=1λj (H(i))j,  λiCm,

    where (H(i))j=(H(i))j1H(i). Obviously that Theorems 4.1–4.4, 5.1, 6.1, 6.3 and 6.4 will be valid when we replace the base {H(i)Q(m)n(x)} by the base {JN(H(i))Q(m)n(x)}

    Similar results for the generalized hypercomplex Ruscheweyh derivative base {JN(R(i))Q(m)n(x)}, where R(i) is the hypercomplex Ruscheweyh derivative. These results generalize the result in [22].

    This work is mainly devoted to derive a generalized form for the Hasse operator in the Clifford setting. Using the defined operator, we accordingly construct the hypercomplex Hasse derivative bases (HHDBs). The approximation properties (effectiveness, order and type, the Property of TρQ(m)) have been describe for the derived HHDBSMPs in multiple regions in F-modules. Our results are considered as a modified generalization to those given in [8,9,10]. It is clear that that when xC1 in Theorems 4.1–4.4, 5.1, 6.1, 6.3 and 6.4 results obtained by [8,9,10] yield. Additionally considering x to be an element of C2 in Theorems 4.1–4.4, 5.1, 6.1, 6.3 and 6.4, our results coincide with the quaternion analysis H. Our results improve and extend the corresponding ones in the Clifford analysis with regards to the region of effectiveness and the mode of increase of HDB (see [13,14]).

    As a result of the growing interest in fractional calculus and its numerous real-world applications, recent contributions were placed on representing analytic functions in terms of complex conformable fractional derivatives and integral bases in different domains in Fréchet spaces [35]. In [36], the authors investigated uncertain barrier swaption pricing problems based on the fractional differential equation in Caputo sense. Relevantly, the fraction Dirac operator constructed using Caput derivative in the case of Clifford variables were studied in [37]. Furthermore, in [38], the authors introduced a new class of time-fractional Dirac type operators with time-variable coefficients. It will be of great interest in the future to explore the convergence properties of fractional derivative bases in the context of Clifford analysis.

    The authors declare they have not used Artificial Intelligence (AI) tools in the creation of this article.

    The authors extend their appreciation to the Deanship of Scientific Research at King Khalid University for funding this work through large group Research Project under grant number RGP2/429/44.

    The authors declare no conflict of interest to disclose.



    [1] O. F. Mohammad, M. S. M. Rahim, S. R. M. Zeebaree, F. Y. Ahmed, A survey and analysis of the image encryption methods, Int. J. Appl. Eng. Res., 12 (2017), 13265–13280. https://doi.org/10.1007/s13319-017-0148-5 doi: 10.1007/s13319-017-0148-5
    [2] M. Kumar, R. A. M. Lahcen, R. N. Mohapatra, C. Alwala, S. V. K. Kurella, Review of image encryption techniques, J. Comput. Inf. Sci. Eng., 14 (2020), 31–37. https://doi.org/10.9790/0661-2201013137 doi: 10.9790/0661-2201013137
    [3] M. Kaur, S. Singh, M. Kaur, Computational image encryption techniques: A comprehensive review, Math. Probl. Eng., 2021 (2021), 5012496. https://doi.org/10.1155/2021/5012496 doi: 10.1155/2021/5012496
    [4] A. Shafique, A. Mehmood, M. Elhadef, K. H. Khan, A lightweight noise-tolerant encryption scheme for secure communication: an unmanned aerial vehicle application, PLoS One, 17 (2022), e0273661. https://doi.org/10.1371/journal.pone.0273661
    [5] F. Masood, W. Boulila, J. Ahmad, A. Syam Sankar, S. Rubaiee, W. J. Buchanan, A novel privacy approach of digital aerial images based on Mersenne Twister method with DNA genetic encoding and chaos, Remote Sens., 12 (2020), 1893. https://doi.org/10.3390/rs12111893 doi: 10.3390/rs12111893
    [6] M. A. S. Al-Khasawneh, M. Faheem, E. A. Aldhahri, A. Alzahrani, A. A. Alarood, A Map Reduce based approach for secure batch satellite image encryption, IEEE Access, 11 (2023), 62865–62878. https://doi.org/10.1109/access.2023.3279719 doi: 10.1109/access.2023.3279719
    [7] D. Li, S. Zhou, C. He, The application of image encryption method based on chaotic mapping in the field of radar transmitter remote monitor system, Adv. Inf. Manag. Commun. Electron. Autom. Control Conf., 2019,577–580. https://doi.org/10.1109/imcec46724.2019.8983923 doi: 10.1109/imcec46724.2019.8983923
    [8] H. Liu, L. Teng, Y. Zhang, R. Si, P. Liu, Mutil-medical image encryption by a new spatiotemporal chaos model and DNA new computing for information security, Expert Syst. Appl., 235 (2024), 121090. https://doi.org/10.1016/j.eswa.2023.121090 doi: 10.1016/j.eswa.2023.121090
    [9] M. Usama, M. K. Khan, K. Alghathbar, C. Lee, Chaos-based secure satellite imagery cryptosystem, Comput. Math. Appl., 60 (2010), 326–337. https://doi.org/10.1016/j.camwa.2009.12.033 doi: 10.1016/j.camwa.2009.12.033
    [10] S. Kanwal, S. Inam, F. Hajjej, O. Cheikhrouhou, Z. Nawaz, A. Waqar, M. Khan, A new image encryption technique based on sine map, chaotic tent map, and circulant matrices, Sec. Commun. Networks, 2022 (2022), 4152683. https://doi.org/10.1155/2022/4152683 doi: 10.1155/2022/4152683
    [11] S. Kanwal, S. Inam, O. Cheikhrouhou, K. Mahnoor, A. Zaguia, H. Hamam, Analytic study of a novel color image encryption method based on the chaos system and color codes, Complexity, 2021 (2021), 5499538. https://doi.org/10.1155/2021/5499538 doi: 10.1155/2021/5499538
    [12] Y. Nagasree, C. Rupa, P. Akshitha, G. Srivastava, T. R. Gadekallu, K. Lakshmanna, Preserving privacy of classified authentic satellite lane imagery using proxy re-encryption and UAV technologies, Drones, 7 (2023), 53. https://doi.org/10.3390/drones7010053 doi: 10.3390/drones7010053
    [13] Y. Bentoutou, E. H. Bensikaddour, N. Taleb, N. Bounoua, An improved image encryption algorithm for satellite applications, Adv. Space Res., 66 (2020), 176–192. https://doi.org/10.1016/j.asr.2019.09.027 doi: 10.1016/j.asr.2019.09.027
    [14] Q. Lai, L. Yang, G. Hu, Z. H. Guan, H. H. C. Iu, Constructing multiscroll memristive neural network with local activity memristor and application in image encryption, IEEE Trans. Cybernetics, 54 (2024), 4039–4048. https://doi.org/10.1109/tcyb.2024.3377011 doi: 10.1109/tcyb.2024.3377011
    [15] Q. Lai, L. Yang, G. Chen, Design and performance analysis of discrete memristive hyperchaotic systems with stuffed cube attractors and ultraboosting behaviors, IEEE Trans. Ind. Electron., 71 (2024), 7819–7828. https://doi.org/10.1109/tie.2023.3299016
    [16] Q. Lai, G. Hu, A nonuniform pixel split encryption scheme integrated with compressive sensing and its application in IoMT, IEEE Trans. Ind. Informat., 20 (2024), 11262–11272. https://doi.org/10.1109/tii.2024.3403266 doi: 10.1109/tii.2024.3403266
    [17] Q. Lai, L. Yang, G. Chen, Two-dimensional discrete memristive oscillatory hyperchaotic maps with diverse dynamics, IEEE Trans. Ind. Electron. https://doi.org/10.1109/tie.2024.3417974
    [18] Belmouhoub, M. Djemai, J. P. Barbot, Cryptography by discrete-time hyperchaotic systems, In Proceedings of the IEEE Conference on Decision and Control, 2 (2004), 1902–1907. https://doi.org/10.1109/cdc.2003.1272893 doi: 10.1109/cdc.2003.1272893
    [19] H. Liu, A. Kadir, J. Liu, Colorpathological image encryption algorithm using arithmetic over Galois field and coupled hyperchaotic system, Opt. Lasers Eng., 122 (2019), 123–133. https://doi.org/10.1016/j.optlaseng.2019.05.027 doi: 10.1016/j.optlaseng.2019.05.027
    [20] S. Kanwal, S. Inam, M. Othman, A. Waqar, M. Ibrahim, F. Nawaz, et al., An effective color image encryption based on Henon map, tent chaotic map, and orthogonal matrices, Sensors, 22 (2022). https://doi.org/10.3390/s22124359
    [21] Q. Liang, C. Zhu, A new one-dimensional chaotic map for image encryption scheme based on random DNA coding, Opt. Laser Technol., 160 (2022), 109033. https://doi.org/10.1016/j.optlastec.2022.109033 doi: 10.1016/j.optlastec.2022.109033
    [22] S. Benaissi, N. Chikouche, R. Hamza, A novel image encryption algorithm based on hybrid chaotic maps using a key image, Optik, 272 (2022), 170316. https://doi.org/10.1016/j.ijleo.2022.170316 doi: 10.1016/j.ijleo.2022.170316
    [23] W. Alexan, M. ElBeltagy, A. Aboshousha, RGB image encryption through cellular automata, S-Box and the Lorenz system, Symmetry, 14 (2022), 443. https://doi.org/10.3390/sym14030443
    [24] M. SaberiKamarposhti, A. Ghorbani, M. Yadollahi, A comprehensive survey on image encryption: Taxonomy, challenges, and future directions, Chaos Solitons Fract., 178 (2024), 114361. https://doi.org/10.1016/j.chaos.2023.114361
    [25] C. Chen, K. Sun, Q. Xu, A color image encryption algorithm based on 2D-CIMM chaotic map, China Commun., 17 (2020), 12–20 https://doi.org/10.23919/jcc.2020.05.002 doi: 10.23919/jcc.2020.05.002
    [26] T. Li, D. Zhang, Hyperchaotic image encryption based on multiple bit permutation and diffusion, Entropy, 23 (2021), 510. https://doi.org/10.3390/e23050510 doi: 10.3390/e23050510
    [27] H. Liu, J. Liu, C. Ma, Constructing dynamic strong S-Box using 3D chaotic map and application to image encryption, Multimedia Tools Appl., 82 (2022), 23899–23914. https://doi.org/10.1007/s11042-022-12069-x doi: 10.1007/s11042-022-12069-x
    [28] P. Liu, X. Wang, Y. Su, Image encryption via complementary embedding algorithm and new spatiotemporal chaotic system, IEEE Trans. Circuits Syst. Video Technol., 33 (2023), 2506–2519. https://doi.org/10.1109/TCSVT.2022.3222559 doi: 10.1109/TCSVT.2022.3222559
  • This article has been cited by:

    1. Mohra Zayed, Gamal Hassan, Kronecker product bases and their applications in approximation theory, 2025, 33, 2688-1594, 1070, 10.3934/era.2025048
  • Reader Comments
  • © 2024 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(569) PDF downloads(51) Cited by(0)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog