CoChat

The fast image encryption algorithm based on lifting scheme and chaos

Zhang, Yong · 2020 · Information Sciences
Cited by 149

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

Abstract

Abstract Image encryption technology is one of the most important means of image information security. Most image encryption algorithms are based on a permutation−diffusion structure. However, some image cryptosystems based on this structure have been proved to be insecure. Thus, a new image encryption structure based on a lifting scheme is proposed in this study. In the proposed algorithm, the plain image is decomposed into low-frequency approximate components and high-frequency detailed components. Pseudo-random sequences generated by chaos are employed to sequentially disturb the two sets of components. Then a lifting scheme is used for image encryption. Compared to the currently popular permutation−diffusion structure, the proposed image cryptography requires fewer pseudo-random numbers, and it has a faster encryption speed and higher security. Simulations, performance analysis, and comparison tests show that the proposed method has the advantages of large key space, fast encryption and decryption speeds, strong system sensitivity, and excellent encryption security. The algorithm can be used in applications such as encryption of medical and cloud images.

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.ins.2020.02.012

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

Show all 10 references

Cited by

See all 149

Metadata

Authors
Zhang, Y.
Venue
Information Sciences
Publisher
Elsevier BV
Published
2020-05
Volume
520
Pages
177-194
ISSN
0020-0255 (ISSN-L)
OpenAlex
W3005779010
Cited by
149
References
10
FWCI
9.93
Type
journal article
Language
en
Open access
closed

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: The fast image encryption algorithm based on lifting scheme and chaos. https://app.cochat.ai/papers/10.1016/j.ins.2020.02.012
The paper
Zhang, Y. (2020). The fast image encryption algorithm based on lifting scheme and chaos. Information Sciences. https://doi.org/10.1016/j.ins.2020.02.012

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.