CoChat

Sine‐Cosine Optimization‐Based Bijective Substitution‐Boxes Construction Using Enhanced Dynamics of Chaotic Map

Open access
Alzaidi, Amer Awad, Ahmad, Musheer, Ahmed, Hussam S., Solami, Eesa Al · 2018 · Complexity
Cited by 96

The DOI matches its Crossref record; 11 of the 11 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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1155/2018/9389065

Cites

11 of 11 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Cited by

See all 96

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

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.