Generation of Highly Nonlinear and Dynamic AES Substitution-Boxes (S-Boxes) Using Chaos-Based Rotational Matrices
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
This work reports a novel chaos-based affine transformation generation method, which is based on rotational matrices to design strong key-based S-boxes. Chaotic logistic map’s nonlinear trajectories are used to generate rotational matrices under given design conditions. Thus, the inherent logic is to generate key-based S-boxes, as strong as AES S-box, in terms of cryptographic properties using chaos in affine transformation. The randomness of chaotic sequences is tested using the National Institute of Standard and Technology (NIST) Statistical Test Suit (STS) 800–22 that validates the generated sequences for S-box design. The results show that methodology adapted to design proposed key-based dynamic S-boxes entails near-optimal cryptographic properties so that proposed S-boxes are as stronger as AES S-box.
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 1×
“The logistic equation is proposed by Pierre Francois Ver-hulst [57] in 1838 and introduced as a chaotic map first time by May [58].”
MethodBassham, L. E., Rukhin, A. L., Soto, J., Nechvatal, J. R., Smid, M. E., Barker, E. B., Leigh, S. D., Levenson, M., Vangel, M., Banks, D. L., et al. (2010) · NIST Special Publication 800-22 Revision 1a · doi:10.6028/nist.sp.800-22r1a · Cited by 3,617 · cited 1×
“To validate the randomness of a bitstream generated by any RNG, NIST statistical test suite (STS) 800-22 [59] is used.”
MethodDifferential cryptanalysis of DES-like cryptosystems
Biham, E., & Shamir, A. (1991) · Journal of Cryptology · doi:10.1007/bf00630563 · Cited by 2,914 · cited 1×
“Linear probability (LP) [64] of an S-box can be defined as : where, A x and B x are the input and output values respectively while Z = {1,2,3... 255}.”
BackgroundA 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
A Novel Design of Cryptographic SP-Network Based on Gold Sequences and Chaotic Logistic Tent System
Khan, M. F., Ahmed, A., Saleem, K., & Shah, T. (2019) · IEEE Access · doi:10.1109/access.2019.2925081 · Cited by 27 · cited 1×
“Khan et al. [25] proposed a new cryptographic method for substitution-permutation network design, where the results of gold sequences and chaotic logistic tent maps are used in linear fraction transformation to generate a new S-box.”
MethodSelf-citation
Cited by
Razaq, 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
“But, the S-boxes available in [40], [42], [61], [78], [80] have merits over our S-box due to better I/O EX-OR differential distribution.”
BackgroundAlexan, W., Elabyad, N., Khaled, M., Osama, R., El-Damak, D., Abd El Ghany, M. A., Korayem, Y., Mamdouh, E., & Gabr, M. (2024) · IEEE Access · doi:10.1109/access.2024.3446733 · Cited by 53
FPGA Realization of a Novel Hyperchaos Augmented Image Encryption Algorithm
Alexan, W., Elshabasy, N. H., Mamdouh, E., Osama, R., Abd El Ghany, M. A., & El-Damak, D. (2026) · IET Computers & Digital Techniques · doi:10.1049/cdt2/6416727 · Cited by 6
Metadata
- Authors
- Mahmood Malik, M. S., Ali, M. A., Khan, M. A., Ehatisham-Ul-Haq, M., Shah, S. N. M., Rehman, M., & Ahmad, W.
- Venue
- IEEE Access
- Published
- 2020
- Volume
- 8
- Pages
- 35682-35695
- ISSN
- 2169-3536 (ISSN-L)
- OpenAlex
- W3006427436
- Cited by
- 78
- References
- 5
- FWCI
- 4.87
- 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
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.