Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 218

The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.

2D Logistic-Modulated-Sine-Coupling-Logistic Chaotic Map for Image Encryption

Open access
Zhu, Hegui, Zhao, Yiran, Song, Yujia · 2019 · IEEE Access

Abstract

Due to the significant properties of unpredictability, ergodicity, and initial state sensitivity, chaotic system is widely used as a useful tool in image encryption. In this paper, we propose a 2-dimensional logistic-modulated-sine-coupling-logistic chaotic map (LSMCL), where we use the logistic map to modulate Sine map and couple the result of modulation and Sine map together. In terms of chaotic trajectory, Lyapunov exponent, and Kolmogorov entropy, comparing with other existing chaotic maps, we can observe that LSMCL has better chaotic performance. Furthermore, we propose an LSMCL-based image encryption algorithm with two rounds of permutation and diffusion operation. First, we provide a secret key generation procedure to generate the initial values and do permutation operation with the chaotic matrix by LSMCL. Furthermore, in diffusion procedure, we use two different chaotic matrices generated by LSMCL to change the pixel values in row and column. Finally, we provide some theoretical analyses and simulations to confirm the security and the validity of the proposed algorithm.

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.1109/access.2019.2893538

Cites

10 of 10 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 218

Metadata

Authors
Zhu, H., Zhao, Y., & Song, Y.
Venue
IEEE Access
Published
2019
Volume
7
Pages
14081-14098
ISSN
2169-3536 (ISSN-L)
OpenAlex
W2914945329
Cited by
218
References
10
FWCI
11.17
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.