Cited by 127Chaos-based Image/Signal EncryptionCryptographic Implementations and SecurityChaos control and synchronization

S-Box Based Image Encryption Application Using a Chaotic System without Equilibrium

Open access
Wang, Xiong, Çavuşoğlu, Ünal, Kacar, Sezgin, Akgul, Akif, Pham, Viet-Thanh, Jafari, Sajad, Alsaadi, Fawaz E., Nguyen, Xuan Quynh·2019·Applied Sciences

Abstract

Chaotic systems without equilibrium are of interest because they are the systems with hidden attractors. A nonequilibrium system with chaos is introduced in this work. Chaotic behavior of the system is verified by phase portraits, Lyapunov exponents, and entropy. We have implemented a real electronic circuit of the system and reported experimental results. By using this new chaotic system, we have constructed S-boxes which are applied to propose a novel image encryption algorithm. In the designed encryption algorithm, three S-boxes with strong cryptographic properties are used for the sub-byte operation. Particularly, the S-box for the sub-byte process is selected randomly. In addition, performance analyses of S-boxes and security analyses of the encryption processes have been presented.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.3390/app9040781

Cites

64 of 64 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Solving the discrete logarithm problem when the elliptic curve's solution set has a prime factor of 2^256 is equivalent to factoring n with a 2^3072 size.

    “In this sense, to solve the discrete logarithm problem when the solution set of the elliptic curve has a prime factor of 2 256 , is equivalent to factoring n with a 2 3072 size [9].”

    From Cryptosystem Based on the Elliptic Curve With a High Degree of Resistance to Damage on the Encrypted Images (2020) · cites this paper as [9]

    Section 3.1 describes generating 256-element S-boxes from a chaotic system, and Section 3.2 evaluates their cryptographic properties. Searches for elliptic-curve discrete logarithms and the claimed 2^256-versus-2^3072 factoring equivalence found no passage addressing that comparison in our copy. (LLM, conf=0.77)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

2 retracted

Flagged first, then by citations

1 of the 65 references couldn’t be matched to a known paper.

Research works printed but not linked: 4

  1. Stinson, D.R. Cryptography: Theory and Practice; CRC Press: Boca Raton, FL, USA, 1995.
  2. Schneier, B. Applied Cryptography: Protocols, Algorithms, and Source Code in C, 2nd ed.; Wiley: New York, NY, USA, 1996.
  3. Webster, A.; Tavares, S.E. On the design of S-boxes. In Conference on the Theory and Application of Cryptographic Techniques; Springer: Berlin/Heidelberg, Germany, 1985; pp. 523-534.
  4. Rijmen, V.; Daemen, J. Advanced encryption standard. In Proceedings of Federal Information Processing Standards Publications, National Institute of Standards and Technology; NIST: Gaithersburg, MD, USA 2001; pp. 19-22.

Cited by

Sorted by citations

Authors
Wang, X., Çavuşoğlu, Ü., Kacar, S., Akgul, A., Pham, V.-T., Jafari, S., Alsaadi, F. E., & Nguyen, X. Q.
Affiliations
  • Shenzhen University (CN)
  • Sakarya University (TR)
  • Department of Electrical and Electronics Engineering, Faculty of Technology, Sakarya University, 54187 Serdivan, Turkey
  • Department of Electrical and Electronics Engineering, Faculty of Technology, Sakarya University of Applied Sciences, 54187 Serdivan, Turkey
  • Ton Duc Thang University (VN)
  • Amirkabir University of Technology (IR)
  • King Abdulaziz University (SA)
  • National Council for Science and Technology Policy (VN)
Corresponding author
Pham, Viet-Thanh
Venue
Applied Sciences
Publisher
MDPI AG
Published
2019-02-22
Volume
9
Issue
4
Pages
781
ISSN
2076-3417 (ISSN-L)
OpenAlex
W2916974458
Cited by
125
References
65
Citations by year
2026: 3 · 2025: 4 · 2024: 19 · 2023: 17 · 2022: 25 · 2021: 26 · 2020: 26 · 2019: 5
FWCI
9.16
Type
journal article
Language
en
Open access
Locations
  • Applied Sciences (publishedVersion, cc-by)
  • Sakarya Üniversitesi Kurumsal Açık Akademik Arşivi (submittedVersion)
  • Sakarya University of Applied Sciences Institutional Repository (submittedVersion, other-oa)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
Funders
  • National Natural Science Foundation of China (No. 61601306)
  • and Shenzhen Overseas High Level Talent Peacock Project Fund (No. 20150215145C)
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Chaos-based Image/Signal Encryption
  • Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
  • Physical Sciences › Physics and Astronomy › Statistical and Nonlinear Physics › Chaos control and synchronization
Keywords
image encryption, S-box, hidden attractors, circuit implementation, Lyapunov exponents, entropy analysis, encryption security analysis

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