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 110
“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 78
“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 77
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 82
“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-citation
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Bijective S-Boxes Method Using Improved Chaotic Map-Based Heuristic Search and Algebraic Group Structures. https://app.cochat.ai/papers/10.1109/access.2020.3001868
- The paper
- Ahmad, M., Al-Solami, E., Alghamdi, A. M., & Yousaf, M. A. (2020). Bijective S-Boxes Method Using Improved Chaotic Map-Based Heuristic Search and Algebraic Group Structures. IEEE Access. https://doi.org/10.1109/access.2020.3001868
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.