Block ciphers are essential for the secure exchange of data and communication, as they are one of the primary components of network security systems. Modern-day block ciphers are most significantly reliant on substitution-boxes (S-boxes). In essence, the security of these cryptosystems is contingent upon the quality of the S-box that is implemented. Robustness and assurance of the security competency necessary to block ciphers are provided by the cryptographically strong S-boxes. A novel coset graph-based algebraic method was proposed to evolve a robust and efficient S-box in order to address the challenges of strong S-box generation. To begin, the vertices of coset graphs for two Galois fields and a bijective function were employed to generate an initial S-box of sufficient cryptographic strength. Afterwards, a permutation group of large order enhances the robustness of the initial S-box, ensuring its resistance against various cryptanalytic attacks. The proposed method's efficacy was verified by comparing the attributes of our S-box with those of S-boxes that have been recently investigated. Furthermore, the proposed S-box was used for image encryption. The outcome of the majority logic criterion (MLC) criteria, differential analysis, and histogram test demonstrates the suitability of the proposed S-box for secure multimedia applications in the results.
Citation: Abdul Razaq, Muhammad Mahboob Ahsan, Hanan Alolaiyan, Musheer Ahmad, Qin Xin. Enhancing the robustness of block ciphers through a graphical S-box evolution scheme for secure multimedia applications[J]. AIMS Mathematics, 2024, 9(12): 35377-35400. doi: 10.3934/math.20241681
Related Papers:
[1]
Bader S. Almohaimeed .
Correction: Periodic stationarity conditions for mixture periodic INGARCH models. AIMS Mathematics, 2022, 7(10): 18280-18281.
doi: 10.3934/math.20221005
[2]
Omar Alzeley, Ahmed Ghezal .
On an asymmetric multivariate stochastic difference volatility: structure and estimation. AIMS Mathematics, 2024, 9(7): 18528-18552.
doi: 10.3934/math.2024902
[3]
Kee Wah Fo, Seng Huat Ong, Choung Min Ng, You Beng Koh .
An alternative hyper-Poisson integer-valued GARCH model with application to polio, internet protocol and COVID-19 data. AIMS Mathematics, 2023, 8(12): 29116-29139.
doi: 10.3934/math.20231491
[4]
Chun Peng, Xiaoliang Li, Bo Du .
Positive periodic solution for enterprise cluster model with feedback controls and time-varying delays on time scales. AIMS Mathematics, 2024, 9(3): 6321-6335.
doi: 10.3934/math.2024308
[5]
Shuo Zhang, Jianhua Cheng .
Bayesian premium of a credibility model based on a heterogeneous SETINAR(2, 1) process. AIMS Mathematics, 2023, 8(12): 28710-28727.
doi: 10.3934/math.20231469
[6]
Lihong Guan, Xiaohong Wang .
A discrete-time dual risk model with dependence based on a Poisson INAR(1) process. AIMS Mathematics, 2022, 7(12): 20823-20837.
doi: 10.3934/math.20221141
Mashael A. Alshehri, Mohamed Kayid .
Copulas generated by mixtures of weighted distributions. AIMS Mathematics, 2022, 7(5): 8953-8974.
doi: 10.3934/math.2022499
[9]
Mohamed El-Borhamy, Essam Eddin M. Rashad, Arafa A. Nasef, Ismail Sobhy, Samah M. Elkholy .
On the construction of stable periodic solutions for the dynamical motion of AC machines. AIMS Mathematics, 2023, 8(4): 8902-8927.
doi: 10.3934/math.2023446
[10]
Tahani A. Abushal, Alaa H. Abdel-Hamid .
Inference on a new distribution under progressive-stress accelerated life tests and progressive type-II censoring based on a series-parallel system. AIMS Mathematics, 2022, 7(1): 425-454.
doi: 10.3934/math.2022028
Abstract
Block ciphers are essential for the secure exchange of data and communication, as they are one of the primary components of network security systems. Modern-day block ciphers are most significantly reliant on substitution-boxes (S-boxes). In essence, the security of these cryptosystems is contingent upon the quality of the S-box that is implemented. Robustness and assurance of the security competency necessary to block ciphers are provided by the cryptographically strong S-boxes. A novel coset graph-based algebraic method was proposed to evolve a robust and efficient S-box in order to address the challenges of strong S-box generation. To begin, the vertices of coset graphs for two Galois fields and a bijective function were employed to generate an initial S-box of sufficient cryptographic strength. Afterwards, a permutation group of large order enhances the robustness of the initial S-box, ensuring its resistance against various cryptanalytic attacks. The proposed method's efficacy was verified by comparing the attributes of our S-box with those of S-boxes that have been recently investigated. Furthermore, the proposed S-box was used for image encryption. The outcome of the majority logic criterion (MLC) criteria, differential analysis, and histogram test demonstrates the suitability of the proposed S-box for secure multimedia applications in the results.
1.
Introduction
Integer-valued GARCH (INGARCH) models have proved to be useful in modeling count time series which are characterized by specific patterns that cannot be accounted for by standard ARMA models ([1,5,18,19,20,23,25,30,32,37,38,39]). Among the most apparent features of count time series are low values, overdispersion (the variance is larger than the mean), persistence, asymmetry, and a positive autocorrelation structure (cf. [19] and [27]). In its general form, the INGARCH model is defined through a discrete conditional distribution (e.g., Poisson, negative binomial, etc.) with a stochastic time-varying conditional mean, which depends on past observations through time-invariant parameters.
For count data that also exhibit a seasonal behavior, the periodic INGARCH model – in which the parameters are taken to be periodic over time – has been found to be attractive ([7,14,16,29]). Aknouche et al. [7] proposed periodic stationarity and periodic ergodicity conditions for the first-order periodic INGARCH(1,1) model with conditional distributions belonging to the class of Poisson mixtures. Almohaimeed in [11] extended the result to a higher-order periodic INGARCH(p,q) in a larger family of distributions whose stochastic order is identical to the mean order ([3]). These general results can be used to support asymptotic inference for periodic INGARCH models used in studying the asymptotic properties of the Poisson quasi-maximum likelihood estimate (QMLE) and the negative binomial QMLE ([1] and [8]).
In spite of the high-level of generality of the periodic INGARCH model in modeling a wide range of count data, it seems that it is unable to model some other pathological features such as multimodality and heavy tailedness of the conditional distributions ([21,22,40]). A well-known approach to model these features is to utilize a finite mixture of distributions (e.g., [4,10]) leading to a mixture periodic INGARCH representation. Ouzzani and Bentarzi [35] proposed a Poisson mixture periodic INARCH model and studied its periodic stationarity in mean properties. However, strict periodic stationarity and periodic ergodicity have not been considered. Moreover, the model only deals with the Poisson mixture and the ARCH forms, which can be restrictive.
This paper provides strict periodic stationarity and periodic ergodicity conditions for a general mixture periodic INGARCH(p,q) model. This model is defined via a finite mixture of discrete distributions with conditional means depending on past observations through periodic time-varying parameters. The mixture feature allows for finitely many component specifications corresponding to the conditional mean and is specified via a finite independent and periodically distributed chain called the switching (or regime) process. Moreover, the lagged values of the conditional mean in each regime are governed by the past values of the regime sequence (cf. [4,9,26,34,40]). Finally, the conditional mean in each regime is a general (linear or nonlinear) function of past observations. The model thus allows for a large spectrum of distributions and various conditional mean shapes.
The rest of this paper has the following structure. Section 2 defines the model and the tools needed for the subsequent Sections. In Section 3, we propose periodic ergodicity conditions for the mixture periodic INGARCH (henceforth MP-INGARCH). Section 4 extends the results to the case of nonlinear Lipschitz conditional mean forms. Section 5 illustrates the general results on specific mixture periodic distributions such as the periodic Poisson mixture INGARCH, and the periodic negative binomial mixture INGARCH. In addition, a simulation study is carried out to compare the theoretical seasonal expectations generated by the model and their sample counterparts computed using simulated series. Main conclusions are indicated in Section 6.
2.
Mixture periodic INGARCH model
In the sequel, it is assumed that all random variables and sequences are defined on a probability space (Ω,F,P) with values in subsets of the integer set N={0,1,...}.
Let us recall some probability properties for periodic processes such as periodic stationarity and periodic ergodicity. A sequence of random variables {Xt,t∈Z} is said to be independent and S-periodically distributed (ipdS) if: i) {Xt,t∈Z} is independent, and ii) Xtd=Xt+kS for all k,t∈Z, where S≥1 is a positive integer called the period, and the symbol "d=" stands for equality in distribution. When S=1, an ipd1 sequence is just an independent and identically distributed (iid) process.
A stochastic process {Yt,t∈Z} is said to be strictly periodically stationary with period S≥1 if all processes {YnS+s,n∈Z} (1≤s≤S) are strictly stationary in the ordinary sense. In addition, {Yt,t∈Z} is called S-periodically stationary in mean if E(Yt) is finite (for all t∈Z) and is S-periodic over t. Naturally, strict periodic stationarity implies periodic stationarity in the mean whenever the seasonal means of the process are finite. The process {Yt,t∈Z} is said to be periodically ergodic with period S if all sub-processes {YnS+s,n∈Z} (s∈{1,...,S}) are ergodic in the usual sense (cf. [6,17]). The simplest strictly periodically stationary and periodically ergodic process (with period S) is an ipdS sequence.
Let Fλ be a cumulative distribution function (cdf) with discrete support and mean λ=∫+∞0xdFλ(x)>0. Suppose that Fλ satisfies the following "equal stochastic and mean orders" property introduced by [3]
λ≤λ∗⇒F−λ(u)≤F−λ∗(u),∀u∈(0,1),
(2.1)
where F−λ is the generalized inverse of Fλ. The family of distributions satisfying (2.1) is quite large and contains the one-parameter exponential family such as the Poisson and negative binomial distributions, and also other interesting distributions (cf. [3]). In [11] proposed a large class of periodic INGARCH(p,q) models described as follows. An integer-valued process {Yt,t∈Z} is said to be a periodic INGARCH(p,q) of orders p and q(p,q∈N), and positive integer period S≥1, if its conditional distributions are given by
Yt|Ft−1∼Ft,λt,t∈Z,
(2.2)
where Ft−1 is the σ-algebra generated by {Yt−1,Yt−2,...}, the cdf Ft,λt:=Fλt satisfies (2.1) for all t∈Z, and the conditional mean λt is given by
λt=ωt+q∑i=1αtiYt−i+p∑j=1βtjλt−j,t∈Z.
(2.3)
The parameters ωt>0,αti≥0 (i=1,...,q) and βtj≥0 (j=1,...,p) are periodic in t with period S in the sense ωt=ωt+kS, αti=αt+kS,i and βtj=βt+kS,j for all k,t∈Z. In a more compact form, Eq (2.3) can be written as follows
In this paper we consider a finite mixture generalization of the periodic INGARCH(p,q) model (2.2)–(2.3). Let a positive integer L, which refers to the number of regimes (or components). Let also {Δt,t∈Z} be an ipdS sequence of random variables, valued in the finite set {1,...,L} with distribution P(Δt=l)=πt(l), where πt(l)≥0, ∑Ll=1πt(l)=1, and πt(l) is S-periodic in t in the sense πt+hS(l)=πt(l) for all t, h and l. The values assumed by Δt are called components or regimes and the probability πt(l) is called the mixing proportion along the season or channel t.
A stochastic process {Yt,t∈Z} is said to be a mixture periodic INGARCH(p,q) (henceforth MP-INGARCH(p,q)) model if its conditional distribution is a finite mixture of L mixing distributions, that is
Yt|Ft−1∼πt(1)Ft,1,λ1,t+⋯+πt(L)Ft,L,λL,t,
(2.4)
where Fλ=Ft,l,λ satisfies (2.1) and λt:=λΔt,t is given by
λt=ωt(Δt)+q∑i=1αti(Δt)Yt−i+p∑j=1βtj(Δt)λt−j.
(2.5)
For all l, the parameters ωt(l)>0,αti(l)≥0 and βtj(l)≥0 are S -periodic over t in the above sense. Equation (2.5) can be written in the periodic form
where, for instance, ωs(l) (1≤s≤S, 1≤l≤L) denotes the intercept at season s and regime l. Naturally, when L=1, the MP-INGARCH model given by (2.4)–(2.5) reduces to the periodic INGARCH model defined by (2.2)–(2.3) (cf. [11]).
For identifiability purposes, one can assume that for all 1≤v≤S, πv(1)≥πv(2)≥⋯≥πv(L). See also [2,34,40] for time-invariant mixtures corresponding to S=1. Note, however, that the identifiability of the mixture INGARCH model is rather important for asymptotic estimation theory but is not required from a probabilistic point of view.
It is worth noting that the past recent values of λΔt,t in (2.5) depend on the past values of the regime variable Δt (see also [4,9,24,34]). The likelihood of (2.4)–(2.5) is therefore not simple to obtain as it depends on the whole path information concerning Δt. A more general specification is
λt=gt,Δt(Yt−1,…,Yt−q,λt−1,…,λt−p),
(2.6)
where gt,l (1≤l≤L) is [0,∞)-valued, and is S -periodic over t.
Denote by FΔt the sigma-field generated by {Yi,Δi+1,i≤t}. The distribution given by (2.4) can be rewritten in function of Δt as follows
Yt∣FΔt−1∼Ft,Δt,λt.
(2.7)
Model (2.4)–(2.5) encompasses several important mixtures of distributions such as:
i) The Poisson mixture
πt(1)P(λ1,t)+⋯+πt(L)P(λL,t).
(2.8)
ii) The quadratic negative binomial mixture (Aknouche and Francq, 2022)
3.
Periodic ergodicity conditions: the linear conditional mean case
Conditions under which the MP-INGARCH process defined by (2.4) and (2.5) is strictly periodically stationary and periodically ergodic are now given. Let m=max(p,q) and set
cti=L∑l=1πt(l)(αti(l)+βti(l)),i=1,...,m.
Consider the m×m companion matrix At given by
At=(ct1ct2⋯ct,m−1ctm10⋯0001⋯00⋮⋮⋱⋮⋮00⋯10),
(3.1)
Let ρ(B) denote the spectral radius of the matrix B, i.e., the maximum absolute eigenvalues of B.
Theorem 3.1.Under
ρ(S∏s=1AS−s+1)<1,
(3.2)
there exists a strictly periodically stationary, and periodically ergodic process{Yt,t∈Z}satisfying
Conversely, if there is a mean periodically stationary process{Yt,t∈Z}satisfying(3.3)withE(Yt)<∞for allt∈Z, then(3.2)holds.
Proof. Let us prove the necessary part of the Theorem. If there exists a mean periodically stationary process {Yt,t∈Z} satisfying (3.2) with E(Yt)=E(λt) for all t, then we have
Setting Y_t=(E(Yt),...,E(Yt−m+1))′ and Bt=(∑Ll=1πt(l)ωt(l),0,...,0)′, equality (3.4) can be rewritten in the following matrix equation
Y_t=AtY_t−1+Bt.
By iterating the latter equation S times while using the S-periodicity in-mean of the process, which implies that E(Y_t−S)=E(Y_t), we get the following equation
Y_t=(At⋯At−S+1)Y_t+Ct,
(3.5)
where
Ct=S−1∑j=0j−1∏i=0At−iBt−j.
Using Lemma A.1 in [4] and Corollary 8.1.29 in [31], equality (3.5) entails
ρ(At⋯At−S+1)<1,
which in turns is equivalent to (3.2).
We now prove the sufficiency part of the theorem. Let {Ut,t∈Z} be an iid uniformly distributed sequence in [0,1], independent of {Δt,t∈Z}. For all t∈Z put
where in view of the S-periodicity of the model parameters, the measurable function φt,k:[0,1]k×{1,...,L}k→[0,∞) is S-periodic in t in the sense φt,k=φhS+t,k for all t,h∈Z. Therefore, the processes {λ(k)t,t∈Z} and {Y(k)t,t∈Z} are strictly periodically stationary and periodically ergodic (e.g., [6]) for all k. Now, let F(k)t−1 and F∗t−1 be the σ-algebras generated by {Y(k−i)t−i,Δt−i+1,i>0} and {Ui,Δi+1,i<t}, respectively. Since the variable F−λ(U) has the cdf Fλ when U is uniformly distributed in [0,1], it follows that
then the existence of a process satisfying (3.3), with F∗t−1 in place of FΔt−1, is proved. Taking the limit as k→∞ on the two sides of the equalities (3.6) and (3.7), we obtain a.s.
Yt=limk→∞Y(k)t=F−t,Δt,λt(Ut).
As λt is FΔt−1-measurable, the distribution of Yt given F∗t−1 is the same as that of Yt given FΔt−1. To show that (3.2) implies (3.8), let us first prove that the sequence (λ(k)t)k is increasing, i.e.,
0≤λ(k−1)t≤λ(k)t,forallk
(3.9)
and that
E(Y(k)t)≥E(Y(k−1)t),forallk.
(3.10)
When k≤0, the inequalities (3.9) and (3.10) are obviously satisfied. For k≥1, (3.9) is shown by induction. If
where At is given by (3.1), and the equality V(k−S)t−S=V(k−S)t, which follows from the S -periodicity of the coefficients, is used. Under (3.2) and (3.12), we get for all t
V(k)t→0ask→∞.
Thus the sequence {λ(k)t}k converges in L1 and a.s. In addition, since
where φt:[0,1]∞×{1,...,L}∞→[0,∞) is measurable and S-periodic in t, the sequence {λt,t∈Z} is therefore strictly stationary and ergodic in the periodic meaning.
In view of (3.5) and the S-periodicity of the model parameters, the S unconditional (seasonal) means of the MP-INGARCHS(p,q) model are given, under the periodic ergodicity condition (3.2), by
where Im stands for the identity matrix of order m=max(p,q).
4.
MP-INGARCH(p,q) model with non-linear conditional means
This Section extends the periodic ergodicity conditions for the MP-INGARCH(p,q) model when the conditional mean λt has the more general nonlinear form (2.6). Suppose that for all t∈Z, the S-periodic function gt,l(y1,…,yq,λ1,…,λp) is Lipschitz, that is for all (yi,y′i), i=1,…,q and all (λj,λ′j), j=1,…,p,
where αti(l)≥0 and βtj(l)≥0 are S-periodic over t. See also [34] and [4] for the non-periodic INGARCH setting. Let At be defined as in (3.1). The following result shows that condition (3.3) in which the coefficients of the matrix At are replaced by those of the Lipschitz inequality (4.1), is still sufficient for the existence of a periodically ergodic process verifying (2.7) and (2.6) (or equivalently (2.4) and (2.6))
Theorem 4.1.There exists a strictly periodically stationary and periodically ergodic process{Yt,t∈Z}with a conditional distribution given by(2.1)and(2.7), whereλtsatisfies(2.6)and(4.1), if
ρ(AtAt−1⋯At−S+1)<1.
(4.2)
Proof. Using similar arguments in the proof of Theorem 3.1, let {Ut,t∈Z} be defined as above. Define for all t∈Z
and let Y(k)t be given as in (3.7). As for the proof of Theorem 3.1, under (4.2) we show the existence of a periodically ergodic process satisfying (2.1), (2.7), (2.6), and (4.1). This amounts to show the a.s. convergence of λ(k)t given by (4.3) to the limit λt, which is given by (2.6). From (2.7) we have
The latter can be rewritten in the following inequality
V(k)t≤At⋯At−S+1V(k−S)t,
where V(k)t is defined as in (3.12). Under (4.2), V(k)t→0 from which the Theorem is established.
5.
Illustrations
5.1. On particular mixture periodic distributions
In this subsection, we apply the very general results given by Theorem 3.1 to various special cases.
Example 5.1. (First-order Poisson MP-INGARCH(1,1)model)
For model (2.8) and (2.5), taking p=q=1, condition (3.2) becomes
S∏s=1L∑k=1πt(k)(αt−s,1(k)+βt−s,1(k))<1.
If in addition L=1, the latter reduces to the periodic ergodicity condition given by [7] for the first-order periodic INGARCH(1,1) model with a Poisson mixture conditional distribution. See also [13,33,35].
Example 5.2.(First-order Negative binomial MP-INGARCH(1,1)model)
The condition (3.2) also applies to a vaster class of distributions given by (2.1) such as the negative binomial mixture. We consider here two instances:
- The quadratic negative binomial mixture ([5]) given by (2.9).
- The linear negative binomial mixture given by (2.10).
Example 5.3. (Non-mixed periodic INGARCH(p,q)model)
When L=1, the matrix At in condition (3.2) reduces to
and αi (i=1,...,q) and βj (j=1,...,p) are the conditional mean parameters of the time-invariant INGARCH(p,q) model corresponding to S=1. According to Corollary 2.2 in [27], the condition (5.1) is equivalent to
q∑i=1αi+p∑j=1βj<1,
which is the standard ergodicity condition given by [4].
Example 5.6. (Mixture periodic INARCH(q)models)
When p=0 in the general model (2.4)–(2.5), we obtain the particular mixture periodic INARCH model considered by [35]. So our condition (3.2) reduces to their periodic stationarity-in-mean condition. Note, however, that condition (3.2) also ensures the periodic ergodicity of the model, which has not been studied by [35]. Moreover, our condition also applies to larger classes of distributions, to general GARCH lags, and to non-linear conditional mean forms.
5.2. On simulated data: Monte Carlo estimations of the theoretical means
In this Subsection, the veracity of the unconditional mean formula (3.13) (which is based on condition (3.2) of Theorem 3.1) is assessed through a simulation study. Three mixture periodic distributions are considered.
i) The first one is the two-component Poisson MP-INGARCH4(1,1) model with period S=4,
For each case, 1000 Monte Carlo replications with sample-size T=800 (hence N=200) are simulated, from which the S seasonal sample means ¯Yv=1N∑N−1n=0YnS+v, for all 1≤v≤S, are obtained. Then, these seasonal sample means are compared with their seasonal theoretical counterparts obtained from (3.13) under the periodic stationarity condition (3.2). For the first case, Figure 1 shows the Boxplots of the 4 seasonal sample means and the corresponding theoretical means in solid line. Figures 2 and 3 show the same for cases 2 and 3, respectively.
Figure 1.
Theoretical and sample seasonal means for the 2-component, 4-periodic Poisson MP-INGARCH4(1,1) model.
From Figures 1–3, it can be seen that the theoretical seasonal means are at the center of their corresponding Boxplots, which supports the above theoretical calculations. Moreover, the Boxplots are, in most cases, symmetric and are therefore consistent with the normality assumption, which follows from the central limit theorem for periodically ergodic processes.
6.
Conclusions
In this paper, we examined some probability properties of a general mixture periodic integer-valued GARCH model, which can be used to model seasonally-varying integer-valued time series data. More precisely, we proposed strict periodic stationarity (and periodic ergodicity) conditions for a wide family of mixture distributions whose stochastic order is the same as the mean order (cf. [4]). The regime sequence driving the mixture feature is assumed to be independent and periodically distributed. Moreover, the lagged conditional means are governed by the lagged values of the mixture variable, which makes the model depends on the past of the regime variable. Therefore, the likelihood of the model is not easy to calculate, but the estimation of the latter can be done using the generalized method of moments ([28]), Bayesian MCMC methods ([12]), or particle filtering ([36]). On the other hand, the model we studied is also general from the form of the conditional means which can be linear or Lipschitz nonlinear.
Various extensions of the proposed model can be proposed. We mention in particular multivariate mixture periodic models and non-Lipschitz conditional functions such as threshold models.
Acknowledgements
I am deeply grateful to the Editor and the referees for their helpful comments and useful suggestions which led to a significant improvement of the earlier version of the paper. The researcher would like to thank the Deanship of Scientific Research, Qassim University, for funding the publication of this project.
Conflict of interest
The author declares no conflicts of interest regarding this article.
References
[1]
M. Zhang, Y. Zhang, Q. Cen, S. Wu, Deep learning-based resource allocation for secure transmission in a non-orthogonal multiple access network, Int. J. Distr. Sensor Net., 18 (2022), 1975857866. https://doi.org/10.1177/15501329221104330 doi: 10.1177/15501329221104330
[2]
B. Bi, D. Huang, B. Mi, Z. Deng, H. Pan. Efficient LBS security-preserving based on NTRU oblivious transfer, Wireless Pers. Commun., 108 (2019), 2663–2674. https://doi.org/10.1007/s11277-019-06544-2 doi: 10.1007/s11277-019-06544-2
[3]
R. Bhanot, R. Hans, A review and comparative analysis of various encryption algorithms, Int. J. Secur. Its Appl., 9 (2015), 289–306. http://dx.doi.org/10.14257/ijsia.2015.9.4.27 doi: 10.14257/ijsia.2015.9.4.27
[4]
G. Sun, Y. Li, D. Liao, V. Chang, Service function chain orchestration across multiple domains: A full mesh aggregation approach, IEEE Tran. Network Service Manag., 15 (2018), 1175–1191. https://doi.org/10.1109/TNSM.2018.2861717 doi: 10.1109/TNSM.2018.2861717
[5]
J. Daemen, V. Rijmen, The design of Rijndael, New York: Springer-verlag, 2002. https://doi.org/10.1007/978-3-662-04722-4
[6]
E. Biham, A. Shamir, Differential cryptanalysis of DES-like cryptosystems, J. CRYPTOLOGY, 4 (1991), 3–72. https://doi.org/10.1007/BF00630563 doi: 10.1007/BF00630563
[7]
C. E. Shannon, Communication theory of secrecy systems, Bell Syst. Technical 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
[8]
N. Siddiqui, A. Naseer, M. Ehatisham-ul-Haq, A novel scheme of substitution-box design based on modified Pascal's triangle and elliptic curve, Wirel. Personal Commun., 116 (2021), 3015–3030. https://doi.org/10.1007/s11277-020-07832-y
[9]
H. A. Ahmed, M. F. Zolkipli, M. Ahmad, A novel efficient substitution-box design based on firefly algorithm and discrete chaotic map, Neural Comput. Appl., 31 (2019), 7201–7210. https://doi.org/10.1007/s00521-018-3557-3 doi: 10.1007/s00521-018-3557-3
[10]
F. Masood, J. Masood, L. Zhang, S. S. Jamal, W. Boulila, S. U. Rehman, et al., A new color image encryption technique using DNA computing and Chaos-based substitution box, Soft Comput., 26 (2022), 7461–7477. https://doi.org/10.1007/s00500-021-06459-w
[11]
A. Razaq, M. Ahmad, A. Yousaf, M. Alawida, A. Ullah, U. Shuaib, A group theoretic construction of large number of AES-like substitution-boxes, Wirel. Personal Commun., 122 (2022), 2057–2080. https://doi.org/10.1007/s11277-021-08981-4 doi: 10.1007/s11277-021-08981-4
[12]
A. Razaq, S. Akhter, A. Yousaf, U. Shuaib, M. Ahmad, A group theoretic construction of highly nonlinear substitution box and its applications in image encryption, Multi. Tools Appl., 81 (2022), 4163–4184. https://doi.org/10.1007/s11042-021-11635-z doi: 10.1007/s11042-021-11635-z
[13]
F. Gonzalez, R. Soto, B. Crawford, Stochastic fractal search algorithm improved with opposition-based learning for solving the substitution box design problem, Mathematics, 10 (2022), 2172. https://doi.org/10.3390/math10132172 doi: 10.3390/math10132172
[14]
F. Artuğer, F. Özkaynak, SBOX-CGA: Substitution box generator based on chaos and genetic algorithm, Neural. Comput. App., 34 (2022), 20203–20211. https://doi.org/10.1007/s00521-022-07589-4
[15]
M. S. Fadhil, A. K. Farhan, M. N. Fadhil, Designing substitution box based on the 1D logistic map chaotic system, IOP Conf. Series: Mater. Sci. Eng., 1076 (2021), 012041. https://doi.org/10.1088/1757-899X/1076/1/012041 doi: 10.1088/1757-899X/1076/1/012041
[16]
A. Razaq, Iqra, M. Ahmad, M. A. Yousaf, S. Masood, A novel finite rings based algebraic scheme of evolving secure S-boxes for images encryption, Mult. Tools Appl., 80 (2021), 20191–20215. https://doi.org/10.1007/s11042-021-10587-8 doi: 10.1007/s11042-021-10587-8
[17]
I. Ullah, N. A. Azam, U. Hayat, Efficient and secure substitution box and random number generators over Mordell elliptic curves, J. Infor. Security Appl., 56 (2021), 102619. https://doi.org/10.1016/j.jisa.2020.102619 doi: 10.1016/j.jisa.2020.102619
[18]
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
[19]
A. A. A. El-Latif, J. Ramadoss, B. Abd-El-Atty, H. S. Khalifa, F. Nazarimehr, A novel chaos-based cryptography algorithm and its performance analysis, Mathematics, 10 (2022), 2434. https://doi.org/10.3390/math10142434 doi: 10.3390/math10142434
[20]
A. Razaq, G. Alhamzi, S. Abbas, M. Ahmad, A. Razzaque, Secure communication through reliable S-box design: A proposed approach using coset graphs and matrix operations, Heliyon, 9 (2023). https://doi.org/10.1016/j.heliyon.2023.e15902
[21]
M. A. Khan, A. Ali, V. Jeoti, S. Manzoor, A chaos-based substitution box (S-Box) design with improved differential approximation probability (DP), Iran. J. Sci. Technol. Trans. Electr. Eng., 42 (2018), 219–238. https://doi.org/10.1007/s40998-018-0061-9 doi: 10.1007/s40998-018-0061-9
[22]
F. Artuğer, F. Özkaynak, A novel method for performance improvement of chaos-based substitution boxes, Symmetry, 12 (2020), 571. https://doi.org/10.3390/sym12040571
[23]
A. Freyre-Echevarría, A. Alanezi, I. Martínez-Díaz, M. Ahmad, A. A. A. Abd El-Latif, H. Kolivand, et al., An external parameter independent novel cost function for evolving bijective substitution-boxes, Symmetry, 12 (2020), 1896. https://doi.org/10.3390/sym12111896
[24]
L. Chu, Y. Su, X. Zan, W. Lin, X. Yao, P. Xu, et al, A deniable encryption method for modulation-based DNA storage, Interdisciplinary Sciences: Comput. Life Sci., 16 (2024), 872–881. https://doi.org/10.1007/s12539-024-00648-5
[25]
X. Yao, R. Xie, X. Zan, Y. Su, P. Xu, W. Liu, A novel image encryption scheme for DNA storage systems based on DNA hybridization and gene mutation, Inter. Sci. Comput. Life Sci., 15 (2023), 419–432. https://doi.org/10.1007/s12539-023-00565-z doi: 10.1007/s12539-023-00565-z
[26]
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
[27]
S. Gao, H. H. C. Iu, J. Mou, U. Erkan, J. Liu, R. Wu, et al., Temporal action segmentation for video encryption, Chaos Solitons Fract., 183 (2024), 114958. https://doi.org/10.1016/j.chaos.2024.114958
[28]
S. Gao, H. H. C. Iu, M. Wang, D. Jiang, A. A. Abd El-Latif, R. Wu, et al., Design, hardware implementation, and application in video encryption of the 2-D memristive cubic map, IEEE Int. Things J., 11 (2024), 21807–21815. https://doi.org/10.1109/JIOT.2024.3376572
[29]
C. Fan, Q. Ding, A universal method for constructing non-degenerate hyperchaotic systems with any desired number of positive Lyapunov exponents, Chaos Solitons Fract., 161 (2022), 112323. https://doi.org/10.1016/j.chaos.2022.112323 doi: 10.1016/j.chaos.2022.112323
[30]
S. Gao, J. Liu, H. H. C. Iu, U. Erkan, S. Zhou, R. Wu, et al., Development of a video encryption algorithm for critical areas using 2D extended Schaffer function map and neural networks, Appl. Math. Model., 134 (2024), 520–537. https://doi.org/10.1016/j.apm.2024.06.016
[31]
M. Wang, X. Fu, L. Teng, X. Yan, Z. Xia, P. Liu, A new 2D-HELS hyperchaotic map and its application on image encryption using RNA operation and dynamic confusion, Chaos Solitons Fract., 183 (2024), 114959. https://doi.org/10.1016/j.chaos.2024.114959 doi: 10.1016/j.chaos.2024.114959
Q. Mushtaq, A. Razaq, Homomorphic images of circuits in PSL(2, Z)-space, Bull. Malaysian Math. Sci. Society, 40 (2017), 1115–1133. https://doi.org/10.1007/s40840-016-0357-8
[34]
Q. Mushtaq, A. Razaq, A. Yousaf, On contraction of vertices of the circuits in coset diagrams for PSL(2, Z), Proc. Math. Sci., 129 (2019), 1–26. https://doi.org/10.1007/s12044-018-0450-z
[35]
M. Conder, Three-relator quotients of the modular group, Quart. J. Math., 38 (1987), 427–447. https://doi.org/10.1093/qmath/38.4.427 doi: 10.1093/qmath/38.4.427
[36]
G. A. Jones, Maximal subgroups of the modular and other groups, J. Group Theory, 22 (2019), 277–296. https://doi.org/10.1515/jgth-2018-0144 doi: 10.1515/jgth-2018-0144
I. Hussain, T. Shah, H. Mahmood, 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
[39]
A. Altaleb, M. S. Saeed, I. Hussain, M. Aslam, An algorithm for the construction of substitution box for block ciphers based on projective general linear group, AIP Adv., 7 (2017), 035116. https://doi.org/10.1063/1.4978264 doi: 10.1063/1.4978264
[40]
S. Farwa, T. Shah, L. Idrees, A highly nonlinear S-box based on a fractional linear transformation, Spr. Plus, 5 (2016), 1658. https://doi.org/10.1186/s40064-016-3298-7 doi: 10.1186/s40064-016-3298-7
[41]
J. Pieprzyk, G. Finkelstein, Towards effective nonlinear cryptosystem design, IEE Proc. E-Comput. Digital Tech., 135 (1988), 325–335. https://doi.org/10.1049/ip-e.1988.0044 doi: 10.1049/ip-e.1988.0044
U. Hayat, N. A. Azam, H. R. Gallegos-Ruiz, S. Naz, L. Batool, A truly dynamic substitution box generator for block ciphers based on elliptic curves over finite rings, Arabian J. Sci. Engineer., 46 (2021), 1–13. https://doi.org/10.1007/s13369-021-05666-9 doi: 10.1007/s13369-021-05666-9
[45]
S. Ibrahim, A. M. Abbas, Efficient key-dependent dynamic S-boxes based on permutated elliptic curves, Inf. Sci., 558 (2021), 246–264. https://doi.org/10.1016/j.ins.2021.01.014 doi: 10.1016/j.ins.2021.01.014
[46]
B. M. Alshammari, R. Guesmi, T. Guesmi, H. Alsaif, A. Alzamil, Implementing a symmetric lightweight cryptosystem in highly constrained IoT devices by using a chaotic S-box, Symmetry, 13 (2021), 129. https://doi.org/10.3390/sym13010129 doi: 10.3390/sym13010129
[47]
H. S. Alhadawi, M. A. Majid, D. Lambić, M. A. Ahmad, A novel method of S-box design based on discrete chaotic maps and cuckoo search algorithm, Multimed. Tools Appl.,80 (2021), 7333–7350. https://doi.org/10.1007/s11042-020-10048-8 doi: 10.1007/s11042-020-10048-8
[48]
M. Long, L. Wang, S-box design based on discrete chaotic map and improved artificial bee colony algorithm, IEEE Access, 9 (2021), 86144–86154. https://doi.org/10.1109/ACCESS.2021.3069965 doi: 10.1109/ACCESS.2021.3069965
[49]
R. Soto, B. Crawford, F. G. Molina, R. Olivares, Human Behaviour based optimization supported with self-organizing maps for solving the S-box design problem, IEEE Access, 9 (2021), 84605–84618. https://doi.org/10.1109/ACCESS.2021.3087139 doi: 10.1109/ACCESS.2021.3087139
[50]
W. Yan, Q. Ding, A novel S-box dynamic design based on nonlinear-transform of 1D chaotic maps, Electronics, 10 (2021), 1313. https://doi.org/10.3390/electronics10111313 doi: 10.3390/electronics10111313
[51]
P. Zhou, J. Du, K. Zhou, S. Wei, 2D mixed pseudo-random coupling PS map lattice and its application in S-box generation, Nonlinear Dyn., 103 (2021), 1151–1166. https://doi.org/10.1007/s11071-020-06098-0 doi: 10.1007/s11071-020-06098-0
[52]
S. S. Jamal, M. M. Hazzazi, M. F. Khan, Z. Bassfar, A. Aljaedi, Z. ul Islam, Region of interest-based medical image encryption technique based on chaotic S-boxes, Expert Syst. Appl., 238 (2024), 122030. https://doi.org/10.1016/j.eswa.2023.122030
[53]
M. Wang, H. Liu, M. Zhao, Construction of a non-degeneracy 3D chaotic map and application to image encryption with keyed S-box, Mult. Tools Appl., 82 (2023), 34541–34563. https://doi.org/10.1007/s11042-023-14988-9 doi: 10.1007/s11042-023-14988-9
[54]
A. Razaq, L. A. Maghrabi, M. Ahmad, Q. H. Naith, Novel substitution-box generation using group theory for secure medical image encryption in E-healthcare, AIMS Math.,9 (2024), 6207–6237. https://doi.org/10.3934/math.2024303 doi: 10.3934/math.2024303
[55]
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
[56]
A. A. Alzaidi, M. Ahmad, H. S. Ahmed, E. A. Solami, Sine-cosine optimization-based bijective substitution-boxes construction using enhanced dynamics of chaotic map, Complexity, 2018 (2018), 1–16. https://doi.org/10.1155/2018/9389065 doi: 10.1155/2018/9389065
[57]
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
[58]
H.S. Alhadawi, D. Lambic, M.F. Zolkipli, M. Ahmad, Globalized firefly algorithm and chaos for designing substitution box, J. Inf. Security Appl., 55 (2020), 1–13. https://doi.org/10.1016/j.jisa.2020.102671 doi: 10.1016/j.jisa.2020.102671
Y. Aydin, A. M. Garipcan, F. Özkaynak, A novel secure S-box design methodology based on FPGA and SHA-256 hash algorithm for block cipher algorithms, Arab. J. Sci. Eng., 2024, 1–14. https://doi.org/10.1007/s13369-024-09251-8
[61]
I. Hussain, T. Shah, M.A. Gondal, H. Mahmood, Generalized majority logic criterion to analyze the statistical strength of S-boxes, Z Nat. A, 67 (2012), 282–288. https://doi.org/10.5560/zna.2012-0022 doi: 10.5560/zna.2012-0022
This article has been cited by:
1.
BADER S. ALMOHAIMEED,
A NEGATIVE BINOMIAL AUTOREGRESSION WITH A LINEAR CONDITIONAL VARIANCE-TO-MEAN FUNCTION,
2022,
30,
0218-348X,
10.1142/S0218348X22402393
2.
Bader S. Almohaimeed,
Correction: Periodic stationarity conditions for mixture periodic INGARCH models,
2022,
7,
2473-6988,
18280,
10.3934/math.20221005
Abdul Razaq, Muhammad Mahboob Ahsan, Hanan Alolaiyan, Musheer Ahmad, Qin Xin. Enhancing the robustness of block ciphers through a graphical S-box evolution scheme for secure multimedia applications[J]. AIMS Mathematics, 2024, 9(12): 35377-35400. doi: 10.3934/math.20241681
Abdul Razaq, Muhammad Mahboob Ahsan, Hanan Alolaiyan, Musheer Ahmad, Qin Xin. Enhancing the robustness of block ciphers through a graphical S-box evolution scheme for secure multimedia applications[J]. AIMS Mathematics, 2024, 9(12): 35377-35400. doi: 10.3934/math.20241681