Student or educator? Sign up with your school email and get 6 months of Pro free.

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 access
Ahmad, Musheer, Al-Solami, Eesa, Alghamdi, Ahmed Mohammed, Yousaf, Muhammad Awais·2020·IEEE Access

Abstract

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

Crossref · 10.1109/access.2020.3001868

Cites

88 of 88 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Verification

Claims the paper makes

5 Valid · 4 Not valid · 6 Not checked · 34 Own results and interpretations

21 more claims

Create a free account to see all 49 claims and every source verdict.

See all claims — free account
  • It may state two separate claims as one. 20
  • Probably not a substantial claim. 4
  • The quote only partly states this claim. 1

Create a free account to see these claims.

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.

2 of 2

Citations

Cites

2 retracted

Show all 87 references

Cited by

See all 71

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
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.