Cited by 39Chaos-based Image/Signal EncryptionAdvanced Steganography and Watermarking TechniquesComputer Science and Engineering

A visually secure asymmetric image encryption scheme based on RSA algorithm and hyperchaotic map

Xu, Qiaoyun, Sun, Kehui, Zhu, Congxu·2020·Physica Scripta

Abstract

This paper proposes a visually secure asymmetric image encryption scheme based on Rivest–Shamir–Adlemen (RSA) algorithm and hyperchaotic map. It combines the advantages of the RSA and chaos-based image encryption algorithms. First, to fully encrypt the image information, the plain image is encrypted into a cipher image by applying the row and column encryption algorithms. Second, the image secret key is converted into a ciphertext by utilizing the RSA algorithm to increase the security, and then the ciphertext is transformed into an image and permuted using the Arnold map to enhance the robustness of the embedded image. We then obtain the key cipher image. Finally, the cipher image and the key cipher image are embedded into a carrier image (CI) to obtain a visually secure image. It simultaneously achieves the image information security and image visually security. To further improve the security, the RSA keys management technique is applied and the initial conditions of the hyperchaotic map are updated in real time based on the plain image. In addition, the encryption scheme is suitable for multi-user image transmission with high security requirements and image transmission without the secure channel for key transmission. The simulation results and performance analysis validate the effectiveness, security and robustness of the proposed scheme.

Integrity signals

Registry

Crossref · 10.1088/1402-4896/ab52bc

Cites

1 of 1 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?

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Xu, Q., Sun, K., & Zhu, C.
Affiliations
Central South University (CN)
Corresponding author
Sun, Kehui
Venue
Physica Scripta
Published
2020-02-07
Volume
95
Issue
3
Pages
035223
ISSN
  • 0031-8949 (ISSN-L)
  • 1402-4896
OpenAlex
W2982421914
Cited by
39
References
1
Citations by year
2025: 6 · 2024: 8 · 2023: 9 · 2022: 5 · 2021: 9 · 2020: 2
FWCI
1.79
Type
journal article
Language
en
Open access
closed
Locations
Physica Scripta (publishedVersion)
Funders
  • National Natural Science Foundation of China ((Grant Nos. 61161006 and 61573383))
  • the Innovation Project of Graduate of Central South University (Grant Nos. 2019zzts420)
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Chaos-based Image/Signal Encryption
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Steganography and Watermarking Techniques
  • Physical Sciences › Computer Science › Artificial Intelligence › Computer Science and Engineering
Keywords
image encryption, public-key cryptography, RSA algorithm, hyperchaotic map, Arnold map, key embedding, key management, chaos-based cryptography

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