Cryptography serves as the cornerstone for safe communication and data security in today's digital environment. Because they feature substitution boxes, substitution-permutation networks (SPNs) are crucial for cryptographic algorithms such as the popular Advanced Encryption Standard (AES). The structure and properties of S-boxes have a significant impact on the overall security of cryptographic systems. This article aims to improve cryptographic security through unique S-box construction methodologies. The proposed S-boxes improve the security features by employing chaotic maps and Galois fields, which go beyond traditional design approaches. The S-boxes were analyzed and the weaknesses were removed to design strong candidate S-boxes. The efficiency of the proposed S-boxes in increasing cryptographic resilience is thoroughly explored thereby taking nonlinearity, strict avalanche requirements, bit independence constraints, linear approximation, and differential approximation into account. The dynamic S-boxes have average scores of nonlinearity, strict avalanche criteria(SAC), nonlinearity of Bit Independence Criteria (BIC Nonlinearity), SAC of Bit Independence Criteria (BIC SAC), Linear Approximation Probability (LAP) and Differential Approximation Probability (DAP) is 111.1025, 111.1022, 0.5014, 0.5024, 111.1082, 111.0964, 0.5024, 0.5022, 0.0726, 0.0729 and 0.0214, 0.0219, respectively. Furthermore, given the prevalence of images in modern communication and data storage, this work studies the seamless incorporation of advanced S-boxes into image encryption systems. With its thorough research, the paper contributes to the current discussion on cryptographic security by providing theoretical understandings and practical solutions to improve digital communication and data security in an era of rising cyber dangers and ubiquitous connectivity.
Citation: Mohammad Mazyad Hazzazi, Gulraiz, Rashad Ali, Muhammad Kamran Jamil, Sameer Abdullah Nooh, Fahad Alblehai. Cryptanalysis of hyperchaotic S-box generation and image encryption[J]. AIMS Mathematics, 2024, 9(12): 36116-36139. doi: 10.3934/math.20241714
[1] | Muhammad Farman, Ali Akgül, Kottakkaran Sooppy Nisar, Dilshad Ahmad, Aqeel Ahmad, Sarfaraz Kamangar, C Ahamed Saleel . Epidemiological analysis of fractional order COVID-19 model with Mittag-Leffler kernel. AIMS Mathematics, 2022, 7(1): 756-783. doi: 10.3934/math.2022046 |
[2] | Iqbal M. Batiha, Abeer A. Al-Nana, Ramzi B. Albadarneh, Adel Ouannas, Ahmad Al-Khasawneh, Shaher Momani . Fractional-order coronavirus models with vaccination strategies impacted on Saudi Arabia's infections. AIMS Mathematics, 2022, 7(7): 12842-12858. doi: 10.3934/math.2022711 |
[3] | Shao-Wen Yao, Muhammad Farman, Maryam Amin, Mustafa Inc, Ali Akgül, Aqeel Ahmad . Fractional order COVID-19 model with transmission rout infected through environment. AIMS Mathematics, 2022, 7(4): 5156-5174. doi: 10.3934/math.2022288 |
[4] | Ihtisham Ul Haq, Nigar Ali, Hijaz Ahmad, Taher A. Nofal . On the fractional-order mathematical model of COVID-19 with the effects of multiple non-pharmaceutical interventions. AIMS Mathematics, 2022, 7(9): 16017-16036. doi: 10.3934/math.2022877 |
[5] | Murugesan Sivashankar, Sriramulu Sabarinathan, Vediyappan Govindan, Unai Fernandez-Gamiz, Samad Noeiaghdam . Stability analysis of COVID-19 outbreak using Caputo-Fabrizio fractional differential equation. AIMS Mathematics, 2023, 8(2): 2720-2735. doi: 10.3934/math.2023143 |
[6] | Maryam Amin, Muhammad Farman, Ali Akgül, Mohammad Partohaghighi, Fahd Jarad . Computational analysis of COVID-19 model outbreak with singular and nonlocal operator. AIMS Mathematics, 2022, 7(9): 16741-16759. doi: 10.3934/math.2022919 |
[7] | C. W. Chukwu, Fatmawati . Modelling fractional-order dynamics of COVID-19 with environmental transmission and vaccination: A case study of Indonesia. AIMS Mathematics, 2022, 7(3): 4416-4438. doi: 10.3934/math.2022246 |
[8] | Mohammed A. Almalahi, Satish K. Panchal, Fahd Jarad, Mohammed S. Abdo, Kamal Shah, Thabet Abdeljawad . Qualitative analysis of a fuzzy Volterra-Fredholm integrodifferential equation with an Atangana-Baleanu fractional derivative. AIMS Mathematics, 2022, 7(9): 15994-16016. doi: 10.3934/math.2022876 |
[9] | Aqeel Ahmad, Cicik Alfiniyah, Ali Akgül, Aeshah A. Raezah . Analysis of COVID-19 outbreak in Democratic Republic of the Congo using fractional operators. AIMS Mathematics, 2023, 8(11): 25654-25687. doi: 10.3934/math.20231309 |
[10] | Huda Alsaud, Muhammad Owais Kulachi, Aqeel Ahmad, Mustafa Inc, Muhammad Taimoor . Investigation of SEIR model with vaccinated effects using sustainable fractional approach for low immune individuals. AIMS Mathematics, 2024, 9(4): 10208-10234. doi: 10.3934/math.2024499 |
Cryptography serves as the cornerstone for safe communication and data security in today's digital environment. Because they feature substitution boxes, substitution-permutation networks (SPNs) are crucial for cryptographic algorithms such as the popular Advanced Encryption Standard (AES). The structure and properties of S-boxes have a significant impact on the overall security of cryptographic systems. This article aims to improve cryptographic security through unique S-box construction methodologies. The proposed S-boxes improve the security features by employing chaotic maps and Galois fields, which go beyond traditional design approaches. The S-boxes were analyzed and the weaknesses were removed to design strong candidate S-boxes. The efficiency of the proposed S-boxes in increasing cryptographic resilience is thoroughly explored thereby taking nonlinearity, strict avalanche requirements, bit independence constraints, linear approximation, and differential approximation into account. The dynamic S-boxes have average scores of nonlinearity, strict avalanche criteria(SAC), nonlinearity of Bit Independence Criteria (BIC Nonlinearity), SAC of Bit Independence Criteria (BIC SAC), Linear Approximation Probability (LAP) and Differential Approximation Probability (DAP) is 111.1025, 111.1022, 0.5014, 0.5024, 111.1082, 111.0964, 0.5024, 0.5022, 0.0726, 0.0729 and 0.0214, 0.0219, respectively. Furthermore, given the prevalence of images in modern communication and data storage, this work studies the seamless incorporation of advanced S-boxes into image encryption systems. With its thorough research, the paper contributes to the current discussion on cryptographic security by providing theoretical understandings and practical solutions to improve digital communication and data security in an era of rising cyber dangers and ubiquitous connectivity.
Similar to congruences on a semigroup, strongly regular relations on a semihypergroup (see [1]) play an important role in studying the algebraic structure of a semihypergroup. For example, M. De Salvo, D. Fasino, D. Freni and G. Lo Faro characterize and enumerate certain hypergroup classes based on the partition induced by the smallest strongly regular relation in [2,3].
A hypergroupoid (S,∘) is a nonempty set S together with a hyperoperation, that is a mapping ∘:S×S→P∗(S), where P∗(S) denotes the family of all nonempty subsets of S. If x∈S and A,B are nonempty subsets of S, then we denote
A∘B=⋃a∈A,b∈Ba∘b, |
x∘A={x}∘A, |
A∘x=A∘{x}. |
A hypergroupoid (S,∘) is called a semihypergroup if ∘ is associative, that is
x∘(y∘z)=(x∘y)∘z, |
for every x,y,z∈S. If a semihypergroup S contains an element 1 with the property that
(∀x∈S)x∘1=1∘x={x}, |
then we say that 1 is an absolute identity. Clearly, a semihypergroup has at most an absolute identity. If a semihypergroup S has no absolute identity, then we adjoin an extra element 1 to S and define
1∘1={1}, |
(∀s∈S)1∘s=s∘1={s}. |
Thus S∪{1} becomes a semihypergroup containing an absolute identity. We now define
S1={SifShas an absolute identity,S∪{1}otherwise. |
Let (S,∘) be a semihypergroup and ρ a binary relation on S. If A and B are nonempty subsets of S, then we set
AˉρB⇔(∀a∈A,∃b∈B)aρband(∀b′∈B,∃a′∈A)a′ρb′, |
and
AˉˉρB⇔aρb(∀a∈A,∀b∈B). |
A binary relation ρ on S is called left strongly compatible if
(∀a,b,x∈S)aρb⇒(x∘a)ˉˉρ(x∘b), |
and right strongly compatible if
(∀a,b,x∈S)aρb⇒(a∘x)ˉˉρ(b∘x). |
A binary relation on S is called strongly compatible if it is both left and right strongly compatible. An equivalence relation on S is called strongly regular if it is strongly compatible.
Let (S,∘) be a semihypergroup and ρ a strongly regular relation on S. We denote by (a)ρ the equivalence ρ-class containing a. It is well known from [1] that the quotient S/ρ is a semigroup with respect to the operation (x)ρ⋆(y)ρ=(z)ρ for every z∈x∘y. Let ρ be any relation on a nonempty set S. Then ρ∞ denotes the transitive closure of ρ, that is, ρ∞=∪m≥1ρm. The least strongly regular relation (fundamental relation) [4] β∗=β∞ is the transitive closure of the relation β=∪n≥1βn, where
β1=1S={(x,x)∣x∈S} |
is the diagonal relation on S, and for every integer n>1,βn is defined as follows
xβny⇔(∃(x1,x2,⋯,xn)∈Sn){x,y}⊆n∏i=1xi. |
A strongly regular relation ρ on S is called commutative if the quotient S/ρ is a commutative semigroup. The least commutative relation [5] γ∗=γ∞ is the transitive closure of the relation γ=∪n≥1γn, where
γ1=1S={(x,x)∣x∈S} |
is the diagonal relation on S, and for every integer n>1,γn is defined as follows
xγny⇔(∃(x1,x2,⋯,xn∈Sn,∃σ∈Sn))x∈n∏i=1xi,y∈n∏i=1xσi. |
By constructing special strongly regular relations on a semihypergroup, we can obtain some special quotient structures (see [6,7,8,9,10,11]). In this regards, we give a unified method for constructing special strongly regular relations. A strongly regular relation ρ on S is called a band relation if the quotient S/ρ is a band, and a semilattice relation if the quotient S/ρ is a semilattice, that is ρ is both a band relation and commutative. In this paper, we introduce three preliminary relations on a semihypergroup. Using these relations, we construct the commutative relation, the band relation and the semilattice relation generated by a given binary relation. As consequences, the least commutative relation, the least band relation and the least semilattice relation on S are given. Moreover, we show that the set of all commutative relations, the set of all band relations and the set of all semilattice relations on S are complete lattices.
Let (S,∘) be a semihypergroup and ρ a binary relation on S. We denote by ρrs the relation ρ∪ρ−1∪1S on S. It is obvious that ρrs is the smallest reflexive and symmetric relation containing ρ. Let {ρi∣i∈I} be the family of all strongly regular relations on S containing ρ. Then the relation ⋂i∈Iρi is clearly the least strongly regular relation on S containing ρ, which is called the strongly regular relation on S generated by ρ. Similarly, the least commutative (resp. band, semilattice) relation on S containing ρ, denoted by ρc (resp. ρb, ρs), is called the commutative (resp. band, semilattice) relation on S generated by ρ.
Definition 2.1. Let ρ be a binary relation on a semihypergroup (S,∘). We define the relation ρsc on S as
uρscv⇔(∃(x1,x2,⋯,xm)∈(S1)m,(y1,y2,⋯,yn)∈(S1)n)(∃(a,b)∈ρ),u∈m∏i=1xi∘a∘n∏j=1yj,v∈m∏i=1xi∘b∘n∏j=1yj. |
It is easy to see that ρsc has the following property.
Lemma 2.1. Let ρ and σ be two relations on a semihypergroup (S,∘). Then
(i) ρ⊆σ⇒ρsc⊆σsc;
(ii) (ρsc)−1=(ρ−1)sc;
(iii) (ρ∪σ)sc=ρsc∪σsc.
Lemma 2.2. Let ρ be a binary relation on a semihypergroup (S,∘). Then ρsc is the least strongly compatible relation on S containing ρ.
Proof. (1) If (u,v)∈ρ, then (u,v)∈(1∘u∘1)×(1∘v∘1). Thus (u,v)∈ρsc and so ρ⊆ρsc.
(2) Let (u,v)∈ρ and w∈S. Then
(u,v)∈(m∏i=1xi∘a∘n∏j=1yj)×(m∏i=1xi∘b∘n∏j=1yj) |
for some x1,x2,⋯,xm,y1,y2,⋯,yn∈S1 and some (a,b)∈ρ. Hence
w∘u⊆(w∘m∏i=1xi)∘a∘n∏j=1yj, |
w∘v⊆(w∘m∏i=1xi)∘b∘n∏j=1yj, |
and so
(w∘u)¯¯ρsc(w∘v). |
Therefore, ρsc is left strongly compatible. In the same way, we can obtain that ρsc is right strongly compatible.
(3) Suppose that σ is a strongly compatible relation on S containing ρ. Then for all x1,x2,⋯,xm,y1,y2,⋯,yn∈S1 and all (a,b)∈ρ, we have
(m∏i=1xi∘a∘n∏j=1yj)ˉˉσ(m∏i=1xi∘b∘n∏j=1yj). |
Hence, ρsc⊆σ.
Lemma 2.3. Let ρ be a binary relation on a semihypergroup (S,∘). Then (ρsc)∞ is a strongly compatible relation on S.
Proof. Let (u,v)∈(ρsc)∞. Then (u,v)∈(ρsc)n for some positive integer n. Thus there exist a1,a2,⋯,an−1∈S such that
uρsca1ρsca2ρsc⋯ρscan−1ρscv. |
It follows from Lemma 2.2 that
(w∘u)¯¯ρsc(w∘a1)¯¯ρsc(w∘a2)¯¯ρsc⋯¯¯ρsc(w∘an−1)¯¯ρsc(w∘v) |
for all w∈S. Hence
(w∘u)¯¯(ρsc)n(w∘v) |
and so
(w∘u)¯¯(ρsc)∞(w∘v). |
Similarly,
(u∘w)¯¯(ρsc)∞(v∘w). |
Therefore, (ρsc)∞ is strongly compatible.
Denote
C=⋃a,b∈S{(x,y)∣x∈a∘b,y∈b∘a},B=⋃a∈S{(a,b)∣b∈a∘a},S=C∪B. |
Theorem 2.1. Let ρ be a binary relation on a semihypergroup (S,∘). Then
(i) ρc=(((ρ∪C)rs)sc)∞;
(ii) ρb=(((ρ∪B)rs)sc)∞;
(iii) ρs=(((ρ∪S)rs)sc)∞.
Proof. (i) Denote δ=(((ρ∪C)rs)sc)∞. It is easy to see that δ is an equivalence relation containing ρ and C on S. Moreover, by Lemma 2.2 and 2.3, we have δ is strongly compatible. Therefore, δ is a strongly regular relation on S. Thus (S/δ,⋆) is a semigroup, where the operation ⋆ is defined as
(a)δ⋆(b)δ=(x)δ(∀x∈a∘b) |
for every a,b∈S. Next, we show that S/δ is commutative. In fact, for any x∈a∘b and y∈b∘a, we have xCy and so xδy. Hence,
(a)δ⋆(b)δ=(x)δ=(y)δ=(b)δ⋆(a)δ. |
Suppose that σ is a commutative relation on S containing ρ. It is obvious that C⊆σ. Then
(ρ∪C)rs=(ρ∪C)∪(ρ∪C)−1∪1S⊆σ∪σ−1∪1S=σ. |
Hence
((ρ∪C)rs)sc⊆σsc=σ |
from Lemma 2.1 and 2.2. Therefore,
(((ρ∪C)rs)sc)∞⊆σ∞=σ. |
Thus, we obtain our conclusion.
The conclusions (ii) and (iii) can be obtained by applying the similar approach in the proof of (i).
From Theorem 2.1, we can obtain the least commutative relation which is also given in another form γ∗ (see [5]), the least band relation and the least semilattice relation on a semihypergroup.
Corollary 2.1. Let S be a semihypergroup. Then ((Crs)sc)∞ (resp. ((Brs)sc)∞, ((Srs)sc)∞) is the least commutative (resp. band, semilattice) relation on S.
Let S be a semihypergroup. We denote by C(S),B(S) and SL(S) the set of all commutative relations, the set of all band relations and the set of all semilattice relations on S respectively. It is obvious that C(S),B(S) and SL(S) are partially ordered sets under the set inclusion. In the following, we show that (C(S),⊆,∩,∨c), (B(S),⊆,∩,∨b) and (SL(S),⊆,∩,∨s) are complete lattices where ∨c,∨b and ∨s are defined as
ρ∨cσ=(ρ∪σ)c,ρ∨bσ=(ρ∪σ)b,ρ∨sσ=(ρ∪σ)s. |
A meet-semilattice (∩-semilattice) L is said to be ∩-complete if every subset of L has a minimum element. Dually, a join-semilattice (∪-semilattice) L is said to be ∪-complete if every subset of L has a maximum element. A lattice is said to be complete if it is both ∩-complete and ∪-complete.
Lemma 3.1. (Theorem 2.11 [12]) A ∩-complete ∩-semilattice is a complete lattice if and only if it has a maximum element.
Theorem 3.1. Let (S,∘) be a semihypergroup. Then (C(S),⊆,∩,∨c), (B(S),⊆,∩,∨b) and (SL(S),⊆,∩,∨s) are complete lattices.
Proof. We just prove that (C(S),⊆,∩,∨c) is a complete lattice. Using the similar approach, we can obtain that (B(S),⊆,∩,∨b) and (SL(S),⊆,∩,∨s) are also complete lattices.
It is obvious that the universal relation S×S is the maximum element of C(S). From Lemma 3.1, we need only show that C(S) is a ∩-complete ∩-semilattice. Let {ρα∣α∈Γ} be a family of commutative relations on S. Then ⋂α∈Γρα is a commutative relation on S. Indeed, we know from [13] that ⋂α∈Γρα is a strongly regular relation on S. Thus (S/⋂α∈Γρα,⋆) is a semigroup, where the operation ⋆ is defined as
(a)⋂α∈Γρα⋆(b)⋂α∈Γρα=(x)⋂α∈Γρα(∀x∈a∘b) |
for every a,b∈S. For any x∈a∘b and y∈b∘a, we have xCy. It follows from C⊆⋂α∈Γρα that x⋂α∈Γραy. Hence, (S/⋂α∈Γρα,⋆) is a commutative semigroup and so ⋂α∈Γρα∈C(S).
Remark 3.1. Let (S,∘) be a semihypergroup. We know from Theorem 3.1 that C(S),B(S) and SL(S) are all complete lattices. Moreover, it is easy to see that SL(S)=C(S)∩B(S) as lattices.
At the end of this paper, we illustrate our main results by the following example.
Example 3.1. Let S={a,b,c,d} with the operation ∘ below:
∘abcda{a,d}{a,d}{a,d}{a}b{a,d}{b}{a,d}{a,d}c{a,d}{a,d}{c}{a,d}d{a}{a,d}{a,d}{d} |
Then (S,∘) is a semihypergroup. It is obvious that S={(a,a),(a,d),(b,b),(c,c),(d,a),(d,d)}. Define two relations ρ1={(a,b)} and ρ2={(a,c)}. Then we have
Ss=S, |
ρs1=S∪{(a,b),(b,a),(b,d),(d,b)}, |
ρs2=S∪{(a,c),(c,a),(c,d),(d,c)}, |
(ρ1∪ρ2)s=S×S. |
Moreover, it is not difficult to verify that SL(S)={S,ρs1,ρs2,S×S}. Since S=ρs1∩ρs2 and ρs1∨sρs2=S×S, we have (SL(S),⊆,∩,∨s) is a complete lattice.
Let ρ be a binary relation on a semihypergroup S. In this paper, we characterize the commutative relation ρc (resp. band relation ρb, semilattice relation ρs) generated by ρ on S. Finally, we show that the set of all commutative relations C(S) (resp. band relations B(S), semilattice relations SL(S)) on S is a complete lattice.
The author thanks the editor and referees whose comments led to significant improvements to this paper. This work is supported by the National Natural Science Foundation of China (No. 11701504), the Guangdong Basic and Applied Basic Research Foundation (No. 2022A1515011081), the Characteristic Innovation Project of Department of Education of Guangdong Province (No. 2020KTSCX159), the Innovative Research Team Project of Zhaoqing University and the Scientific Research Ability Enhancement Program for Excellent Young Teachers of Zhaoqing University.
The author declares no conflict of interest.
[1] |
L. Zhang, Y. Lin, X. Yang, T. Chen, X. Cheng, W. Cheng, From sample poverty to rich feature learning: A new metric learning method for few-shot classification, IEEE Access, 12 (2024), 124990–125002. https://doi.org/10.1109/ACCESS.2024.3444483 doi: 10.1109/ACCESS.2024.3444483
![]() |
[2] |
Y. Lin, Z. Xie, T. Chen, X. Cheng, H. Wen, Image privacy protection scheme based on high-quality reconstruction DCT compression and nonlinear dynamics, Expert Syst. Appl., 257 (2024), 124891. https://doi.org/10.1016/j.eswa.2024.124891 doi: 10.1016/j.eswa.2024.124891
![]() |
[3] | L. Cui, Y. Cao, A new S-box structure named affine-power-affine, Int. J Innov. Comput. Info. Ctrl, 3 (2007), 751–759. Available from: https://citeseerx.ist.psu.edu/document?repid=rep1&type=pdf&doi=8044cda70fa8d0a18ff4708df185476bb92f3f7a |
[4] |
H. Liu, A. Kadir, P. Gong, A fast color image encryption scheme using one-time S-Boxes based on complex chaotic system and random noise, Optics commun., 338 (2015), 340–347. https://doi.org/10.1016/j.optcom.2014.10.021 doi: 10.1016/j.optcom.2014.10.021
![]() |
[5] |
X. Wang, Q. Wang, A novel image encryption algorithm based on dynamic S-boxes constructed by chaos, Nonlinear Dyn., 75 (2014), 567–576. https://doi.org/10.1007/s11071-013-1086-2 doi: 10.1007/s11071-013-1086-2
![]() |
[6] | I. Hussain, T. Shah, H. Mahmood, A new algorithm to construct secure keys for AES, Int. J. Contemp. Math. Sci., 5 (2010), 1263. Available from: https://m-hikari.com/ijcms-2010/25-28-2010/hussainIJCMS25-28-2010.pdf |
[7] |
X. Zhang, Y. Mao, Z. Zhao, An efficient chaotic image encryption based on alternate circular S-boxes, Nonlinear Dyn., 78 (2014), 359–369. https://doi.org/10.1007/s11071-014-1445-7 doi: 10.1007/s11071-014-1445-7
![]() |
[8] |
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
![]() |
[9] |
R. Ali, M. K. Jamil, A. S. Alali, J. Ali, G. Afzal, A robust S-box design using cyclic groups and image encryption, IEEE Access, 11 (2023), 135880–135890. https://doi.org/10.1109/ACCESS.2023.3337443 doi: 10.1109/ACCESS.2023.3337443
![]() |
[10] |
R. Liu, H. Liu, M. Zhao, Reveal the correlation between randomness and Lyapunov exponent of n-dimensional non-degenerate hyper chaotic map, Integration, 93 (2023), 102071. https://doi.org/10.1016/j.vlsi.2023.102071 doi: 10.1016/j.vlsi.2023.102071
![]() |
[11] |
C. Luo, Y. Wang, Y. Fu, P. Zhou, M. Wang, Constructing dynamic S-boxes based on chaos and irreducible polynomials for image encryption, Nonlinear Dyn., 112 (2024), 1–19. https://doi.org/10.1007/s11071-024-09353-w doi: 10.1007/s11071-024-09353-w
![]() |
[12] |
B. M. Savadkouhi, A. M. Tootkaboni, S-Boxes design based on the Lu-Chen system and their application in image encryption, Soft Comput., 28 (2024), 1–22. https://doi.org/10.1007/s00500-024-09912-8 doi: 10.1007/s00500-024-09912-8
![]() |
[13] |
R. Ali, J. Ali, P. Ping, M. K. Jamil, A novel S-box generator using Frobenius automorphism and its applications in image encryption, Nonlinear Dyn., 1 (2024), 1–24. https://doi.org/10.1007/s11071-024-10003-4 doi: 10.1007/s11071-024-10003-4
![]() |
[14] |
D. Ustun, S. Sahinkaya, N. Atli, Developing a secure image encryption technique using a novel S-box constructed through real-coded genetic algorithm's crossover and mutation operators, Expert Syst. Appl., 256 (2024), 124904. https://doi.org/10.1016/j.eswa.2024.124904 doi: 10.1016/j.eswa.2024.124904
![]() |
[15] |
Q. Lai, G. Hu, A nonuniform pixel split encryption scheme integrated with compressive sensing and its application in IoMT, IEEE Trans. Ind. Electron., 20 (2024), 11262–11272. https://doi.org/10.1109/TII.2024.3403266 doi: 10.1109/TII.2024.3403266
![]() |
[16] | S. Gao, H. H. C. Iu, U. Erkan, C. Şimşek, J. Mou, A. Toktas, Design, dynamical analysis, and hardware implementation of a novel memcapacitive hyperchaotic logistic map, IEEE Internet Things J., 11 (2024), 30368–30375. Available from: https://ieeexplore.ieee.org/abstract/document/10552354 |
[17] |
Z. Xie, Y. Lin, T. Liu, H. Wen, Face privacy protection scheme by security-enhanced encryption structure and nonlinear dynamics, IScience, 27 (2024), 110768. https://doi.org/10.1016/j.isci.2024.110768 doi: 10.1016/j.isci.2024.110768
![]() |
[18] |
Y. Wang, Z. Zhang, L. Y. Zhang, J. Feng, J. Gao, P. Lei, A genetic algorithm for constructing bijective substitution boxes with high nonlinearity, Info. Sci., 523 (2020), 152–166. https://doi.org/10.1016/j.ins.2020.03.025 doi: 10.1016/j.ins.2020.03.025
![]() |
[19] |
Q. Lai, L. Yang, G. Chen, Two-dimensional discrete memristive oscillatory hyperchaotic maps with diverse dynamics, IEEE Trans. Ind. Electron., 72 (2024), 969–979. https://doi.org/10.1109/TIE.2024.3417974 doi: 10.1109/TIE.2024.3417974
![]() |
[20] |
M. Wang, H. Liu, M. Zhao, Construction of a non-degeneracy 3D chaotic map and application to image encryption with keyed S-box, Multimed. Tools Appl., 82 (2023), 34541–34563. https://doi.org/10.1007/s11042-023-14988-9 doi: 10.1007/s11042-023-14988-9
![]() |
[21] |
R. Liu, H. Liu, M. Zhao, Cryptanalysis and construction of keyed strong S-Box based on random affine transformation matrix and 2D hyper chaotic map, Expert Syst. Appl., 252 (2024), 124238. https://doi.org/10.1016/j.eswa.2024.124238 doi: 10.1016/j.eswa.2024.124238
![]() |
[22] |
S. Yuanyuan, 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
![]() |
[23] |
M. Zhao, H. Liu, Y. Niu, Batch generating keyed strong S-Boxes with high nonlinearity using 2D hyper chaotic map, Integration, 92 (2023), 91–98. https://doi.org/10.1016/j.vlsi.2023.05.006 doi: 10.1016/j.vlsi.2023.05.006
![]() |
[24] | J. Pieprzyk, G. Finkelstein, Towards effective nonlinear cryptosystem design, IEEE Proc.-E: Comput. Digit. Tech., 135 (1988), 325–335. |
[25] |
J. Ali, M. K. Jamil, A. S. Alali, R. Ali, A medical image encryption scheme based on Mobius transformation and Galois field, Heliyon, 10 (2024), e23652. https://doi.org/10.1016/j.heliyon.2023.e23652 doi: 10.1016/j.heliyon.2023.e23652
![]() |
[26] |
Y. Ma, Y. Tian, L. Zhang, P. Zuo, Two-dimensional hyperchaotic effect coupled mapping lattice and its application in dynamic S-box generation, Nonlinear Dyn., 112 (2024), 1–32. https://doi.org/10.1007/s11071-024-09907-y doi: 10.1007/s11071-024-09907-y
![]() |
[27] | F. Artuger, F. Ozkaynak, A new chaotic system and its practical applications in substitution box and random number generator, Multimed. Tools Appl., 2024, 1–15. https://doi.org/10.1007/s11042-024-19053-7 |
[28] |
M. Vijayakumar, A. Ahilan, An optimized chaotic S-box for real-time image encryption scheme based on 4-dimensional memristive hyperchaotic map, Ain Shams Eng. J., 1 (2024), 102620. https://doi.org/10.1016/j.asej.2023.102620 doi: 10.1016/j.asej.2023.102620
![]() |
[29] |
S. Ullah, X. Liu, A. Waheed, S. Zhang, An efficient construction of S-box based on the fractional order Rabinovich Fabrikant chaotic system, Integration, 94 (2024), 102099. https://doi.org/10.1016/j.vlsi.2023.102099 doi: 10.1016/j.vlsi.2023.102099
![]() |
[30] |
A. S. Alali, R. Ali, M. K. Jamil, J. Ali, Gulraiz, Dynamic S-Box construction using mordell elliptic curves over galois field and its applications in image encryption, Mathematics, 12 (2024), 587. https://doi.org/10.3390/math12040587 doi: 10.3390/math12040587
![]() |
[31] |
A. Waheed, F. Subhan, S-box design based on logistic skewed chaotic map and modified Rabin-Karp algorithm: Applications to multimedia security, Phys. Scr., 99 (2024), 055236. 10.1088/1402-4896/ad3991 doi: 10.1088/1402-4896/ad3991
![]() |
[32] |
F. Artuger, Strong S-box construction approach based on Josephus problem, Soft Comput., 28 (2024), 1–13. https://doi.org/10.1007/s00500-024-09751-7 doi: 10.1007/s00500-024-09751-7
![]() |
[33] |
T. Shah, A. Elmoasry, S. I. Batool, M. Khan, Quantum harmonic oscillator and Schrödinger paradox based nonlinear confusion component, Int. J. Theor. Phys., 59 (2020), 3558–3573. https://doi.org/10.1007/s10773-020-04616-9 doi: 10.1007/s10773-020-04616-9
![]() |
[34] |
F. Artuger, F. Ozkaynak, A new algorithm to generate AES-like substitution boxes based on sine cosine optimization algorithm, Multimed. Tools Appl., 83 (2024), 38949–38964. https://doi.org/10.1007/s11042-023-17200-0 doi: 10.1007/s11042-023-17200-0
![]() |
[35] |
S. Ibrahim, A. M. Abbas, Efficient key-dependent dynamic S-boxes based on permuted elliptic curves, Info. Sci, 558 (2021), 246–264. https://doi.org/10.1016/j.ins.2021.01.014 doi: 10.1016/j.ins.2021.01.014
![]() |
[36] |
T. Haider, N. A. Azam, U. Hayat, Substitution box generator with enhanced cryptographic properties and minimal computation time, Expert Syst. Appl., 241 (2024), 122779. https://doi.org/10.1016/j.eswa.2023.122779 doi: 10.1016/j.eswa.2023.122779
![]() |
[37] |
A. F. Weister, S. E. Tavares, On the design of S-boxes, Adv. Crypt.-CRYPTO'85, 1 (1986), 1–15. https://doi.org/10.1007/3-540-39799-X\_41 doi: 10.1007/3-540-39799-X\_41
![]() |
[38] |
P. T. Akkasaligar, S. Biradar, Selective medical image encryption using DNA cryptography, Inf. Secur. J. Glob. Perspect., 29 (2020), 91–101. https://doi.org/10.1080/19393555.2020.1718248 doi: 10.1080/19393555.2020.1718248
![]() |
[39] |
W. Cao, Y. Zhou, C. L. P. Chen, L. Xia, Medical image encryption using edge maps, Signal Process., 132 (2017), 96–109. https://doi.org/10.1016/j.sigpro.2016.10.003 doi: 10.1016/j.sigpro.2016.10.003
![]() |
[40] |
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
![]() |
[41] |
B. Idrees, S. Zafar, T. Rashid, W. Gao, Image encryption algorithm using S-box and dynamic Hénon bit level permutation, Multimed. Tools Appl., 79 (2020), 6135–6162. https://doi.org/10.1007/s11042-019-08282-w doi: 10.1007/s11042-019-08282-w
![]() |
[42] |
P. Wang, Y. Wang, J. Xiang, X. Xiao, Fast image encryption algorithm for logistics-sine-cosine mapping, Sensors, 22 (2022), 9929. https://doi.org/10.3390/s22249929 doi: 10.3390/s22249929
![]() |
[43] |
A. Ur Rehman, X. Liaa, H. Wang, An innovative technique for image encryption using tri-partite graph and chaotic maps, Multimed. Tools Appl., 80 (2021), 21979–22005. https://doi.org/10.1007/s11042-021-10692-8 doi: 10.1007/s11042-021-10692-8
![]() |
[44] |
X. Chai, X. Fu, Z. Gan, A color image cryptosystem based on dynamic DNA encryption and chaos, Sign. Process., 155 (2019), 44–62. https://doi.org/10.1016/j.sigpro.2018.09.029 doi: 10.1016/j.sigpro.2018.09.029
![]() |