Sine‐Cosine Optimization‐Based Bijective Substitution‐Boxes Construction Using Enhanced Dynamics of Chaotic Map
Open accessThe DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Abstract
This paper proposes a novel method of constructing strong substitution‐boxes (S‐boxes) of order n (4 ≤ n ≤ 8) based on a recent optimization algorithm known as sine‐cosine algorithm (SCA). The paper also proposes a new 1D chaotic map, which owns enhanced dynamics compared to conventional chaotic map, for generating initial population of S‐boxes and facilitating the optimization mechanism of SCA. The proposed method applies the SCA with enhanced chaotic map to explore and exploit the search space for obtaining optimized S‐boxes on the basis of maximization of nonlinearity as fitness function. The S‐box construction involves three phases such as initialization of population, optimization, and adjustment. The simulation and performance analyses are done using standard measures of nonlinearity, strict avalanche criterion, bits independence criterion, differential uniformity, linear approximation probability, and autocorrelation function. The obtained experimental results are compared with some immediate optimization‐based and other S‐boxes to show the strength of proposed method for constructing bijective S‐boxes of salient cryptographic features.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Handbook of applied cryptography
(1997) · Choice Reviews Online · doi:10.5860/choice.34-4512 · Cited by 10,357
Approximate entropy as a measure of system complexity.
Pincus, S. M. (1991) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.88.6.2297 · Cited by 5,811
Differential cryptanalysis of DES-like cryptosystems
Biham, E., & Shamir, A. (1991) · Journal of Cryptology · doi:10.1007/bf00630563 · Cited by 2,914
Rukhin, A., Sota, J., Nechvatal, J., Smid, M., Barker, E., Leigh, S., Levenson, M., Vangel, M., Banks, D., Heckert, A., et al. (2000) · doi:10.6028/nist.sp.800-22 · Cited by 1,867
A 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
A new color image encryption using combination of the 1D chaotic map
Pak, C., & Huang, L. (2017) · Signal Processing · doi:10.1016/j.sigpro.2017.03.011 · Cited by 632
A novel method of S-box design based on discrete chaotic map
Lambić, D. (2017) · Nonlinear Dynamics · doi:10.1007/s11071-016-3199-x · Cited by 150
A novel efficient substitution-box design based on firefly algorithm and discrete chaotic map
Ahmed, H. A., Zolkipli, M. F., & Ahmad, M. (2019) · Neural Computing and Applications · doi:10.1007/s00521-018-3557-3 · Cited by 142
Self-citationA Novel Ant Colony Optimization Based Scheme for Substitution Box Design
Ahmad, M., Bhatia, D., & Hassan, Y. (2015) · Procedia Computer Science · doi:10.1016/j.procs.2015.07.394 · Cited by 123
Self-citationUtilizing Evolutionary Computation Methods for the Design of S-Boxes
Laskari, E., Meletiou, G., & Vrahatis, M. (2006) · 2006 International Conference on Computational Intelligence and Security · doi:10.1109/iccias.2006.295267 · Cited by 29
Cited by
A Novel Construction of Efficient Substitution-Boxes Using Cubic Fractional Transformation
Zahid, A. H., Arshad, M. J., & Ahmad, M. (2019) · Entropy · doi:10.3390/e21030245 · Cited by 122
Self-citationRazaq, A., Alolaiyan, H., Ahmad, M., Yousaf, M. A., Shuaib, U., Aslam, W., & Alawida, M. (2020) · IEEE Access · doi:10.1109/access.2020.2989676 · Cited by 81
Self-citationConstruction of Cryptographic S-Boxes Based on Mobius Transformation and Chaotic Tent-Sine System
Jamal, S. S., Anees, A., Ahmad, M., Khan, M. F., & Hussain, I. (2019) · IEEE Access · doi:10.1109/access.2019.2956385 · Cited by 81
Self-citationAhmad, M., Al-Solami, E., Alghamdi, A. M., & Yousaf, M. A. (2020) · IEEE Access · doi:10.1109/access.2020.3001868 · Cited by 71
“It is clear from the comparison Table that the proposed four bijective S-boxes offers considerably better resistance to linear attacks and offer high nonlinear transformation of input data to ciphertext data as compared to other S-boxes investigated in [21], [39], [59], [60].”
BackgroundSelf-citationComparison of Pre and Post-Action of a Finite Abelian Group Over Certain Nonlinear Schemes
Yousaf, M. A., Alolaiyan, H., Ahmad, M., Dilbar, M., & Razaq, A. (2020) · IEEE Access · doi:10.1109/access.2020.2975880 · Cited by 42
Self-citation
Metadata
- Authors
- Alzaidi, A. A., Ahmad, M., Ahmed, H. S., & Solami, E. A.
- Venue
- Complexity
- Publisher
- Wiley
- Published
- 2018-01
- Volume
- 2018
- Issue
- 1
- ISSN
- 1076-2787 (ISSN-L)
- 1099-0526
- OpenAlex
- W2902835214
- Cited by
- 96
- References
- 10
- FWCI
- 6.23
- Type
- journal article
- Language
- en
- Open access
- gold
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.
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: Sine‐Cosine Optimization‐Based Bijective Substitution‐Boxes Construction Using Enhanced Dynamics of Chaotic Map. https://app.cochat.ai/papers/10.1155/2018/9389065
- The paper
- Alzaidi, A. A., Ahmad, M., Ahmed, H. S., & Solami, E. A. (2018). Sine‐Cosine Optimization‐Based Bijective Substitution‐Boxes Construction Using Enhanced Dynamics of Chaotic Map. Complexity. https://doi.org/10.1155/2018/9389065
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.