Color Image Encryption Using Pixel Scrambling Operator and Reality-Preserving MPFRHT
The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
To ensure the confidentiality of color images during their storage or transmission on insecure networks, a number of encryption methods based on fractional transforms have been proposed and widely investigated. However, most of their outputs are complex values that are inconvenient for record and transmission. Also, those methods always deal with a whole color component with the same fractional-order and ignore the textural features that are contained in different image parts. In this paper, we first define a reality-preserving multiple-parameter fractional Hartley transform (RPMPFRHT), whose output is real value, and then a novel color image encryption method is proposed that divides the RGB components into different blocks and uses a constructed pixel scrambling operator to mix and hide the original color information. The outputs are transformed to different RPMPFRHT domains and further scrambled by a non-adjacent coupled map lattices system. Numerical simulations are performed to demonstrate that the proposed encryption algorithm is feasible, secure, sensitive to keys, and robust to potential attacks.
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
Simple mathematical models with very complicated dynamics
May, R. M. (1976) · Nature · doi:10.1038/261459a0 · Cited by 7,001 · cited 1×
“where ρ, υ, ω are the lattices (1 ≤ ρ, υ, ω ≤ P), εis the coupling parameter (0 ≤ ε ≤ 1), ρ is the time index (ρ = 1, 2, · · · ) and f (x) = μx (1 − x) is the logistic map [39], and μ is the system parameter sometimes known as bifurcation parameter and satisfies 0 < μ ≤ 4.”
A novel colour image encryption algorithm based on chaos
Wang, X., Teng, L., & Qin, X. (2012) · Signal Processing · doi:10.1016/j.sigpro.2011.10.023 · Cited by 715 · cited 5×
“COMPARISON OF THE UACI VALUE OF THE PROPOSED ALGORITHM WITH [1], [14], [26], [44], [50]”
BackgroundMethodInfluentialA novel chaotic block image encryption algorithm based on dynamic random growth technique
Wang, X., Liu, L., & Zhang, Y. (2015) · Optics and Lasers in Engineering · doi:10.1016/j.optlaseng.2014.08.005 · Cited by 434
A new image encryption algorithm based on non-adjacent coupled map lattices
Zhang, Y.-Q., & Wang, X.-Y. (2015) · Applied Soft Computing · doi:10.1016/j.asoc.2014.09.039 · Cited by 360
Asymmetric color image encryption scheme using 2D discrete-time map
Liu, H., & Kadir, A. (2015) · Signal Processing · doi:10.1016/j.sigpro.2015.01.016 · Cited by 170
Multiplicity of fractional Fourier transforms and their relationships
Cariolaro, G., Erseghe, T., Kraniauskas, P., & Laurenti, N. (2000) · IEEE Transactions on Signal Processing · doi:10.1109/78.815493 · Cited by 89 · cited 1×
“The FRHT is very closely related to the FRFT [33], [34] whose multiplicity has been studied from the mathematical viewpoint [35].”
BackgroundA method for the discrete fractional Fourier transform computation
Yeh, M.-H., & Pei, S.-C. (2003) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2002.808113 · Cited by 55 · cited 2×
“Inspired by computation methods of the FRFT [36], [37], we can also investigate the multiplicity of the FRHT.”
BackgroundMethod
Cited by
Fingerprint-related chaotic image encryption scheme based on blockchain framework
Li, R. (2021) · Multimedia Tools and Applications · doi:10.1007/s11042-020-08802-z · Cited by 34
Thumbnail-preserving encryption based on improved logistic system
Zhu, Z., & Liu, L. (2022) · Journal of King Saud University - Computer and Information Sciences · doi:10.1016/j.jksuci.2022.10.014 · Cited by 24
Wan, H., Zhou, L., Chen, H., Pang, D., You, Z., Wang, C., Wang, Y., & Huang, G. (2025) · Physica Scripta · doi:10.1088/1402-4896/add5a4 · Cited by 3
Metadata
- Authors
- Kang, X., & Tao, R.
- Venue
- IEEE Transactions on Circuits and Systems for Video Technology
- Published
- 2019-07
- Volume
- 29
- Issue
- 7
- Pages
- 1919-1932
- ISSN
- 1051-8215 (ISSN-L)
- 1558-2205
- OpenAlex
- W2884201190
- Cited by
- 67
- References
- 7
- FWCI
- 3.36
- 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
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.