Cited by 29Chaos-based Image/Signal EncryptionComputer Science and EngineeringAdvanced Steganography and Watermarking Techniques

Memristive chaotic system-based hybrid image encryption application with AES and RSA algorithms

Sahin, M Emin·2023·Physica Scripta

Abstract

The widespread use of information and communication tools today facilitates information access and highlights the significance of information and data security. In recent years, chaos-based encryption systems have emerged as a promising approach for protecting the confidentiality of transmitted images. In particular, memristor-based hyperchaotic systems have attracted significant attention because of their robustness and complexity. In this paper, we propose an image encryption model that employs a two-stage encryption method using various chaotic systems, including the logistic map, Lorenz chaotic system, and memristor-based hyperchaotic system, with AES and RSA encryption algorithms. The proposed hybrid scheme applies bit-based pixel diffusion and confusion techniques to improve the security of encrypted images. Statistical and security tests are conducted to compare the performance of the different encryption systems and algorithms and to present the measurement values obtained from the analysis. Our experimental results demonstrate the effectiveness of the proposed image encryption scheme in terms of security, speed, and reliability and provide valuable insights for the development of future chaos-based encryption systems.

Integrity signals

Registry

Crossref · 10.1088/1402-4896/acdba0

Cites

3 of 3 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

  • For a well-encrypted image, correlation values close to zero signify a lack of statistical dependence and support the claim of randomness in the encrypted output.

    “For a well-encrypted image, the resulting correlation values should be close to zero, which signifies a lack of statistical dependence and supports the claim of randomness in the encrypted output 30 ,54.”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Sahin, M. E.
Venue
Physica Scripta
Published
2023-06-15
Volume
98
Issue
7
Pages
075216
ISSN
  • 0031-8949 (ISSN-L)
  • 1402-4896
OpenAlex
W4380789164
Cited by
29
References
3
Citations by year
2026: 7 · 2025: 13 · 2024: 5 · 2023: 4
FWCI
2.64
Type
journal article
Language
en
Open access
closed
Locations
Physica Scripta (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Chaos-based Image/Signal Encryption
  • Physical Sciences › Computer Science › Artificial Intelligence › Computer Science and Engineering
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Steganography and Watermarking Techniques
Keywords
image encryption, chaos-based cryptography, hybrid encryption, AES, logistic map, Lorenz chaotic system, pixel diffusion, confusion, data security

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