In recent times, the research community has shown interest in information security due to the increasing usage of internet-based mobile and web applications. This research presents a novel approach to constructing the nonlinear component or Substitution Box (S-box) of block ciphers by employing coset graphs over the Galois field. Cryptographic techniques are employed to enhance data security and address current security concerns and obstacles with ease. Nonlinear component is a keystone of cryptography that hides the association between plaintext and cipher-text. Cryptographic strength of nonlinear component is directly proportional to the data security provided by the cipher. This research aims to develop a novel approach for construction of dynamic S-boxes or nonlinear components by employing special linear group PSL(2,Z) over the Galois Field GF(210). The vertices of coset diagram belong to GF(210) and can be expressed as powers of α, where α represents the root of an irreducible polynomial p(x)=x10+x3+1. We constructed several nonlinear components by using GF∗(210). Furthermore, we have introduced an exceptionally effective algorithm for optimizing nonlinearity, which significantly enhances the cryptographic properties of the nonlinear component. This algorithm leverages advanced techniques to systematically search for and select optimal S-box designs that exhibit improved resistance against various cryptographic attacks.
Citation: Adil Waheed, Fazli Subhan, Mazliham Mohd Suud, Muhammad Yasir Hayat Malik, Alina Mirza, Farkhanda Afzal. Construction of nonlinear component of block cipher using coset graph[J]. AIMS Mathematics, 2023, 8(9): 21644-21667. doi: 10.3934/math.20231104
[1] | Muhammad Qiyas, Muhammad Naeem, Neelam Khan . Fractional orthotriple fuzzy Choquet-Frank aggregation operators and their application in optimal selection for EEG of depression patients. AIMS Mathematics, 2023, 8(3): 6323-6355. doi: 10.3934/math.2023320 |
[2] | Muhammad Naeem, Muhammad Qiyas, Lazim Abdullah, Neelam Khan . Correction: Sine hyperbolic fractional orthotriple linear Diophantine fuzzy aggregation operator and its application in decision making. AIMS Mathematics, 2024, 9(12): 33493-33494. doi: 10.3934/math.20241598 |
[3] | Hanan Alohali, Muhammad Bilal Khan, Jorge E. Macías-Díaz, Fahad Sikander . On (p,q)-fractional linear Diophantine fuzzy sets and their applications via MADM approach. AIMS Mathematics, 2024, 9(12): 35503-35532. doi: 10.3934/math.20241685 |
[4] | Ashraf Al-Quran . T-spherical linear Diophantine fuzzy aggregation operators for multiple attribute decision-making. AIMS Mathematics, 2023, 8(5): 12257-12286. doi: 10.3934/math.2023618 |
[5] | Shahzaib Ashraf, Huzaira Razzaque, Muhammad Naeem, Thongchai Botmart . Spherical q-linear Diophantine fuzzy aggregation information: Application in decision support systems. AIMS Mathematics, 2023, 8(3): 6651-6681. doi: 10.3934/math.2023337 |
[6] | Sohail Ahmad, Ponam Basharat, Saleem Abdullah, Thongchai Botmart, Anuwat Jirawattanapanit . MABAC under non-linear diophantine fuzzy numbers: A new approach for emergency decision support systems. AIMS Mathematics, 2022, 7(10): 17699-17736. doi: 10.3934/math.2022975 |
[7] | Muhammad Danish Zia, Esmail Hassan Abdullatif Al-Sabri, Faisal Yousafzai, Murad-ul-Islam Khan, Rashad Ismail, Mohammed M. Khalaf . A study of quadratic Diophantine fuzzy sets with structural properties and their application in face mask detection during COVID-19. AIMS Mathematics, 2023, 8(6): 14449-14474. doi: 10.3934/math.2023738 |
[8] | Muhammad Zeeshan Hanif, Naveed Yaqoob, Muhammad Riaz, Muhammad Aslam . Linear Diophantine fuzzy graphs with new decision-making approach. AIMS Mathematics, 2022, 7(8): 14532-14556. doi: 10.3934/math.2022801 |
[9] | Anam Habib, Zareen A. Khan, Nimra Jamil, Muhammad Riaz . A decision-making strategy to combat CO2 emissions using sine trigonometric aggregation operators with cubic bipolar fuzzy input. AIMS Mathematics, 2023, 8(7): 15092-15128. doi: 10.3934/math.2023771 |
[10] | Salma Iqbal, Naveed Yaqoob . Ranking of linear Diophantine fuzzy numbers using circumcenter of centroids. AIMS Mathematics, 2023, 8(4): 9840-9861. doi: 10.3934/math.2023497 |
In recent times, the research community has shown interest in information security due to the increasing usage of internet-based mobile and web applications. This research presents a novel approach to constructing the nonlinear component or Substitution Box (S-box) of block ciphers by employing coset graphs over the Galois field. Cryptographic techniques are employed to enhance data security and address current security concerns and obstacles with ease. Nonlinear component is a keystone of cryptography that hides the association between plaintext and cipher-text. Cryptographic strength of nonlinear component is directly proportional to the data security provided by the cipher. This research aims to develop a novel approach for construction of dynamic S-boxes or nonlinear components by employing special linear group PSL(2,Z) over the Galois Field GF(210). The vertices of coset diagram belong to GF(210) and can be expressed as powers of α, where α represents the root of an irreducible polynomial p(x)=x10+x3+1. We constructed several nonlinear components by using GF∗(210). Furthermore, we have introduced an exceptionally effective algorithm for optimizing nonlinearity, which significantly enhances the cryptographic properties of the nonlinear component. This algorithm leverages advanced techniques to systematically search for and select optimal S-box designs that exhibit improved resistance against various cryptographic attacks.
In his survey-cum-expository review article, Srivastava [1] presented and motivated about brief expository overview of the classical q -analysis versus the so-called (p,q)-analysis with an obviously redundant additional parameter p. We also briefly consider several other families of such extensively and widely-investigated linear convolution operators as (for example) the Dziok-Srivastava, Srivastava-Wright and Srivastava-Attiya linear convolution operators, together with their extended and generalized versions. The theory of (p,q)-analysis has important role in many areas of mathematics and physics. Our usages here of the q-calculus and the fractional q-calculus in geometric function theory of complex analysis are believed to encourage and motivate significant further developments on these and other related topics (see Srivastava and Karlsson [2,pp. 350-351], Srivastava [3,4]). Our main objective in this survey-cum-expository article is based chiefly upon the fact that the recent and future usages of the classical q-calculus and the fractional q-calculus in geometric function theory of complex analysis have the potential to encourage and motivate significant further researches on many of these and other related subjects. Jackson [5,6] was the first that gave some application of q -calculus and introduced the q-analogue of derivative and integral operator (see also [7,8]), we apply the concept of q -convolution in order to introduce and study the general Taylor-Maclaurin coefficient estimates for functions belonging to a new class of normalized analytic in the open unit disk, which we have defined here.
Let A denote the class of analytic functions of the form
f(z):=z+∞∑m=2amzm,z∈Δ:={z∈C:|z|<1} | (1.1) |
and let S⊂A consisting on functions that are univalent in Δ. If the function h∈A is given by
h(z):=z+∞∑m=2bmzm,(z∈Δ). | (1.2) |
The Hadamard product (or convolution) of f and h, given by (1.1) and (1.2), respectively, is defined by
(f∗h)(z):=z+∞∑m=2ambmzm,z∈Δ. | (1.3) |
If f and F are analytic functions in Δ, we say that f is subordinate to F, written as f(z)≺F(z), if there exists a Schwarz function s, which is analytic in Δ, with s(0)=0, and |s(z)|<1 for all z∈Δ, such that f(z)=F(s(z)), z∈Δ. Furthermore, if the function F is univalent in Δ, then we have the following equivalence ([9,10])
f(z)≺F(z)⇔f(0)=F(0)andf(Δ)⊂F(Δ). |
The Koebe one-quarter theorem (see [11]) prove that the image of Δ under every univalent function f∈S contains the disk of radius 14. Therefore, every function f∈S has an inverse f−1 that satisfies
f(f−1(w))=w,(|w|<r0(f),r0(f)≥14), |
where
g(w)=f−1(w)=w−a2w2+(2a22−a3)w3−(5a32−5a2a3+a4)w4+⋯.=w+∞∑m=2Amwm |
A function f∈A is said to be bi-univalent in Δ if both f and f−1 are univalent in Δ. Let Σ represent the class of bi-univalent functions in Δ given by (1.1). The class of analytic bi-univalent functions was first familiarised by Lewin [12], where it was shown that |a2|<1.51. Brannan and Clunie [13] enhanced Lewin's result to |a2|<√2 and later Netanyahu [14] proved that |a2|<43.
Note that the functions
f1(z)=z1−z,f2(z)=12log1+z1−z,f3(z)=−log(1−z) |
with their corresponding inverses
f−11(w)=w1+w,f−12(w)=e2w−1e2w+1,f−13(w)=ew−1ew |
are elements of Σ (see [15,16]). For a brief history and exciting examples in the class Σ (see [17]). Brannan and Taha [18] (see also [16]) presented certain subclasses of the bi-univalent functions class Σ similar to the familiar subclasses S∗(α) and K(α) of starlike and convex functions of order α (0≤α<1), respectively (see [17,19,20]). Ensuing Brannan and Taha [18], a function f∈A is said to be in the class S∗Σ(α) of bi-starlike functions of order α (0<α≤1), if each of the following conditions are satisfied:
f∈Σ,with|argzf′(z)f(z)|<απ2(z∈Δ), |
and
|argwg′(w)g(w)|<απ2(w∈Δ), |
where the function g is the analytic extension of f−1 to Δ, given by
g(w)=w−a2w2+(2a22−a3)w3−(5a32−5a2a3+a4)w4+⋯(w∈Δ). | (1.4) |
A function f∈A is said to be in the class KΣ(α) of bi-convex functions of order α (0<α≤1), if each of the following conditions are satisfied:
f∈Σ,with|arg(1+zf′′(z)f′(z))|<απ2(z∈Δ), |
and
|arg(1+wg′′(w)g′(w))|<απ2(w∈Δ). |
The classes S∗Σ(α) and KΣ(α) of bi-starlike functions of order α and bi-convex functions of order α (0<α≤1), corresponding to the function classes S∗(α) and K(α), were also introduced analogously. For each of the function classes S∗Σ(α) and KΣ(α), they found non-sharp estimates on the first two Taylor-Maclaurin coefficients |a2| and |a3| ([16,18]).
The Faber polynomials introduced by Faber [21] play an important role in various areas of mathematical sciences, especially in Geometric Function Theory of Complex Analysis (see, for details, [22]). In 2013, Hamidi and Jahangiri [23,24,25] took a new approach to show that the initial coefficients of classes of bi- starlike functions e as well as provide an estimate for the general coefficients of such functions subject to a given gap series condition.Recently, their idea of application of Faber polynomials triggered a number of related publications by several authors (see, for example, [26,27,28] and also references cited threin) investigated some interesting and useful properties for analytic functions. Using the Faber polynomial expansion of functions f∈A has the form (1.1), the coefficients of its inverse map may be expressed as
g(w)=f−1(w)=w+∞∑m=21mK−mm−1(a2,a3,...)wm, | (1.5) |
where
K−mm−1(a2,a3,...)=(−m)!(−2m+1)!(m−1)!am−12+(−m)!(2(−m+1))!(m−3)!am−32a3+(−m)!(−2m+3)!(m−4)!am−42a4+(−m)!(2(−m+2))!(m−5)!am−52[a5+(−m+2)a23]+(−m)!(−2m+5)!(m−6)!am−62[a6+(−2m+5)a3a4]+∑i≥7am−i2Ui, | (1.6) |
such that Ui with 7≤i≤m is a homogeneous polynomial in the variables a2,a3,...,am, In particular, the first three terms of K−mm−1 are
K−21=−2a2,K−32=3(2a22−a3),K−43=−4(5a32−5a2a3+a4). |
In general, an expansion of K−nm (n∈N) is (see [29,30,31,32,33])
K−nm=nam+n(n−1)2D2m+n!3!(n−3)!D3m+...+n!m!(n−m)!Dmm, |
where Dnm=Dnm(a2,a3,...) and
Dpm(a1,a2,...am)=∞∑m=1p!i1!...im!ai11...aimm, |
while a1=1 and the sum is taken over all non-negative integers i1...im satisfying
i1+i2+...+im=pi1+2i2+...+mim=m. |
Evidently
Dmm(a1,a2,...am)=am1. |
Srivastava [1] made use of several operators of q-calculus and fractional q-calculus and recollecting the definition and representations. The q-shifted factorial is defined for κ,q∈C and n∈N0=N∪{0} as follows
(κ;q)m={1,m=0(1−κ)(1−κq)…(1−κqk−1),m∈N. |
By using the q-Gamma function Γq(z), we get
(qκ;q)m=(1−q)m Γq(κ+m)Γq(κ)(m∈N0), |
where (see [34])
Γq(z)=(1−q)1−z(q;q)∞(qz;q)∞(|q|<1). |
Also, we note that
(κ;q)∞=∞∏m=0(1−κqm)(|q|<1), |
and, the q-Gamma function Γq(z) is known
Γq(z+1)=[z]q Γq(z), |
where [m]q symbolizes the basic q-number defined as follows
[m]q:={1−qm1−q,m∈C1+m−1∑j=1qj,m∈N. | (1.7) |
Using the definition formula (1.7) we have the next two products:
(i) For any non-negative integer m, the q-shifted factorial is given by
[m]q!:={1,ifm=0,m∏n=1[n]q, ifm∈N. |
(ii) For any positive number r, the q-generalized Pochhammer symbol is defined by
[r]q,m:={1,ifm=0,r+m−1∏n=r[n]q,ifm∈N. |
It is known in terms of the classical (Euler's) Gamma function Γ(z), that
Γq(z)→Γ(z) asq→1−. |
Also, we observe that
limq→1−{(qκ;q)m(1−q)m}=(κ)m, |
where (κ)m is the familiar Pochhammer symbol defined by
(κ)m={1,ifm=0,κ(κ+1)...(κ+m−1),ifm∈N. |
For 0<q<1, the q-derivative operator (or, equivalently, the q- difference operator) El-Deeb et al. [35] defined Dq for f∗h given by (1.3) is defined by (see [5,6])
Dq(f∗h)(z):=Dq(z+∞∑m=2ambmzm)=(f∗h)(z)−(f∗h)(qz)z(1−q)=1+∞∑m=2[m]qambmzm−1(z∈Δ), |
where, as in the definition (1.7)
[m]q:={1−qm1−q=1+m−1∑j=1qj (m∈N),0 (m=0). | (1.8) |
For κ>−1 and 0<q<1, El-Deeb et al. [35] (see also) defined the linear operator Hκ,qh:A→A by
Hκ,qhf(z)∗Mq,κ+1(z)=zDq(f∗h)(z)(z∈Δ), |
where the function Mq,κ+1 is given by
Mq,κ+1(z):=z+∞∑m=2[κ+1]q,m−1[m−1]q!zm(z∈Δ). |
A simple computation shows that
Hκ,qhf(z):=z+∞∑m=2[m]q![κ+1]q,m−1ambm zm(κ>−1,0<q<1, z∈Δ). | (1.9) |
From the definition relation (1.9), we can easily verify that the next relations hold for all f∈A:
(i) [κ+1]qHκ,qhf(z)=[κ]qHκ+1,qhf(z)+qκz Dq(Hκ+1,qhf(z))(z∈Δ);(ii)Iκhf(z):=limq→1−Hκ,qhf(z)=z+∞∑m=2m!(κ+1)m−1ambmzm(z∈Δ). | (1.10) |
Remark 1. Taking precise cases for the coefficients bm we attain the next special cases for the operator Hκ,qh:
(ⅰ) For bm=1, we obtain the operator Iκq defined by Srivastava [32] and Arif et al. [36] as follows
Iκqf(z):=z+∞∑m=2[m]q![κ+1]q,m−1amzm(κ>−1,0<q<1, z∈Δ); | (1.11) |
(ⅱ) For bm=(−1)m−1Γ(υ+1)4m−1(m−1)!Γ(m+υ), υ>0, we obtain the operator Nκυ,q defined by El-Deeb and Bulboacă [37] and El-Deeb [38] as follows
Nκυ,qf(z):=z+∞∑m=2(−1)m−1Γ(υ+1)4m−1(m−1)!Γ(m+υ)⋅[m]q![κ+1]q,m−1amzm=z+∞∑m=2[m]q![κ+1]q,m−1ψmamzm(υ>0,κ>−1,0<q<1, z∈Δ), | (1.12) |
where
ψm:=(−1)m−1Γ(υ+1)4m−1(m−1)!Γ(m+υ); | (1.13) |
(ⅲ) For bm=(n+1n+m)α, α>0, n≥0, we obtain the operator Mκ,αn,q defined by El-Deeb and Bulboacă [39] and Srivastava and El-Deeb [40] as follows
Mκ,αn,qf(z):=z+∞∑m=2(n+1n+m)α⋅[m]q![κ+1]q,m−1amzm(z∈Δ); | (1.14) |
(ⅳ) For bm=ρm−1(m−1)!e−ρ, ρ>0, we obtain the q-analogue of Poisson operator defined by El-Deeb et al. [35] (see [41]) as follows
Iκ,ρqf(z):=z+∞∑m=2ρm−1(m−1)!e−ρ⋅[m]q![κ+1]q,m−1amzm(z∈Δ). | (1.15) |
(ⅴ) For bm=[1+ℓ+μ(m−1)1+ℓ]n, n∈Z, ℓ≥0, μ≥0, we obtain the q-analogue of Prajapat operator defined by El-Deeb et al. [35] (see also [42]) as follows
Jκ,nq,ℓ,μf(z):=z+∞∑m=2[1+ℓ+μ(m−1)1+ℓ]n⋅[m,q]![κ+1,q]m−1amzm(z∈Δ); | (1.16) |
(ⅵ) For bm=(n+m−2m−1)θm−1(1−θ)n n∈N, 0≤θ≤1, we obtain the q-analogue of the Pascal distribution operator defined by Srivastava and El-Deeb [28] (see also [35,43,44]) as follows
⊖κ,nq,θf(z):=z+∞∑m=2(n+m−2m−1)θm−1(1−θ)n⋅[m,q]![κ+1,q]m−1amzm(z∈Δ). | (1.17) |
The purpose of the paper is to present a new subclass of functions Lq,κΣ(η;h;Φ) of the class Σ, that generalize the previous defined classes. This subclass is defined with the aid of a general Hκ,qh linear operator defined by convolution products composed with the aid of q-derivative operator. This new class extend and generalize many preceding operators as it was presented in Remark 1, and the main goal of the paper is find estimates on the coefficients |a2|, |a3|, and for the Fekete-Szegö functional for functions in these new subclasses. These classes will be introduced by using the subordination and the results are obtained by employing the techniques used earlier by Srivastava et al. [16]. This last work represents one of the most important study of the bi-univalent functions, and inspired many investigations in this area including the present paper, while many other recent papers deals with problems initiated in this work, like [33,44,45,46,47,48], and many others. Inspired by the work of Silverman and Silvia [49] (also see[50]) and recent study by Srivastava et al [51], in this article, we define the following new subclass of bi-univalent functions Mq,κΣ(ϖ,ϑ,h) as follows:
Definition 1. Let ϖ∈(−π,π] and let the function f∈Σ be of the form (1.1) and h is given by (1.2), the function f is said to be in the class Mq,κΣ(ϖ,ϑ,h) if the following conditions are satisfied:
ℜ((Hκ,qhf(z))′+(1+eiϖ)2z(Hκ,qhf(z))′′)>ϑ, | (1.18) |
and
ℜ((Hκ,qhg(w))′+(1+eiϖ)2w(Hκ,qhg(w))′′)>ϑ | (1.19) |
with κ>−1, 0<q<1, 0≤ϑ<1 and z,w∈Δ, where the function g is the analytic extension of f−1 to Δ, and is given by (1.4).
Definition 2. Let ϖ=0 and let the function f∈Σ be of the form (1.1) and h is given by (1.2), the function f is said to be in the class Mq,κΣ(ϑ,h) if the following conditions are satisfied:
ℜ((Hκ,qhf(z))′+z(Hκ,qhf(z))′′)>ϑ, | (1.20) |
and
ℜ((Hκ,qhg(w))′+w(Hκ,qhg(w))′′)>ϑ | (1.21) |
with κ>−1, 0<q<1, 0≤ϑ<1 and z,w∈Δ, where the function g is the analytic extension of f−1 to Δ, and is given by (1.4).
Definition 3. Let ϖ=π and let the function f∈Σ be of the form (1.1) and h is given by (1.2), the function f is said to be in the class HMq,κΣ(ϑ,h) if the following conditions are satisfied:
ℜ((Hκ,qhf(z))′)>ϑandℜ((Hκ,qhg(w))′)>ϑ | (1.22) |
with κ>−1, 0<q<1, 0≤ϑ<1 and z,w∈Δ, where the function g is the analytic extension of f−1 to Δ, and is given by (1.4).
Remark 2. (ⅰ) Putting q→1− we obtain that limq→1−Mq,κΣ(ϖ,ϑ;h)=:GκΣ(ϖ,ϑ;h), where GκΣ(ϖ,ϑ;h) represents the functions f∈Σ that satisfy (1.18) and (1.19) for Hκ,qh replaced with Iκh (1.10).
(ⅱ) Fixing bm=(−1)m−1Γ(υ+1)4m−1(m−1)!Γ(m+υ), υ>0, we obtain the class Bq,κΣ(ϖ,ϑ,υ), that represents the functions f∈Σ that satisfy (1.18) and (1.19) for Hκ,qh replaced with Nκυ,q (1.12).
(ⅲ) Taking bm=(n+1n+m)α, α>0, n≥0, we obtain the class Lq,κΣ(ϖ,ϑ,n,α), that represents the functions f∈Σ that satisfy (1.18) and (1.19) for Hκ,qh replaced with Mκ,αn,q (1.14).
(ⅳ) Fixing bm=ρm−1(m−1)!e−ρ, ρ>0, we obtain the class Mq,κΣ(ϖ,ϑ,ρ), that represents the functions f∈Σ that satisfy (1.18) and (1.19) for Hκ,qh replaced with Iκ,ρq (1.15).
(ⅴ) Choosing bm=[1+ℓ+μ(m−1)1+ℓ]n, n∈Z, ℓ≥0, μ≥0, we obtain the class Mq,κΣ(ϖ,ϑ,n,ℓ,μ), that represents the functions f∈Σ that satisfy (1.18) and (1.19) for Hκ,qh replaced with Jκ,nq,ℓ,μ (1.16).
Throughout this paper, we assume that
ϖ∈(−π;π],κ>−1,0≤ϑ<1,0<q<1. |
Recall the following Lemma which will be needed to prove our results.
Lemma 1. (Caratheodory Lemma [11]) If ϕ∈P and ϕ(z)=1+∑∞n=1cnzn then |cn|≤2 for each n, this inequality is sharp for all n where P is the family of all functions ϕ analytic and having positive real part in Δ with ϕ(0)=1.
We firstly introduce a bound for the general coefficients of functions belong to the class Mq,κΣ(ϖ,ϑ;h).
Theorem 2. Let the function f given by (1.1) belongs to the class Mq,κΣ(ϖ,ϑ;h). If ak=0 for 2≤k≤m−1, then
|am|≤4(1−ϑ)[κ+1,q]m−1m|2+(1+eiϖ)(m−1)| [m,q]!bm. |
Proof. If f∈Mq,κΣ(ϖ,ϑ;h), from (1.18), (1.19), we have
((Hκ,qhf(z))′+(1+eiϖ)2z(Hκ,qhf(z))′′)=1+∞∑m=2m2[2+(1+eiϖ)(m−1)][m,q]![κ+1,q]m−1bmamzm−1(z∈Δ), | (2.1) |
and
((Hκ,qhg(w))′+(1+eiϖ)2z(Hκ,qhg(w))′′)=1+∞∑m=2m2[2+(1+eiϖ)(m−1)][m,q]![κ+1,q]m−1bm Amwm−1 |
=1+∞∑m=2m2[2+(1+eiϖ)(m−1)][m,q]![κ+1,q]m−1bm 1mK−mm−1(a2,...,am)wm−1(w∈Δ). | (2.2) |
Since
f∈Mq,κΣ(ϖ,ϑ;h) and g=f−1∈Mq,κΣ(γ,η,ϑ;h), |
we know that there are two positive real part functions:
U(z)=1+∞∑m=1cmzm, |
and
V(w)=1+∞∑m=1dmwm, |
where
ℜ(U(z))>0and ℜ(V(w))>0(z,w∈Δ), |
so that
(Hκ,qhf(z))′+(1+eiθ)2z(Hκ,qhf(z))′′=ϑ+(1−ϑ)U(z) |
=1+(1−ϑ)∞∑m=1cmzm, | (2.3) |
and
(Hκ,qhg(w))′+(1+eiθ)2z(Hκ,qhg(w))′′=ϑ+(1−ϑ)V(w) |
=1+(1−ϑ)∞∑m=1dmwm. | (2.4) |
Using (2.1) and comparing the corresponding coefficients in (2.3), we obtain
m2[2+(1+eiϖ)(m−1)][m,q]![κ+1,q]m−1bmam=(1−ϑ)cm−1, | (2.5) |
and similarly, by using (2.2) in the equality (2.4), we have
m2[2+(1+eiϖ)(m−1)][m,q]![κ+1,q]m−1bm1mK−mm−1(a2,a3,...am)=(1−ϑ)dm−1, | (2.6) |
under the assumption ak=0 for 0≤k≤m−1, we obtain Am=−am and so
m2[2+(1+eiϖ)(m−1)][m,q]![κ+1,q]m−1bmam=(1−ϑ)cm−1, | (2.7) |
and
−m2[2+(1+eiϖ)(m−1)][m,q]![κ+1,q]m−1bmam=(1−ϑ)dm−1, | (2.8) |
Taking the absolute values of (2.7) and (2.8), we conclude that
|am|=|2(1−ϑ)[κ+1,q]m−1cm−1m[2+(1+eiϖ)(m−1)] [m,q]!bm|=|−2(1−ϑ)[κ+1,q]m−1dm−1m[2+(1+eiϖ)(m−1)] [m,q]!bm|. |
Applying the Caratheodory Lemma 1, we obtain
|am|≤4(1−ϑ)[κ+1,q]m−1m|2+(1+eiϖ)(m−1)| [m,q]!bm, |
which completes the proof of Theorem.
Theorem 3. Let the function f given by (1.1) belongs to the class Mq,κΣ(ϖ,ϑ;h), then
|a2|≤{2(1−ϑ)[κ+1,q]|3+eiϖ|[2,q]!b2,0≤ϑ<1−|3+eiϖ|2 ([2,q]!)2[κ+2,q]b223|2+eiϖ| [3,q]![κ+1,q]b3√2(1−ϑ)[κ+1,q]23|2+eiϖ| [3,q]!b3,1−|3+eiϖ|2 ([2,q]!)2[κ+2,q]b223|2+eiϖ| [3,q]![κ+1,q]b3≤ϑ<1, | (2.9) |
|a3|≤2(1−ϑ)[κ+1,q]23|2+eiϖ|[3,q]!b3, | (2.10) |
and
|a3−2a22|≤2(1−ϑ)[κ+1,q]23|2+eiϖ| [3,q]!b3. | (2.11) |
Proof. Fixing m=2 and m=3 in (2.5), (2.6), we have
(3+eiϖ) [2,q]![κ+1,q]b2a2=(1−ϑ)c1, | (2.12) |
3(2+eiϖ) [3,q]![κ+1,q]2b3a3=(1−ϑ)c2, | (2.13) |
−(3+eiϖ) [2,q]![κ+1,q]b2a2=(1−ϑ)d1, | (2.14) |
and
−3(2+eiϖ) [3,q]![κ+1,q]2b3(2a22−a3)=(1−ϑ)d2. | (2.15) |
From (2.12) and (2.14), by using the Caratheodory Lemma1, we obtain
|a2|=(1−ϑ)[κ+1,q]|c1||3+eiϖ|[2,q]!b2=(1−ϑ)[κ+1,q]|d1||3+eiϖ|[2,q]!b2≤2(1−ϑ)[κ+1,q]|3+eiϖ|[2,q]!b2. | (2.16) |
Also, from (2.13) and (2.15), we have
6(2+eiϖ) [3,q]![κ+1,q]2b3a22=(1−ϑ)(c2+d2), |
a22=(1−ϑ)[κ+1,q]26(2+eiϖ)[3,q]!b3(c2+d2), | (2.17) |
and by using the Caratheodory Lemma 1, we obtain
|a2|≤√2(1−ϑ)[κ+1,q]23|2+eiϖ| [3,q]!b3. | (2.18) |
From (2.16) and (2.18), we obtain the desired estimate on the coefficient as asserted in (2.9).
To find the bound on the coefficient |a3|, we subtract (2.15) from (2.13). we get
6(2+eiϖ) [3,q]![κ+1,q]2b3(a3−a22)=(1−ϑ)(c2−d2), |
or
a3=a22+(1−ϑ)(c2−d2)[κ+1,q]26(2+eiϖ)[3,q]!b3, | (2.19) |
substituting the value of a22 from (2.12) into (2.19), we obtain
a3=(1−ϑ)2[κ+1,q]2c21(3+eiϖ)2([2,q]!)2b22+(1−ϑ)(c2−d2)[κ+1,q]26(2+eiϖ)[3,q]!b3. |
Using the Caratheodory Lemma 1, we find that
|a3|≤4(1−ϑ)2[κ+1,q]2|3+eiϖ|2([2,q]!)2b22+2(1−ϑ)[κ+1,q]23|2+eiϖ|[3,q]!b3, | (2.20) |
and from (2.13), we have
a3=(1−ϑ)[κ+1,q]2 c23(2+eiϖ)[3,q]!b3. |
Appling the Caratheodory Lemma 1, we obtain
|a3|≤2(1−ϑ)[κ+1,q]23|2+eiϖ|[3,q]!b3. | (2.21) |
Combining (2.20) and (2.21), we have the desired estimate on the coefficient \left\vert a_{3}\right\vert as asserted in (2.10).
Finally, from (2.15), we deduce that
\begin{equation*} \left\vert a_{3}-2a_{2}^{2}\right\vert\leq\frac{\left( 1-\vartheta \right) [\kappa +1, q]_{2}\left\vert d_{2}\right\vert }{3\left| 2+e^{i\varpi} \right| \ [3, q]!\, b_{3}} = \frac{2\left( 1-\vartheta \right) [\kappa +1, q]_{2} }{3\left| 2+e^{i\varpi} \right| \ [3, q]!\, b_{3}}. \end{equation*} |
Thus the proof of Theorem 3 was completed.
Fekete and Szegö [52] introduced the generalized functional |a_{3}-\aleph a_{2}^{2}|, where \aleph is some real number. Due to Zaprawa [53], (also see [54]) in the following theorem we determine the Fekete-Szegö functional for f\in \mathcal{M}_{\Sigma }^{q, \kappa }\left(\varpi, \vartheta; h\right) .
Theorem 4. Let the function f given by (1.1) belongs to the class \mathcal{M}_{\Sigma }^{q, \kappa }\left(\varpi, \vartheta; h\right) and \aleph\in\mathbb{R} . Then we have
\begin{equation*} |a_{3}-\aleph a_{2}^{2}|\leq\left(\frac{\left( 1-\vartheta \right)[\kappa +1, q]_{2}}{3\left| 2+e^{i\varpi}\right|[3, q]!\, b_{3}}\right)\{|2-\aleph|+|\aleph|\}. \end{equation*} |
Proof. From (2.17) and (2.19)we obtain
\begin{eqnarray*} a_{3}-\aleph a_{2}^{2}& = &\frac{(1-\aleph)\left( 1-\vartheta \right)[\kappa +1, q]_{2}}{6\left( 2+e^{i\varpi}\right)[3, q]!\, b_{3}} \left( c_{2}+d_{2}\right) \\&+&\frac{\left( 1-\vartheta \right)[\kappa +1, q]_{2}}{6\left( 2+e^{i\varpi}\right) [3, q]!b_{3}} \left( c_{2}-d_{2}\right), \\ & = &\left(\frac{\left( 1-\vartheta \right)[\kappa +1, q]_{2}}{6\left( 2+e^{i\varpi}\right)[3, q]!\, b_{3}}\right)\{[(1-\aleph)+1] c_{2}+[(1-\aleph)-1]d_2\}. \end{eqnarray*} |
So we have
\begin{equation} a_{3}-\aleph a_{2}^{2} = \left(\frac{\left( 1-\vartheta \right)[\kappa +1, q]_{2}}{6\left( 2+e^{i\varpi}\right)[3, q]!\, b_{3}}\right)\{(2-\aleph)c_2+(-\aleph)d_2\}. \end{equation} | (3.1) |
Then, by taking modulus of (3.1), we conclude that
\begin{equation*} |a_{3}-\aleph a_{2}^{2}|\leq\left(\frac{\left( 1-\vartheta \right)[\kappa +1, q]_{2}}{3\left| 2+e^{i\varpi}\right|[3, q]!\, b_{3}}\right)\{|2-\aleph|+|\aleph|\} \end{equation*} |
Taking \aleph = 1 , we have the following result.
\begin{equation*} |a_{3}- a_{2}^{2}|\leq\frac{2\left( 1-\vartheta \right)[\kappa +1, q]_{2}}{3\left| 2+e^{i\varpi}\right|[3, q]!\, b_{3}}. \end{equation*} |
In the current paper, we mainly get upper bounds of the initial Taylors coefficients of bi-univalent functions related with q- calculus operator. By fixing b_m as demonstrated in Remark 1, one can effortlessly deduce results correspondents to Theorems 2 and 3 associated with various operators listed in Remark 1. Further allowing q\rightarrow 1^{-} as itemized in Remark 2 we can outspread the results for new subclasses stated in Remark 2. Moreover by fixing \varpi = 0 and \varpi = \pi in Theorems 2 and 3, we can easily state the results for f\in\mathcal{M}_{\Sigma }^{q, \kappa }\left(\vartheta; h\right) and f\in\mathcal{HM}_{\Sigma }^{q, \kappa }\left(\vartheta; h\right) . Further by suitably fixing the parameters in Theorem 4, we can deduce Fekete-Szegö functional for these function classes. By using the subordination technique, we can extend the study by defining a new class
\begin{equation*} \left[ \left( \mathcal{H}_{h}^{\kappa , q}f(z)\right)^{\prime }+\left( \frac{1+e^{i\varpi}}{2}\right) z\left( \mathcal{H} _{h}^{\kappa , q}f(z)\right) ^{\prime \prime }\right]\prec\Psi(z) \end{equation*} |
where \Psi(z) the function \Psi is an analytic univalent function such that \Re \; \left(\Psi\right) > 0 \; \; \mathrm{in }\; \; \Delta with \Psi(0) = 1, \; \Psi^{\prime }(0) > 0 and \Psi maps \Delta onto a region starlike with respect to 1 and symmetric with respect to the real axis and is given by \Psi(z) = z+B_1z+B_2z^2+B_3z^3+\cdots, (B_1 > 0). Also, motivating further researches on the subject-matter of this, we have chosen to draw the attention of the interested readers toward a considerably large number of related recent publications (see, for example, [1,2,4]). and developments in the area of mathematical analysis. In conclusion, we choose to reiterate an important observation, which was presented in the recently-published review-cum-expository review article by Srivastava ([1], p. 340), who pointed out the fact that the results for the above-mentioned or new q- analogues can easily (and possibly trivially) be translated into the corresponding results for the so-called (p; q)- analogues(with 0 < |q| < p \leq 1 )by applying some obvious parametric and argument variations with the additional parameter p being redundant.
The researcher(s) would like to thank the Deanship of Scientific Research, Qassim University for funding the publication of this project.The authors are grateful to the reviewers for their valuable remarks, comments, and advices that help us to improve the quality of the paper.
The authors declare that they have no competing interests.
[1] | H. C. A. Tilborg, Fundamentals of cryptology: a professional reference and interactive tutorial, Boston: Kluwer Academic Publishers, 2000. |
[2] | K. Larew, D. Kahn, The codebreakers: the story of secret writing, 1 Ed., New Yourk: McMillan, 1967. |
[3] | A. J. Menezes, P. C. Van Oorschot, S. A. Vanstone, Handbook of applied cryptography, 1 Ed., CRC Press, 1996. |
[4] | D. R. Stinson, M. B. Paterson, Cryptography: theory and practice, 4 Eds., CRC Press, 1995. |
[5] | C. E. Shannon, Communication theory of secrecy systems, Bell Syst. Tech. J., 28 (1949), 656–715. |
[6] |
H. Liu, J. Liu, C. Ma, Constructing dynamic strong S-box using 3D chaotic map and application to image encryption, Multimed. Tools Appl., 82 (2023), 23899–23914. https://doi.org/10.1007/s11042-022-12069-x doi: 10.1007/s11042-022-12069-x
![]() |
[7] | L. Cui, Y. Cao, A new S-box structure named affine-power-affine, Int. J. Innov. Comput. Inf. Control, 3 (2007), 751–759. |
[8] |
I. Hussain, T. Shah, Literature survey on nonlinear components and chaotic nonlinear components of block ciphers, Nonlinear Dyn., 74 (2013), 869–904. https://doi.org/10.1007/s11071-013-1011-8 doi: 10.1007/s11071-013-1011-8
![]() |
[9] |
H. Liu, A. Kadir, X. Sun, Chaos-based fast colour image encryption scheme with true random number keys from environmental noise, IET Image Process., 11 (2017), 324–332. https://doi.org/10.1049/iet-ipr.2016.0040 doi: 10.1049/iet-ipr.2016.0040
![]() |
[10] |
H. Liu, A. Kadir, Asymmetric color image encryption scheme using 2D discrete-time map, Signal Process., 113 (2015), 104–112. https://doi.org/10.1016/j.sigpro.2015.01.016 doi: 10.1016/j.sigpro.2015.01.016
![]() |
[11] |
H. Liu, A. Kadir, J. Liu, Color pathological image encryption algorithm using arithmetic over Galois field and coupled hyper chaotic 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
![]() |
[12] |
I. Hussain, T. Shah, H. Mahmood, M. A. Gondal, A projective general linear group based algorithm for the construction of substitution box for block ciphers, Neural Comput. Appl., 22 (2013), 1085–1093. https://doi.org/10.1007/s00521-012-0870-0 doi: 10.1007/s00521-012-0870-0
![]() |
[13] |
F. ul Islam, G. Liu, Designing S-box based on 4D-4wing hyperchaotic system, 3D Res., 8 (2017), 9. https://doi.org/10.1007/s13319-017-0119-x doi: 10.1007/s13319-017-0119-x
![]() |
[14] | I. Hussain, T. Shah, M. A. Gondal, W. A. Khan, Construction of cryptographically strong 8x8 S-boxes, World Appl. Sci. J., 13 (2011), 2389–2395. |
[15] |
M. Ahmad, M. N. Doja, M. M. S. Beg, ABC optimization based construction of strong substitution-boxes, Wirel. Pers. Commun., 101 (2018), 1715–1729. https://doi.org/10.1007/s11277-018-5787-1 doi: 10.1007/s11277-018-5787-1
![]() |
[16] |
Attaullah, S. S. Jamal, T. Shah, A novel algebraic technique for the construction of strong substitution box, Wireless Pers. Commun., 99 (2018), 213–226. https://doi.org/10.1007/s11277-017-5054-x doi: 10.1007/s11277-017-5054-x
![]() |
[17] |
F. Özkaynak, V. Çelik, A. B. Özer, A new S-box construction method based on the fractional-order chaotic Chen system, Signal, Image Video Process., 11 (2017), 659–664. https://doi.org/10.1007/s11760-016-1007-1 doi: 10.1007/s11760-016-1007-1
![]() |
[18] |
A. Razaq, A. Yousaf, U. Shuaib, N. Siddiqui, A. Ullah, A. Waheed, A novel construction of substitution box involving coset diagram and a bijective map, Secur. Commun. Networks, 2017 (2017), 5101934. https://doi.org/10.1155/2017/5101934 doi: 10.1155/2017/5101934
![]() |
[19] |
A. Hussain Alkhaldi, I. Hussain, M. A. Gondal, A novel design for the construction of safe S-boxes based on TD ERC sequence, Alex. Eng. J., 54 (2015), 65–69. https://doi.org/10.1016/j.aej.2015.01.003 doi: 10.1016/j.aej.2015.01.003
![]() |
[20] |
L. Liu, Y. Zhang, X. Wang, A novel method for constructing the S-box based on spatiotemporal chaotic dynamics, Appl. Sci., 8 (2018), 2650. https://doi.org/10.3390/app8122650 doi: 10.3390/app8122650
![]() |
[21] |
S. Zhu, X. Deng, W. Zhang, C. Zhu, Secure image encryption scheme based on a new robust chaotic map and strong S-box, Math. Comput. Simul., 207 (2023), 322–346. https://doi.org/10.1016/j.matcom.2022.12.025 doi: 10.1016/j.matcom.2022.12.025
![]() |
[22] |
F. A. Khan, J. Ahmed, J. S. Khan, J. Ahmad, M. A. Khan, A novel substitution box for encryption based on Lorenz equations, 2017 International Conference on Circuits, System and Simulation (ICCSS), 2017, 32–36. https://doi.org/10.1109/CIRSYSSIM.2017.8023176 doi: 10.1109/CIRSYSSIM.2017.8023176
![]() |
[23] |
A. Ullah, S. S. Jamal, T. Shah, A novel construction of substitution box using a combination of chaotic maps with improved chaotic range, Nonlinear Dyn., 88 (2017), 2757–2769. https://doi.org/10.1007/s11071-017-3409-1 doi: 10.1007/s11071-017-3409-1
![]() |
[24] |
J. Zheng, Q. Zeng, An image encryption algorithm using a dynamic S-box and chaotic maps, Appl. Intell., 52 (2022), 15703–15717. https://doi.org/10.1007/s10489-022-03174-3 doi: 10.1007/s10489-022-03174-3
![]() |
[25] |
L. Li, J. Liu, Y. Guo, B. Liu, A new S-box construction method meeting strict avalanche criterion, J. Inf. Secur. Appl., 66 (2022), 103135. https://doi.org/10.1016/j.jisa.2022.103135 doi: 10.1016/j.jisa.2022.103135
![]() |
[26] |
Y. Su, X. Tong, M. Zhang, Z. Wang, A new S-box three-layer optimization method and its application, Nonlinear Dyn., 111 (2023), 2841–2867. https://doi.org/10.1007/s11071-022-07956-9 doi: 10.1007/s11071-022-07956-9
![]() |
[27] |
Y. Si, H. Liu, M. Zhao, Constructing keyed strong S-box with higher nonlinearity based on 2D hyper chaotic map and algebraic operation, Integration, 88 (2023), 269–277. https://doi.org/10.1016/j.vlsi.2022.10.011 doi: 10.1016/j.vlsi.2022.10.011
![]() |
[28] |
Y. Liu, X. Tong, J. Ma, Image encryption algorithm based on hyper-chaotic system and dynamic S-box, Multimed. Tools Appl., 75 (2016), 7739–7759. https://doi.org/10.1007/s11042-015-2691-5 doi: 10.1007/s11042-015-2691-5
![]() |
[29] | I. Hussain, T. Shah, M. A. Gondal, M. Khan, W. A. Khan, Construction of new S-box using a linear fractional transformation, World Appl. Sci. J., 14 (2011), 1779–1785. |
[30] |
T. Farah, R. Rhouma, S. Belghith, A novel method for designing S-box based on chaotic map and Teaching–Learning-Based Optimization, Nonlinear Dyn., 88 (2017), 1059–1074. https://doi.org/10.1007/s11071-016-3295-y doi: 10.1007/s11071-016-3295-y
![]() |
[31] |
D. Shah, T. Shah, Y. Naseer, S. S. Jamal, S. Hussain, Cryptographically strong S-P boxes and their application in steganography, J. Inf. Secur. Appl., 67 (2022), 103174. https://doi.org/10.1016/j.jisa.2022.103174 doi: 10.1016/j.jisa.2022.103174
![]() |
[32] |
D. Lambić, A novel method of S-box design based on discrete chaotic map, Nonlinear Dyn., 87 (2017), 2407–2413. https://doi.org/10.1007/s11071-016-3199-x doi: 10.1007/s11071-016-3199-x
![]() |
[33] |
N. A. Azam, U. Hayat, I. Ullah, An injective S-box design scheme over an ordered isomorphic elliptic curve and its characterization, Secur. Commun. Networks, 2018 (2018), 3421725. https://doi.org/10.1155/2018/3421725 doi: 10.1155/2018/3421725
![]() |
[34] |
K. Z. Zamli, F. Din, H. S. Alhadawi, Exploring a Q-learning-based chaotic naked mole rat algorithm for S-box construction and optimization, Neural Comput. Appl., 35 (2023), 10449–10471. https://doi.org/10.1007/s00521-023-08243-3 doi: 10.1007/s00521-023-08243-3
![]() |
[35] | P. J. Cameron, Cayley graphs and coset diagrams group actions, Encycl. Des. Theory, 1 (2006), 1–9. |
[36] | P. M. Cohn, W. Magnus, A. Karrass, D. Solitar, Combinatorial group theory., 74 (1967). https://doi.org/10.2307/2314941 |
[37] |
M. Khan, T. Shah, M. A. Gondal, An efficient technique for the construction of substitution box with chaotic partial differential equation, Nonlinear Dyn., 73 (2013), 1795–1801. https://doi.org/10.1007/s11071-013-0904-x doi: 10.1007/s11071-013-0904-x
![]() |
[38] |
M. M. Dimitrov, On the design of chaos-based S-boxes, IEEE Access, 8 (2020), 117173–117181. https://doi.org/10.1109/ACCESS.2020.3004526 doi: 10.1109/ACCESS.2020.3004526
![]() |
[39] | J. Pieprzyk, G. Finkelstein, Towards effective nonlinear cryptosystem design, IEE Proc. E-Comput. Digital Tech., 135 (1988), 325–335. |
[40] |
D. Zhu, X. Tong, M. Zhang, Z. Wang, A new s-box generation method and advanced design based on combined chaotic system, Symmetry, 12 (2020), 1–17. https://doi.org/10.3390/sym12122087 doi: 10.3390/sym12122087
![]() |
[41] |
A. H. Zahid, A. M. Iliyasu, M. Ahmad, M. M. U. Shaban, M. J. Arshad, H. S. Alhadawi, et al., A novel construction of dynamic S-box with high nonlinearity using heuristic evolution, IEEE Access, 9 (2021), 67797–67812. https://doi.org/10.1109/ACCESS.2021.3077194 doi: 10.1109/ACCESS.2021.3077194
![]() |
[42] |
I. Hussain, T. Shah, M. A. Gondal, H. Mahmood, Generalized majority logic criterion to analyze the statistical strength of S-boxes, Z. Naturforsch. A, 67 (2012), 282–288. https://doi.org/10.5560/ZNA.2012-0022 doi: 10.5560/ZNA.2012-0022
![]() |
[43] |
A. Gautam, G. S. Gaba, R. Miglani, R. Pasricha, Application of chaotic functions for construction of strong substitution boxes, Indian J. Sci. Technol., 8 (2015), 1–5. https://doi.org/10.17485/ijst/2015/v8i28/71759 doi: 10.17485/ijst/2015/v8i28/71759
![]() |
[44] | I. Hussain, T. Shah, H. Mahmood, M. A. Gondal, U. Y. Bhatti, Some analysis of S-box based on residue of prime number, Proc. Pakistan Acad. Sci., 48 (2011), 111–115. |
[45] | I. Hussain, A new algorithm to construct secure keys for AES, 5 (2010), 1263–1270. |
[46] |
X. Yi, S. X. Cheng, X. H. You, K. Y. Lam, Method for obtaining cryptographically strong 8×8 S-boxes, GLOBECOM 97. IEEE Global Telecommunications Conference. Conference Record, 1997,689–693. https://doi.org/10.1109/glocom.1997.638418 doi: 10.1109/glocom.1997.638418
![]() |
[47] | J. Daemen, V. Rijmen, The design of rijndael, New York: Springer, 2002. |
[48] | National Institute of Standards and Technology, SKIPJACK and KEA Algorithm Specifications, 1998. Available From: https://csrc.nist.gov/Presentations/1998/Skipjack-and-KEA-Algorithm-Specifications. |
[49] |
G. Chen, Y. Chen, X. Liao, An extended method for obtaining S-boxes based on three-dimensional chaotic Baker maps, Chaos, Solitons Fract., 31 (2007), 571–579. https://doi.org/10.1016/j.chaos.2005.10.022 doi: 10.1016/j.chaos.2005.10.022
![]() |
[50] |
G. Tang, X. Liao, Y. Chen, A novel method for designing S-boxes based on chaotic maps, Chaos, Solitons Fract., 23 (2005), 413–419. https://doi.org/10.1016/j.chaos.2004.04.023 doi: 10.1016/j.chaos.2004.04.023
![]() |
[51] |
A. Belazi, M. Khan, A. A. A. El-Latif, S. Belghith, Efficient cryptosystem approaches: S-boxes and permutation–substitution-based encryption, Nonlinear Dyn., 87 (2017), 337–361. https://doi.org/10.1007/s11071-016-3046-0 doi: 10.1007/s11071-016-3046-0
![]() |
[52] |
Z. Hua, J. Li, Y. Chen, S. Yi, Design and application of an S-box using complete Latin square, Nonlinear Dyn., 104 (2021), 807–825. https://doi.org/10.1007/s11071-021-06308-3 doi: 10.1007/s11071-021-06308-3
![]() |
[53] |
A. Javeed, T. Shah, Attaullah, Design of an S-box using Rabinovich-Fabrikant system of differential equations perceiving third order nonlinearity, Multimed. Tools Appl., 79 (2020), 6649–6660. https://doi.org/10.1007/s11042-019-08393-4 doi: 10.1007/s11042-019-08393-4
![]() |
[54] | I. Hussain, A new algorithm to construct secure keys for AES, Int. J. Contemp. Math. Sci., 5 (2010), 1263–1270. |
[55] |
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
![]() |
[56] |
H. Liu, A. Kadir, C. Xu, Cryptanalysis and constructing S-box based on chaotic map and backtracking, Appl. Math. Comput., 376 (2020), 125153. https://doi.org/10.1016/j.amc.2020.125153 doi: 10.1016/j.amc.2020.125153
![]() |
[57] |
Y. Si, H. Liu, Y. Chen, Constructing keyed strong S-box using an enhanced quadratic map, Int. J. Bifurcat. Chaos, 31 (2021), 2150146. https://doi.org/10.1142/S0218127421501467 doi: 10.1142/S0218127421501467
![]() |
[58] |
S. S. Jamal, M. U. Khan, T. Shah, A watermarking technique with chaotic fractional S-box transformation, Wireless Pers. Commun., 90 (2016), 2033–2049. https://doi.org/10.1007/s11277-016-3436-0 doi: 10.1007/s11277-016-3436-0
![]() |
[59] |
Y. Tian, Q. Liu, D. Liu, Y. Kang, P. Deng, F. He, Updates to Grasselli's peak shear strength model, Rock Mech. Rock Eng., 51 (2018), 2115–2133. https://doi.org/10.1007/s00603-018-1469-2 doi: 10.1007/s00603-018-1469-2
![]() |
[60] |
Ü. Ç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 Dyn., 87 (2017), 1081–1094. https://doi.rog/10.1007/s11071-016-3099-0 doi: 10.1007/s11071-016-3099-0
![]() |
[61] |
F. Özkaynak, Construction of robust substitution boxes based on chaotic systems, Neural Comput. Appl., 31 (2019), 3317–3326. https://doi.org/10.1007/s00521-017-3287-y doi: 10.1007/s00521-017-3287-y
![]() |
1. | Anam Habib, Zareen A. Khan, Muhammad Riaz, Dragan Marinkovic, Performance Evaluation of Healthcare Supply Chain in Industry 4.0 with Linear Diophantine Fuzzy Sine-Trigonometric Aggregation Operations, 2023, 11, 2227-7390, 2611, 10.3390/math11122611 | |
2. | Muhammad Naeem, Muhammad Qiyas, Lazim Abdullah, Neelam Khan, Correction: Sine hyperbolic fractional orthotriple linear Diophantine fuzzy aggregation operator and its application in decision making, 2024, 9, 2473-6988, 33493, 10.3934/math.20241598 |