A Novel S-Box Design Algorithm Based on a New Compound Chaotic System
Open accessThe DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Abstract
Substitution-boxes (S-Boxes) are important non-linear components in block cryptosystem, which play an important role in the security of cryptosystems. Constructing S-Boxes with a strong cryptographic feature is an important step in designing block cipher systems. In this paper, a novel algorithm for constructing S-Boxes based on a new compound chaotic system is presented. Firstly, the new chaotic system, tent–logistic system, is proposed, which has better chaotic performance and wider chaotic range than the tent and logistic system, and can not only increase the randomness of the chaotic sequences but also expand the key space of cryptosystems. Secondly, a novel linear mapping is employed to construct the initial S-Box. Then, the permutation operation on the initial S-Box is performed by using chaotic sequence generated with the tent–logistic system, which improves the cryptographic features of the S-Box. The idea behind the proposed work is to make supplementary safe S-box. Detail tests for cryptographic strength of the proposed S-Box are performed by using different standard benchmarks. The test results and performance analysis show that our proposed S-Box has very smaller values of linear probability (LP) and differential probability (DP) and a satisfactory average value of nonlinearity compared with other S-Boxes, showing its excellent application potential in block cipher system.
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
Simple mathematical models with very complicated dynamics
May, R. M. (1976) · Nature · doi:10.1038/261459a0 · Cited by 7,001 · cited 2×
“The mathematical model of Logistic map is [36]: where µ is the system parameter in the range of [0, 4]. where μ is the system parameter in the range of [0, 4] In order to determine the range of parameters corresponding to its chaotic phenomena, we calculated Lyapunov exponents under di ff erent…”
MethodApproximate 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 · cited 1×
“Entropy Analysis of the New Chaotic System One of the most famous methods is approximate entropy [41].”
MethodA 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
Zhang, S., Li, X., Tan, Z., Peng, T., & Wang, G. (2019) · Future Generation Computer Systems · doi:10.1016/j.future.2018.10.053 · Cited by 163
Self-citationA 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 Secure and Fast Image Encryption Scheme Based on Double Chaotic S-Boxes
Zhu, S., Wang, G., & Zhu, C. (2019) · Entropy · doi:10.3390/e21080790 · Cited by 131 · cited 1×
“S boxes that are 8 × 8 are the most commonly used type of S-Box, especially widely used in digital image encryption system [42]. the most commonly used type of S-Box, especially widely used in In this paper, we focused on the design algorithm of an 8 × 8 S-Box.”
MethodSelf-citationS-Box Based Image Encryption Application Using a Chaotic System without Equilibrium
Wang, X., Çavuşoğlu, Ü., Kacar, S., Akgul, A., Pham, V.-T., Jafari, S., Alsaadi, F. E., & Nguyen, X. Q. (2019) · Applied Sciences · doi:10.3390/app9040781 · Cited by 125 · cited 1×
“For the simplest 8 × 8 S-Box, we could obtain the following results easily as: S[0] = Sb(1, 1) = 0, S[1] = Sb(1, 2) = 1, .”
MethodA novel method of S-box design based on chaotic map and composition method
Lambić, D. (2014) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2013.11.001 · Cited by 123
Zhu, C., Wang, G., & Sun, K. (2018) · Symmetry · doi:10.3390/sym10090399 · Cited by 90
Self-citationImproved Cryptanalysis and Enhancements of an Image Encryption Scheme Using Combined 1D Chaotic Maps
Zhu, C., Wang, G., & Sun, K. (2018) · Entropy · doi:10.3390/e20110843 · Cited by 76
Self-citation
Cited by
An Efficient Image Encryption Scheme Based on the LSS Chaotic Map and Single S-Box
Lu, Q., Zhu, C., & Deng, X. (2020) · IEEE Access · doi:10.1109/access.2020.2970806 · Cited by 281
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
Ahmad, M., Al-Solami, E., Alghamdi, A. M., & Yousaf, M. A. (2020) · IEEE Access · doi:10.1109/access.2020.3001868 · Cited by 71
“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].”
MethodInfluentialComparison 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
A secure image encryption scheme with compression-confusion-diffusion structure
Zhu, S., Zhu, C., Fu, Y., Zhang, W., & Wu, X. (2020) · Multimedia Tools and Applications · doi:10.1007/s11042-020-09699-4 · Cited by 19
Self-citation
Metadata
- Authors
- Lu, Q., Zhu, C., & Wang, G.
- Venue
- Entropy
- Publisher
- MDPI AG
- Published
- 2019-10-14
- Volume
- 21
- Issue
- 10
- Pages
- 1004
- ISSN
- 1099-4300 (ISSN-L)
- OpenAlex
- W2980057341
- Cited by
- 93
- References
- 11
- FWCI
- 5.25
- 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: A Novel S-Box Design Algorithm Based on a New Compound Chaotic System. https://app.cochat.ai/papers/10.3390/e21101004
- The paper
- Lu, Q., Zhu, C., & Wang, G. (2019). A Novel S-Box Design Algorithm Based on a New Compound Chaotic System. Entropy. https://doi.org/10.3390/e21101004
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.