Quantum Image Encryption Using Intra and Inter Bit Permutation Based on Logistic Map
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
In this paper, a quantum image encryption scheme is proposed by using the inter–intra bit-level permutation strategy. The image to be encrypted is first represented by a novel enhanced quantum representation model, and then, the intra and inter permutation operations are successively performed on bit planes. The intra bit permutation is achieved by sorting chaotic sequence, and the inter bit permutation is accomplished with qubit XOR operations between the two selected bit planes. The ciphertext image is finally obtained through a chaotic diffusion procedure implemented with a quantum image XOR operation. The XOR operation is realized by controlled- NOT gates, which is controlled by a chaotic sequence generated with a logistic map. The parameters of the logistic map are sensitive, which makes the key space large enough to resist brute-force attack. The proposed scheme not only modifies the pixel positions and gray values but also makes the bit distribution more uniform. The quantum circuits for the proposed encryption algorithm are devised. The simulation results and theoretical analysis show that the proposed method is more efficient than its classical counterpart, and its security is verified by the statistical analysis, keys sensitivity, and key space analysis.
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.
Integrity signals
Registry
Cites
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.
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
SOME BASIC CRYPTOGRAPHIC REQUIREMENTS FOR CHAOS-BASED CRYPTOSYSTEMS
ALVAREZ, G., & LI, S. (2006) · International Journal of Bifurcation and Chaos · doi:10.1142/s0218127406015970 · Cited by 2,119
A novel image encryption scheme based on improved hyperchaotic sequences
Zhu, C. (2012) · Optics Communications · doi:10.1016/j.optcom.2011.08.079 · Cited by 432
Novel quantum image encryption using one-dimensional quantum cellular automata
Yang, Y.-G., Tian, J., Lei, H., Zhou, Y.-H., & Shi, W.-M. (2016) · Information Sciences · doi:10.1016/j.ins.2016.01.078 · Cited by 163
Zhu, C., Wang, G., & Sun, K. (2018) · Symmetry · doi:10.3390/sym10090399 · Cited by 90
Improved Cryptanalysis and Enhancements of an Image Encryption Scheme Using Combined 1D Chaotic Maps
Zhu, C., Wang, G., & Sun, K. (2018) · Entropy · doi:10.3390/e20110843 · Cited by 76
Cited by
Quantum image encryption algorithm based on 3D-BNM chaotic map
Verma, V., & Kumar, S. (2025) · Nonlinear Dynamics · doi:10.1007/s11071-024-10403-6 · Cited by 76
A New Image Encryption Scheme Based on 6D Hyperchaotic System and Random Signal Insertion
Sun, S. (2023) · IEEE Access · doi:10.1109/access.2023.3290915 · Cited by 29
Survey on medical image encryption: From classical to deep learning-based approaches
Prasad, S., & Singh, A. K. (2025) · Computers and Electrical Engineering · doi:10.1016/j.compeleceng.2024.110011 · Cited by 21
5D chaotic map-based image encryption trade-off analysis on various stages of encryption
R, V. R., V, V. K., R, M., & K, Y. (2025) · EURASIP Journal on Advances in Signal Processing · doi:10.1186/s13634-025-01255-2 · Cited by 7
Metadata
- Authors
- Liu, X., Xiao, D., & Xiang, Y.
- Venue
- IEEE Access
- Published
- 2019
- Volume
- 7
- Pages
- 6937-6946
- ISSN
- 2169-3536 (ISSN-L)
- OpenAlex
- W2907270755
- Cited by
- 69
- References
- 5
- FWCI
- 3.36
- 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.