Efficient cryptographic substitution box design using travelling salesman problem and chaos
Open accessThe DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
Symmetric encryption has been a standout amongst the most reliable option by which security is accomplished. In modern block symmetric cyphers, the substitution-boxes have been playing a critical role of nonlinear components that drives the actual security of cyphers. In this paper, the travelling salesman problem and piece-wise linear chaotic map are explored to synthesize an efficient configuration of 8 × 8 substitution-box. The proposed anticipated design has the consistency which is justified by the standard performance indexes. The statistical results manifest that the prospective substitution-box is cryptographically more impressive as compared to some recent investigations.
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
A 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 · cited 5×
“In block ciphers, the property of confusion is achieved by employing substitution-boxes (S-boxes) and diffusion is imparted through the usage of permutation-boxes (P-boxes) which are linear in nature [1].”
BackgroundMethodInfluentialSelf-citation
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-citationA New 1D Chaotic Map and $\beta$ -Hill Climbing for Generating Substitution-Boxes
Alzaidi, A. A., Ahmad, M., Doja, M. N., Solami, E. A., & Beg, M. M. S. (2018) · IEEE Access · doi:10.1109/access.2018.2871557 · Cited by 108
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-citationAhmad, M., Al-Solami, E., Alghamdi, A. M., & Yousaf, M. A. (2020) · IEEE Access · doi:10.1109/access.2020.3001868 · Cited by 71
Self-citationCryptanalysis of Novel Image Encryption Scheme Based on Multiple Chaotic Substitution Boxes
Alanazi, A. S., Munir, N., Khan, M., Asif, M., & Hussain, I. (2021) · IEEE Access · doi:10.1109/access.2021.3092512 · Cited by 50
Metadata
- Authors
- Ahmad, M., Mittal, N., Garg, P., & Maftab Khan, M.
- Venue
- Perspectives in Science
- Publisher
- Elsevier BV
- Published
- 2016-09
- Volume
- 8
- Pages
- 465-468
- ISSN
- 2213-0209 (ISSN-L)
- OpenAlex
- W2471234984
- Cited by
- 46
- References
- 1
- FWCI
- 4.98
- Type
- journal article
- Language
- en
- Open access
- hybrid
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.