The DOI matches its Crossref record; 88 of the 88 references it cites were found in a registry or an index; 10 of the 27 sources its claims cite were checked for support.
Bijective S-Boxes Method Using Improved Chaotic Map-Based Heuristic Search and Algebraic Group Structures
Open accessAbstract
This paper presents a hybrid method for the construction of cryptographically strong bijective substitution-boxes by utilizing the merits of chaotic map and algebraic groups. The hybrid method first generates the key-dependent dynamic S-boxes using chaotic heuristic search strategy and then the S-boxes are evolved with the help of potent proposed algebraic group structures. This paper proposes a new improved combination chaotic map to operate initial search strategy. To augment the strength of generated S-boxes, the algebraic group structures are discovered which have the power to improve their cryptographic strength. The performance assessments using standard criterions are rendered to quantify the strengths of proposed bijective S-boxes. The experimental results and comparisons with recent S-box research findings justify the effectiveness and competence of the proposed bijective S-boxes and anticipated hybrid generation method.
Overview
CoChat Summary
## TL;DR
This paper proposes a hybrid method for constructing bijective S-boxes by combining an improved 1-D chaotic map with algebraic group actions. It reports variable-sized S-boxes from 5×5 to 8×8, with the 8×8 S-box achieving nonlinearity 114 and showing strong avalanche and cryptanalysis-resistance metrics.
## Key findings
- The proposed improved chaotic map was judged better than the logistic map, LSS map, and DSP map in the paper’s dynamical tests: it had larger Lyapunov exponent, more uniform bifurcation coverage of (0, 1), and higher approximate entropy; the paper reports ApEn of 1.1995 for the proposed map in one place and 1.3314 in Table 1.
- The heuristic search plus group actions produced bijective S-boxes of sizes 5×5, 6×6, 7×7, and 8×8.
- Reported average nonlinearities after group actions were 12 (5×5), 24.33 (6×6), 54 (7×7), and 114 (8×8); the paper says the 8×8 nonlinearity 114 exceeds the AES S-box bound of 112.
- The reported security metrics for the proposed S-boxes were: SAC 0.5600, 0.5104, 0.5006, 0.4978; DP 0.1875, 0.09375, 0.0625, 0.04687; and LAP 0.1325, 0.2188, 0.1718, 0.125 for 5×5 through 8×8, respectively.
## Methods
- The design is a two-stage hybrid: first, a chaos-based heuristic search generates key-dependent initial S-boxes; second, algebraic group actions are applied to improve their cryptographic strength.
- The paper tests variable-sized n×n S-boxes for 5 ≤ n ≤ 8; the chaotic-search stage is reported to have run with parameters X0 = 0.234, r = 3.9, l = 250, N = 1000, and generation times of 2.6 s (5×5), 6.154 s (6×6), 14.383 s (7×7), and 33.039 s (8×8).
- Main analysis includes Lyapunov exponent, bifurcation analysis, approximate entropy, nonlinearity, strict avalanche criterion (SAC), bits independence criterion (BIC), differential probability (DP), linear approximation probability (LAP), and an image-encryption test on the 256×256 Lena image.
## Limitations
- The paper explicitly says that the group-finding step “needs to be exclusively carried out for each S-box,” which indicates the method is not fully automatic across sizes or instances.
- The text makes evident that many formulae are not decoded in the provided version, so some definitions and derivations are not inspectable from this text alone (evident from the provided text).
- The reported results are largely comparative and experimental; the paper does not provide a formal proof that the method is optimal or universally superior (evident from the provided text).
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
5 Valid · 4 Not valid · 6 Not checked · 34 Own results and interpretations
The cited sources support only part of this claim — read each source’s verdict below.
In the paper
“The designs of variable sized key-dependent S-boxes have not been considered signi cantly in literature. There are few proposals that have investigated the design and construction of variable sized n n S-boxes restricted to sizes for 5 n 8 in [21].”
What the sources say
- Partly supportedcites [21] [21] E. Al Solami, M. Ahmad, C. Volos, M. Doja, and M. Beg, ''A new hyperchaotic system-based design for ef cient bijective substitution-boxes,'' Entropy , vol. 20, no. 7, p. 525, Jul. 2018. - sourceExperimental — accuracy not yet measured
Section 4.8 says methods for synthesizing S-boxes of varied small sizes are rarely investigated and identifies existing optimization-based methods for 5 ≤ n ≤ 8. It does not characterize those earlier methods as key-dependent, so that qualification is not supported by the cited passage. Page numbers are unavailable in our copy. (LLM, conf=0.85)
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Partly supported
The sources with a verdict support this claim; the rest weren’t checked yet, have no full text we could read, or their verdicts aren’t rated yet.
In the paper
“Moreover, another merit of our method is that the nonlinearity score of 114 is achieved for 8 8 S-box using the proposed method which is highest among all available 8 8 S-boxes in literature including [40], [42], [61], [67], [69], [77] [80].”
What the sources say
- Not checked — no full text of the sourcecites [40] [40] A. A. Alzaidi, M. Ahmad, M. N. Doja, E. A. Solami, and M. M. S. Beg, ''A new 1D chaotic map and -Hill climbing for generating substitutionboxes,'' IEEE Access , vol. 6, pp. 55405 55418, Oct. 2018. - source
- Supportedcites [42] [42] S. S. Jamal, A. Anees, M. Ahmad, M. F. Khan, and I. Hussain, ''Construction of cryptographic S-boxes based on mobius transformation and chaotic tent-sine system,'' IEEE Access , vol. 7, pp. 173273 173285, 2019. - source
The citation serves as an example of a published 8×8 S-box used for comparison, not as the source of the citing authors’ score of 114. The paper’s Proposed S-Boxes section describes its S-boxes, and Section IV evaluates their nonlinearity against other S-boxes; page numbers are unavailable in our copy. (LLM, conf=0.86)
- Not checked — no full text of the sourcecites [61] [61] Q. Lu, C. Zhu, and X. Deng, ''An ef cient image encryption scheme based on the LSS chaotic map and single S-box,'' IEEE Access , vol. 8, pp. 25664 25678, 2020. - source
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
Every source the paper cites for this claim was checked and supports it.
In the paper
“Alower value of this probability indicates that S-box is more capable to ght against linear cryptanalysis attack.”
What the sources say
- Supportedcites [58] [58] M. Matsui, ''Linear cryptanalysis method for DES cipher,'' in Advances in Cryptology (Lecture Notes in Computer Science). 1993, pp. 386 397. - source
Section 3.5 (Linear Probability) states that an S-box with low linear probability is a good cryptographic tool against linear cryptanalysis. Section 3.7 (Performance Comparison) likewise says a smaller LP value is desirable for resisting such attacks. (LLM, conf=0.94)
hedgedstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
- Supported
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“| ApEn | 0.4473 | 0.6053 | 0.5237 | 1.3314 |”
plain- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A result the paper reports from its own data — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“After thorough analysis and research, it has been revealed that the S-box related to the element x 27 y 11 t 3 u 3 v 2 G 7 offers the highest average value of non-linearity.”
boostedstates an association- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
21 more claims
Create a free account to see all 49 claims and every source verdict.
- It may state two separate claims as one. 20
- Probably not a substantial claim. 4
- The quote only partly states this claim. 1
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
Self-check results appear here once an independent check has confirmed them.
Cited works that were retracted
Works this paper cites that were later retracted, from the retraction notices publishers deposit. Major when the notice came out before this paper was published.
A note, not an issue: for example, a cited work that was retracted only after this paper was published, which its authors could not have known.
In the paper
“It is a representation from Galois field GF(2 n ) → GF(2 m ), that performs replacements secretly the n -bit input data to m - bit output cipher data [13], [14].”
Cited work 10.1007/s11042-018-6953-x · retracted 2024-08-03 · notice 10.1007/s11042-024-20004-5 · this paper published 2020
A note, not an issue: for example, a cited work that was retracted only after this paper was published, which its authors could not have known.
In the paper
“…, 167 , , 152 , 182 , 208 , 130 , 129 , 171 , 19 , 141 , 84 , 99 , 54 , 165 , 14 , 142 , 199 , 6 , 8 , 124 , 212 , 173 , 119 , 250 , 48 , 91 , 207 , 33 , 197 , 177 , 154 , 2 , 87 , 50 , 55 , 57) b := (3 , 159 , 16 , 131 , 112 , 30 , 193 , 7 , 93 , 203 , 44 , 146 , 190 , 137 , 21 , 103 , 243 , 164…”
Cited work 10.1007/s00521-016-2511-5 · retracted 2024-07-22 · notice 10.1007/s00521-024-10125-1 · this paper published 2020
Citations
Cites
2 retracted
Khan, M., & Asghar, Z. (2018) · Neural Computing and Applications · doi:10.1007/s00521-016-2511-5 · Cited by 184 · cited 2×
“…, 167 , , 152 , 182 , 208 , 130 , 129 , 171 , 19 , 141 , 84 , 99 , 54 , 165 , 14 , 142 , 199 , 6 , 8 , 124 , 212 , 173 , 119 , 250 , 48 , 91 , 207 , 33 , 197 , 177 , 154 , 2 , 87 , 50 , 55 , 57) b := (3 , 159 , 16 , 131 , 112 , 30 , 193 , 7 , 93 , 203 , 44 , 146 , 190 , 137 , 21 , 103 , 243 , 164…”
MethodRetractedRafiq, A., & Khan, M. (2018) · Multimedia Tools and Applications · doi:10.1007/s11042-018-6953-x · Cited by 34 · cited 1×
“It is a representation from Galois field GF(2 n ) → GF(2 m ), that performs replacements secretly the n -bit input data to m - bit output cipher data [13], [14].”
MethodRetractedCommunication Theory of Secrecy Systems
Shannon, C. E. (1949) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1949.tb00928.x · Cited by 9,440 · cited 1×
“It is recommended to have cryptographic strong S-boxes so as to satisfy Shannon’s confusion and diffusion properties [10].”
BackgroundDifferential cryptanalysis of DES-like cryptosystems
Biham, E., & Shamir, A. (1991) · Journal of Cryptology · doi:10.1007/bf00630563 · Cited by 2,914 · cited 1×
“The attack procedure of cryptanalysis was given by Biham and Shamir; it is related with developing imbalance on the input/output dissemination to assault block ciphers and S-boxes [57].”
MethodThe design of Rijndael AES - the advanced encryption standard
Daemen, J., & Rijmen, V. (2002) · Cited by 2,863
Linear Cryptanalysis Method for DES Cipher
Matsui, M. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-48285-7_33 · Cited by 2,748 · cited 2×
“The low value of linear approximation probability is essential to withstand the attack suggested by Mitsui [58].”
BackgroundMethodA new 1D chaotic system for image encryption
Zhou, Y., Bao, L., & Chen, C. L. P. (2014) · Signal Processing · doi:10.1016/j.sigpro.2013.10.034 · Cited by 859 · cited 2×
“The obtained ApEn for proposed improved chaotic map comes out as 1.1995 which is considerably higher than the logistic map [45], LSS map [46], DSP map [47], and TLS map [48] as evident from the ApEn comparison plot shown in Figure 2 for bifurcation parameter in [0, 4].”
BackgroundMethodInfluentialWebster, A. F., & Tavares, S. E. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-39799-x_41 · Cited by 719
Differential Cryptanalysis of DES-like Cryptosystems
Biham, E., & Shamir, A. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-38424-3_1 · Cited by 658
Cryptography in theory and practice
Biggs, N. L. (2008) · Springer Undergraduate Mathematics Series · doi:10.1007/978-1-84800-273-9_12 · Cited by 513
Cited by
RGB Image Encryption through Cellular Automata, S-Box and the Lorenz System
Alexan, W., ElBeltagy, M., & Aboshousha, A. (2022) · Symmetry · doi:10.3390/sym14030443 · Cited by 187
A Novel Modular Approach Based Substitution-Box Design for Image Encryption
Zahid, A. H., Alsolami, E., & Ahmad, M. (2020) · IEEE Access · doi:10.1109/access.2020.3016401 · Cited by 116
“Also, each coordinate Boolean function has equal number of 0’s and 1’s which is 128 [8], [11].”
BackgroundSelf-citationSiddiqui, N., Yousaf, F., Murtaza, F., Ehatisham-ul-Haq, M., Ashraf, M. U., Alghamdi, A. M., & Alfakeeh, A. S. (2020) · PLoS ONE · doi:10.1371/journal.pone.0241890 · Cited by 84
“The research work in [34] utilized a chaotic map along with algebraic groups to proposed another hybrid method for generating non-linear S-boxes.”
MethodSelf-citationA substitution box generator, its analysis, and applications in image encryption
Azam, N. A., Hayat, U., & Ayub, M. (2021) · Signal Processing · doi:10.1016/j.sigpro.2021.108144 · Cited by 81
Zahid, A. H., Tawalbeh, L., Ahmad, M., Alkhayyat, A. H., Hassan, M. T., Manzoor, A., & Farhan, A. K. (2021) · IEEE Access · doi:10.1109/access.2021.3095618 · Cited by 87
“Consequently, the protection of plaintext provided by a block cipher that employs S-box in its structure against attacks is directly reliant on the cryptographic forte of the respective S-box [10], [11].”
BackgroundSelf-citationA Novel Construction of Dynamic S-Box With High Nonlinearity Using Heuristic Evolution
Zahid, A. H., Iliyasu, A. M., Ahmad, M., Shaban, M. M. U., Arshad, M. J., Alhadawi, H. S., & El‐Latif, A. A. A. (2021) · IEEE Access · doi:10.1109/access.2021.3077194 · Cited by 72
“In all coordinate Boolean Functions, number of 1’s (128) is equal to the number of 0’s as suggested by [9], [40].”
BackgroundSelf-citation2D mixed pseudo-random coupling PS map lattice and its application in S-box generation
Zhou, P., Du, J., Kai, Z., & Wei, S. (2021) · Nonlinear Dynamics · doi:10.1007/s11071-020-06098-0 · Cited by 57
“Many approaches combined chaotic systems with mathematical structures which play a more important role than chaos were proposed [29–35].”
BackgroundDynamic S-Box Design Using a Novel Square Polynomial Transformation and Permutation
Zahid, A. H., Rashid, H., Shaban, M. M. U., Ahmad, S., Ahmed, E., Amjad, M. T., Baig, M. A. T., Arshad, M. J., Tariq, M. N., Tariq, M. W., et al. (2021) · IEEE Access · doi:10.1109/access.2021.3086717 · Cited by 51
“S-box as given in Table 3 erected from the novel square polynomial transformation and dynamic permutation confirms bijective property [8], [28] in a very well manner.”
BackgroundMethodA New Dynamic Substitution Box for Data Security Using an Innovative Chaotic Map
Manzoor, A., Zahid, A. H., & Hassan, M. T. (2022) · IEEE Access · doi:10.1109/access.2022.3184012 · Cited by 47
“There must be a one-to-one mapping in the structure of S-Box [39].”
BackgroundHayat, U., Azam, N. A., Gallegos-Ruiz, H. R., Naz, S., & Batool, L. (2021) · Arabian Journal for Science and Engineering · doi:10.1007/s13369-021-05666-9 · Cited by 45
Tian, P., & Su, R. (2022) · Sensors · doi:10.3390/s22145325 · Cited by 47
“An n × n S-box is a nonlinear map S: {0, 1}n→ {0, 1}n, with {0, 1}n representing the vector spaces of n elements from GF(2) [29,30].”
BackgroundSIEA: Secure Image Encryption Algorithm Based on Chaotic Systems Optimization Algorithms and PUFs
Muhammad, A. S., & Özkaynak, F. (2021) · Symmetry · doi:10.3390/sym13050824 · Cited by 41
“Strong cryptographic algorithms are needed to address this problem [5,6].”
BackgroundA method for generation of substitution box based on random selection
Artuğer, F., & Özkaynak, F. (2021) · Egyptian Informatics Journal · doi:10.1016/j.eij.2021.08.002 · Cited by 39
Murtaza, G., Azam, N. A., & Hayat, U. (2021) · Security and Communication Networks · doi:10.1155/2021/3367521 · Cited by 41
Chaos and Cellular Automata-Based Substitution Box and Its Application in Cryptography
Shafique, A., Khan, K. H., Hazzazi, M. M., Bahkali, I. M., Bassfar, Z., & Rehman, M. U. (2023) · Mathematics · doi:10.3390/math11102322 · Cited by 35
Evolving Nonlinear S-Boxes With Improved Theoretical Resilience to Power Attacks
Freyre-Echevarría, A., Martínez-Díaz, I., Legón-Pérez, C. M., Sosa-Gómez, G., & Rojas, O. (2020) · IEEE Access · doi:10.1109/access.2020.3035163 · Cited by 33
A Novel Optimization Method for Constructing Cryptographically Strong Dynamic S-Boxes
Ibrahim, S., & Abbas, A. M. (2020) · IEEE Access · doi:10.1109/access.2020.3045260 · Cited by 34
Efficient Image Encryption Based on New Substitution Box Using DNA Coding and Bent Function
Basha, H. A. M. A., Mohra, A. S., Diab, T. O. M., & Sobky, W. I. E. (2022) · IEEE Access · doi:10.1109/access.2022.3183990 · Cited by 33
A study of text-theoretical approach to S-box construction with image encryption applications
Mahboob, A., Nadeem, M., & Rasheed, M. W. (2023) · Scientific Reports · doi:10.1038/s41598-023-47607-6 · Cited by 34
Robust medical and color image cryptosystem using array index and chaotic S-box
Podder, D., Deb, S., Banik, D., Kar, N., & Sahu, A. K. (2024) · Cluster Computing · doi:10.1007/s10586-024-04584-3 · Cited by 36
“Ahmad et al. [27] presents a hybrid technique for constructing cryptographically combining algebraic groups and the benefits of the chaotic map to construct strong bijective substitution boxes.”
Image Encryption Through Lucas Sequence, S-Box and Chaos Theory
Alexan, W., ElBeltagy, M., & Aboshousha, A. (2021) · NAFOSTED Conference on Information and Computer Science (NICS) · doi:10.1109/nics54270.2021.9701533 · Cited by 30
A Strong Hybrid S-Box Scheme Based on Chaos, 2D Cellular Automata and Algebraic Structure
Haque, A., Abdulhussein, T. A., Ahmad, M., Falah, M. W., & El‐Latif, A. A. A. (2022) · IEEE Access · doi:10.1109/access.2022.3218062 · Cited by 37
Self-citationDesigning Substitution Box Based on the 1D Logistic Map Chaotic System
Fadhil, M. S., Farhan, A. K., & Fadhil, M. N. (2021) · IOP Conference Series Materials Science and Engineering · doi:10.1088/1757-899x/1076/1/012041 · Cited by 33
“The researchers in [14-16] also depend on the chaotic systems to construct good cryptographic S-Boxes.”
BackgroundAn External Parameter Independent Novel Cost Function for Evolving Bijective Substitution-Boxes
Freyre-Echevarría, A., Alanezi, A., Martínez-Díaz, I., Ahmad, M., El‐Latif, A. A. A., Kolivand, H., & Razaq, A. (2020) · Symmetry · doi:10.3390/sym12111896 · Cited by 32
Self-citationSiddiqui, N., Khalid, H., Murtaza, F., Ehatisham-ul-Haq, M., & Azam, M. A. (2020) · IEEE Access · doi:10.1109/access.2020.3034832 · Cited by 31
“Musheer et al. [71] also proposed a hybrid method entailing chaotic map-based heuristic search and algebraic group structures to generate bijective S-boxes of size n × n (where 5 ≤ n ≤ 8).”
MethodImage Encryption Through Rössler System, PRNG S-Box and Recamán's Sequence
ElBeltagy, M., Alexan, W., Elkhamry, A. K., Moustafa, M., & Hussein, H. H. (2022) · IEEE Annual Computing and Communication Workshop and Conference (CCWC) · doi:10.1109/ccwc54503.2022.9720905 · Cited by 27
Automated Chaos-Driven S-Box Generation and Analysis Tool for Enhanced Cryptographic Resilience
Aydın, Y., & Özkaynak, F. (2023) · IEEE Access · doi:10.1109/access.2023.3346319 · Cited by 33
Construction of Optimized Dynamic S-Boxes Based on a Cubic Modular Transform and the Sine Function
Zahid, A. H., Ahmad, M., Alkhayyat, A. H., Arshad, M. J., Shaban, M. M. U., Soliman, N. F., & Algarni, A. D. (2021) · IEEE Access · doi:10.1109/access.2021.3113338 · Cited by 27
“Each coordinate Boolean function of resultant S-box has total count of 1’s (128) equivalent to total count of 0’s as proposed in [9], [47].”
BackgroundSelf-citationGarıpcan, A. M., Aydın, Y., & Özkaynak, F. (2024) · Chaos Solitons & Fractals · doi:10.1016/j.chaos.2024.115952 · Cited by 29
Constructing dynamic S-boxes based on chaos and irreducible polynomials for image encryption
Luo, C., Wang, Y., Fu, Y., Zhou, P., & Wang, M. (2024) · Nonlinear Dynamics · doi:10.1007/s11071-024-09353-w · Cited by 24
“…in [9] 0.1250 The S-box in [11] 0.1093 The S-box in [12] 0.1328 The S-box in [13] 0.1250 The S-box in [14] 0.1406 The S-box in [18] 0.1367 The S-box in [20] 0.0625 The S-box in [22] 0.1289 The S-box in [24] 0.0625 The S-box in [23] 0.1250 The S-box in [34] 0.0625 dence matrix of our S-box are 0 .”
InfluentialAhmad, M., Alkanhel, R. I., El‐Shafai, W., Algarni, A. D., El‐Samie, F. E. A., & Soliman, N. F. (2022) · IEEE Access · doi:10.1109/access.2022.3209202 · Cited by 26
“Various optional methodologies have been explored in the recent years to produce S-boxes depending on various optimization techniques and chaotic systems [13], [14], [15], [16], [17], [18].”
MethodSelf-citationAli, A., Khan, M. A., Ayyasamy, R. K., & Wasif, M. (2022) · PeerJ Computer Science · doi:10.7717/peerj-cs.940 · Cited by 27
“Recently, research on the S-box has been accelerated and numerous methodologies have been proposed (Ahmed, Zolkipli & Ahmad, 2019; Açikkapi, Özkaynak & Özer, 2019; Hussain et al., 2019; Lu, Zhu &Wang, 2019; Zahid, Arshad & Ahmad, 2019; Khan, Ahmed & Saleem, 2019; Farhan et al., 2019; Yi et al., 2019; Özkaynak, 2019; T…”
MethodInfluentialFast Novel Efficient S-Boxes with Expanded DNA Codes
Maolood, A. T., Farhan, A. K., Sobky, W. I. E., Nasry, H., Zayed, H. L. A., Ahmed, H. E.-D. H., & Diab, T. O. M. (2023) · Security and Communication Networks · doi:10.1155/2023/5767102 · Cited by 18
A new post-processing approach for improvement of nonlinearity property in substitution boxes
Artuğer, F., & Özkaynak, F. (2023) · Integration · doi:10.1016/j.vlsi.2023.102105 · Cited by 17
Advanced image encryption scheme based on generalized triangle group and neural networks
Abbasi, A. Z., Rafiq, A., Alshammari, B. M., & Jaghdam, I. H. (2025) · Ain Shams Engineering Journal · doi:10.1016/j.asej.2025.103488 · Cited by 18
Ahmad, M., & Alsolami, E. (2020) · Complexity · doi:10.1155/2020/8868884 · Cited by 19
“*ere exist a vast number of bijective S-boxes for n� 8 whose count is 256!, which is more than 10(506) [9].”
BackgroundSelf-citationConstruction of Robust Lightweight S-Boxes Using Enhanced Logistic and Enhanced Sine Maps
Duong, P.-P., Nguyễn, M. H., Dao, B.-A., Kieu-Do-Nguyen, B., Tran, T.-H., Hoang, T.-T., & Pham, C. (2024) · IEEE Access · doi:10.1109/access.2024.3396452 · Cited by 18
“Furthermore, there are studies that integrate chaotic methodologies with other approaches to construct S-Boxes [17], [18], [19], [20], [21].”
Creation of S-Box based One-Dimensional Chaotic Logistic Map: Colour Image Encryption Approach
(2022) · International journal of intelligent engineering and systems · doi:10.22266/ijies2022.1031.33 · Cited by 18
“Also, the researchers in [26-28] used chaotic systems in order to design robust S-Boxes.”
BackgroundBaowidan, S. A., Alamer, A., Hassan, M. T., & Yousaf, A. (2024) · Symmetry · doi:10.3390/sym16080954 · Cited by 16
Self-citationConstruction of nonlinear component based on bent Boolean functions
Arshad, S., & Khan, M. (2024) · Computational and Applied Mathematics · doi:10.1007/s40314-023-02545-x · Cited by 9
González, F., Soto, R., & Crawford, B. (2022) · Mathematics · doi:10.3390/math10132172 · Cited by 7
Cellular Automata, S-Box and DNA Coding Based SPN for Image Encryption
Omran, O., & Alexan, W. (2023) · International Congress on Human-Computer Interaction, Optimization and Robotic Applications (ICHORA) · doi:10.1109/hora58378.2023.10156745 · Cited by 8
Manowska, A., Boroš, M., Hassan, M. W., Bluszcz, A., & Tobór–Osadnik, K. (2024) · Electronics · doi:10.3390/electronics13142849 · Cited by 13
Chaos-Based S-Boxes as a Source of Confusion in Cryptographic Primitives
Silva, É. C. D. E., Cruz, C. A. D. M., Saraiva, I. A. L., Santos, F. G., Junior, C. R. P. D. S., Indrusiak, L. S., Finamore, W. A., & Glesner, M. (2025) · Electronics · doi:10.3390/electronics14112198 · Cited by 9
Visual Data Security Incorporating Fibonacci Sequence, S-Box, and Chaos Theory
Hussein, H. H., Alexan, W., ElBeltagy, M., & Aboshousha, A. (2022) · International Conference on Smart Systems and Power Management (IC2SPM) · doi:10.1109/ic2spm56638.2022.9989013 · Cited by 6
Improving the Quality of AES S-box by Modifications Irreducible Polynomial and Affine Matrix
Alamsyah, A. (2020) · International Conference on Informatics and Computing (ICIC) · doi:10.1109/icic50835.2020.9288567 · Cited by 8
“1, the NS values on the proposed S-boxes, in [5], [6], [7], [8], [9], [10], [11], [12], and [ 13]”
BackgroundMethodA Novel Scrambling Method Based on Coupling Mode Switching Strategy for Digital Chaos
Zhou, P., & Sheng-fei, W. (2022) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127422500948 · Cited by 7
A lightweight image encryption algorithm based on patterns in Rubik’s revenge cube
Yousaf, A., Razaq, A., & Baig, H. (2022) · Multimedia Tools and Applications · doi:10.1007/s11042-022-11898-0 · Cited by 7
“Thus, this may give some useful data about the strength of encryption [2].”
BackgroundSelf-citationAdvanced Image Ciphering: 1-D Group Cellular Automata and S-Box Strategies
Yogi, B., Roy, S., Rawat, U., & Redkar, S. (2025) · International Conference on Next Generation Communication & Information Processing (INCIP) · doi:10.1109/incip64058.2025.11019383 · Cited by 4
Angraini, N., & Suryanto, Y. (2022) · Jurnal Teknik Informatika (Jutif) · doi:10.20884/1.jutif.2022.3.4.352 · Cited by 3
“S-box yang akan digunakan adalah S-box yang dibangkitkan oleh Alamsyah [6] yang memiliki nilai rata-rata SAC sebesar 0,5 sehingga S-box tersebut dikatakan perfect SAC Sbox.”
BackgroundMethodInfluentialPeriodicity Detection of the Substitution Box in the CBC Mode of Operation: Experiment and Study
Alimzhanova, Z., Skublewska‐Paszkowska, M., & Nazarbayev, D. (2023) · IEEE Access · doi:10.1109/access.2023.3295909 · Cited by 4
Construction of confusion component based on the isogeny of elliptic curves
Arshad, S. (2023) · Multimedia Tools and Applications · doi:10.1007/s11042-023-17399-y · Cited by 5
Optimum criterion for lightweight nonlinear confusion component with multi-criteria decision making
Abughazalah, N. H., Khan, M., Munir, N., et al. (2021) · Journal of Intelligent & Fuzzy Systems · doi:10.3233/jifs-210524 · Cited by 3
“Many techniques have been proposed in literature for secure S-box construction [1–3].”
Abdurazzokov, J., Fayziyevich, A. B., Muhamediyeva, D., & Sulyukova, L. (2025) · Nonlinear Dynamics · doi:10.1007/s11071-025-11890-x · Cited by 4
A novel S-box design over prime field and its applications in image encryption
Ali, R., Jamil, M. K., & Habib, M. (2026) · Multimedia Tools and Applications · doi:10.1007/s11042-026-21149-1 · Cited by 3
Zhang, R., Guo, Y., Wang, C., et al. (2022) · Journal of Advanced Transportation · doi:10.1155/2022/2266706 · Cited by 2
“To overcome the problem of the local minimum points of the artificial potential field, researchers have proposed some improved methods, such as the general potential field method and virtual force field method [23–25], the artificial coordination field [26–30], the random escape method [31], heuristic search and walki…”
MethodUsing Symmetric Group to Generate Dynamic S-box
Alghurabi, K. A., Obaid, A. J., Alkhayyat, H. K., et al. (2022) · Communications in computer and information science · doi:10.1007/978-3-031-21385-4_41 · Cited by 2
The Substitution-Boxes Incompatibility in JPEG Image Encryption
Cardona-López, M. A., Chimal-Eguía, J. C., Silva-García, V. M., et al. (2023) · IEEE Conference on Dependable and Secure Computing (DSC) · doi:10.1109/dsc61021.2023.10354118 · Cited by 2
“In other words, since the substitution box is a bijective function [17], each encrypted value has a unique associated value to decrypt.”
BackgroundKey-Dependent Dynamic SBox for KASUMI Block Cipher
Sardar, A., & Chowdhury, D. R. (2024) · Lecture notes in networks and systems · doi:10.1007/978-981-97-2069-9_14 · Cited by 1
González, F., Soto, R., Lanza-Gutiérrez, J. M., & Crawford, B. (2025) · Expert Systems with Applications · doi:10.1016/j.eswa.2025.129524 · Cited by 1
(2023) · International journal of intelligent engineering and systems · doi:10.22266/ijies2023.1231.43 · Cited by 1
Substitution Box for Encryption in Internet of Things
Jangra, M., & Singh, B. (2022) · IEEE IAS Global Conference on Emerging Technologies (GlobConET) · doi:10.1109/globconet53749.2022.9872343 · Cited by 1
“Some of the graph structures and their subgraphs are utilized to generate S-boxes with optimal security strength [21-23].”
MethodLogistic and Circle Maps for Robust S-Box Construction in Cryptography
Aydın, Y., & Özkaynak, F. (2023) · International Conference on Frontiers in Academic Research (ICFAR) · doi:10.59287/as-proceedings.477
Arshad, R., Jalil, M., Iqbal, W., & Chaudhry, U. H. (2024) · Arabian Journal for Science and Engineering · doi:10.1007/s13369-024-09099-y · Cited by 1
“In addition, each coordinate Boolean function (BF) is balanced means each S-Box coordinate function output has an equal number of 0 s , 1 s that has a value of 128 [53].”
Simple strong S-box design using affine transformation modification
Alamsyah, A. (2025) · AIP conference proceedings · doi:10.1063/5.0290049
Uysal, F., Taşçı, B., Tuncer, T., Doğan, Ş., Barua, P. D., & Acharya, U. R. (2026) · PeerJ Computer Science · doi:10.7717/peerj-cs.4024
Qarni, A. A., Ishaq, K., Ahmed, N. A., Mustafa, G., & Fahad, M. (2023) · International Journal of Innovations in Science and Technology · doi:10.33411/ijist/592
Metadata
- Authors
- Ahmad, M., Al-Solami, E., Alghamdi, A. M., & Yousaf, M. A.
- Affiliations
- Jamia Millia Islamia (IN)
- University of Jeddah (SA)
- Venue
- IEEE Access
- Published
- 2020
- Volume
- 8
- Pages
- 110397-110411
- ISSN
- 2169-3536 (ISSN-L)
- OpenAlex
- W3035231109
- Cited by
- 71
- References
- 87
- Citations by year
- 2026: 3 · 2025: 6 · 2024: 10 · 2023: 14 · 2022: 17 · 2021: 13 · 2020: 8
- FWCI
- 4.39
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Locations
- IEEE Access (publishedVersion, cc-by)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Chaos-based Image/Signal Encryption
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
- Physical Sciences › Mathematics › Discrete Mathematics and Combinatorics › Coding theory and cryptography
- Keywords
- substitution boxes, chaotic maps, heuristic search, cryptographic strength
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
The claim verdicts this report counts are experimental: their accuracy is not yet measured.
A language model drew the claims from the paper on 2026-10-10, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-10-10 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
Cited sources are checked with a language model’s help (gpt-6-sol).
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.