An Efficient Chaotic Image Cryptosystem Based on Simultaneous Permutation and Diffusion Operations
Open accessAbstract
Recently, several multimedia encryption techniques with permutation-diffusion architecture have been developed. The traditional architecture applies the diffusion and permutation functions as two separate phases. This separable design enables the attacker to launch several forms of attacks in addition to the degradation of the encryption speed. Furthermore, during the diffusion phase, the image pixels are masked in a static order, which may expose significant information about the encryption technique to the attacker. Accordingly, to remedy these problems, this paper suggests an efficient image cryptosystem based on simultaneous permutation and diffusion functions that process the image pixels in a dynamic order fashion. Specifically, the proposed method employs the Chebyshev-Chebyshev map to horizontally and vertically mix the plain-image information. Then, it utilizes the modified Logistic map to mask the image pixels and shuffle the masked values simultaneously. Meanwhile, the control parameters of the employed chaos systems are directly correlated to the plain-image to assure that different key-streams are created for distinct plain-images. Simulation results and security scrutiny confirm that the suggested cipher has several brilliant characteristics, including the robustness against various types of attacks.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
MSE values above 10000 are desired for resistance to differential attacks.
“The MSE represents the mean of the quadratic differences between the pixel's values in the two encrypted images, calculated according to Equation (11), and values above 10000 are desired [14].”
From A novel single kernel parallel image encryption scheme based on a chaotic map (2024) · cites this paper as [14]
Cites
A fast image encryption system based on chaotic maps with finite precision representation
Kwok, H. S., & Tang, W. K. S. (2007) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2005.11.090 · Cited by 428 · see citing works
A novel image encryption algorithm using chaos and reversible cellular automata
Wang, X., & Luan, D. (2013) · Communications in Nonlinear Science and Numerical Simulation · doi:10.1016/j.cnsns.2013.04.008 · Cited by 216 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
A hyperchaotic image encryption scheme based on the triple dislocation of the liu and lorenz system
Tang, M., Zeng, G., Yang, Y., & Chen, J. (2022) · Optik · doi:10.1016/j.ijleo.2022.169133 · Cited by 34 · see citing works
A novel single kernel parallel image encryption scheme based on a chaotic map
Bezerra, J. I. M., Molter, A., Machado, G., Soares, R. I., & Camargo, V. V. D. A. (2024) · Journal of Real-Time Image Processing · doi:10.1007/s11554-024-01506-9 · Cited by 10 · see citing works
A Novel Single Kernel Parallel Image Encryption Scheme Based on a Chaotic Map
Moreira Bezerra, J., Machado, G., Molter, A., Soares, R., & Camargo, V. (2023) · doi:10.2139/ssrn.4598075
A novel single kernel parallel image encryption scheme based on a chaotic map
Bezerra, J. I. M., Camargo, V. V. D. A., Soares, R. I., Molter, A., & Machado, G. (2024) · doi:10.21203/rs.3.rs-4208203/v1
- Authors
- Diab, H.
- Affiliations
- Menoufia University (EG)
- Corresponding author
- Diab, Hossam
- ORCID
- Diab, Hossam
- Venue
- IEEE Access
- Published
- 2018
- Volume
- 6
- Pages
- 42227-42244
- ISSN
- 2169-3536 (ISSN-L)
- OpenAlex
- W2884478609
- Cited by
- 111
- References
- 2
- Citations by year
- 2026: 2 · 2025: 6 · 2024: 11 · 2023: 19 · 2022: 15 · 2021: 21 · 2020: 16 · 2019: 20 · 2018: 1
- FWCI
- 7.26
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Locations
- IEEE Access (publishedVersion)
- DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
- Funders
- Taibah University
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Chaos-based Image/Signal Encryption
- Physical Sciences › Computer Science › Artificial Intelligence › Computer Science and Engineering
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Steganography and Watermarking Techniques
- Keywords
- image encryption, chaotic cryptosystem, permutation-diffusion, logistic map, keystream generation, attack resistance, multimedia encryption
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