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

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

2D Logistic-Sine-coupling map for image encryption

Hua, Zhongyun, Jin, Fan, Xu, Binxuan, Huang, Hejiao · 2018 · Signal Processing

Abstract

Abstract Image encryption is a straightforward strategy to protect digital images by transforming images into unrecognized ones. The chaos theory is a widely used technology for image encryption as it has many significant properties such as ergodicity and initial state sensitivity. When chaotic systems are used in image encryption, their chaos performance highly determines the security level. This paper presents a two-dimensional (2D) Logistic-Sine-coupling map (LSCM). Performance estimations demonstrate that it has better ergodicity, more complex behavior and larger chaotic range than several newly developed 2D chaotic maps. Utilizing the proposed 2D-LSCM, we further propose a 2D-LSCM-based image encryption algorithm (LSCM-IEA), which adopts the classical confusion-diffusion structure. A permutation algorithm is designed to permutate image pixels to different rows and columns while a diffusion algorithm is developed to spread few changes of plain-image to the whole encrypted result. We compare the efficiency of LSCM-IEA with several advanced algorithms and the results show that it has higher encryption efficiency. To show the superiority of LSCM-IEA, we also analyze the security of LSCM-IEA in terms of key security, ability of defending differential attack, local Shannon entropy and contrast analysis. The analysis results demonstrate that LSCM-IEA has better security performance than several existing algorithms.

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.1016/j.sigpro.2018.03.010

Cites

46 of 46 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

Research works printed but not linked: 3

  1. Li, 2015, Robust copyright protection using multiple ownership watermarks, Opt. Express, 23, 3035, 10.1364/OE.23.003035 · doi:10.1364/oe.23.003035
  2. Xiao, 2005, One-way Hash function construction based on the chaotic map with changeable-parameter, Chaos Solitons Fractals, 24, 65, 10.1016/S0960-0779(04)00456-4 · doi:10.1016/s0960-0779(04)00456-4
  3. Wu, 2011, NPCR and UACI randomness tests for image encryption, cyber journals: multidisciplinary journals in science and technology, J. Sel. Areas Telecommun. (JSAT), 31

Cited by

See all 595

Metadata

Authors
Hua, Z., Jin, F., Xu, B., & Huang, H.
Venue
Signal Processing
Publisher
Elsevier BV
Published
2018-08
Volume
149
Pages
148-161
ISSN
0165-1684 (ISSN-L)
OpenAlex
W2790533449
Cited by
595
References
46
FWCI
28.66
Type
journal article
Language
en
Open access
closed
Licence
www.elsevier.com/tdm/userlicense/1.0/ (tdm)
Funders
National Natural Science Foundation of China (61701137, 11371004, 61672195)

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.