Image encryption using hybrid chaotic map
Abstract
Recently, great attention is paid to the use of chaotic maps in image encryption applications due to their excellent randomness properties. In this paper, an efficient image encryption algorithm using a set of chaotic maps has been proposed. The proposed algorithm consists of three stages: confusion, shuffling, and diffusion. In confusion stage, the original image is confused by using Arnold cat chaotic map. In shuffling stage, the pixels of the confused image are shuffled to add more randomness and unpredictability. Finally, the shuffled image is diffused by a key image generated by combining sequences generated from Henon and Logistic chaotic maps. To evaluate the performance, MATLAB Simulations are done for both the proposed algorithm and some existing algorithms in the literature while histogram, Number of Pixel Change Rate (NPCR), correlation, Unified Average Changing Intensity (UACI), and information entropy measures are used for security analysis. The simulation results and security analysis have demonstrated that the proposed encryption system is robust and flexible. For example the amount of entropy obtained by the proposed algorithm is 7.9975, which is very closed its ideal amount: 8, and NPCR is 99.66 %, which is also much closed to its ideal value: 100%.
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?
The hybrid chaotic map has better security measurement parameters than the standalone chaos-based image encryption system.
“The hybrid chaotic map seems to have better security measurement parameters than the standalone chaos-based image encryption system.”
From Secure Image Encryption Using Chaotic, Hybrid Chaotic and Block Cipher Approach (2022) · cites this paper as [21]
Test images from the SIPI and DICOM databases are standard images chosen by most existing works to evaluate image encryption algorithms.
“Test images were taken from a widely used image repository called the “SIPI image database” [32], and the “DICOM (Digital Imaging and Communications in Medicine) image database” [33], because these are the standard image chosen by most of the existing works [21,31] to evaluate the strength of image encryption algorithms.”
From Secure Image Encryption Using Chaotic, Hybrid Chaotic and Block Cipher Approach (2022) · cites this paper as [21]
Cited by
Sorted by citations
A Blockchain-Based Secure Image Encryption Scheme for the Industrial Internet of Things
Khan, P. W., & Byun, Y. (2020) · Entropy · doi:10.3390/e22020175 · Cited by 137 · see citing works
Secure Image Encryption Using Chaotic, Hybrid Chaotic and Block Cipher Approach
Chaudhary, N., Shahi, T. B., & Neupane, A. (2022) · Journal of Imaging · doi:10.3390/jimaging8060167 · Cited by 56 · see citing works
- Authors
- Abdullah, H. N., & Abdullah, H. A.
- Affiliations
- Nahrain University (IQ)
- Venue
- 2017 International Conference on Current Research in Computer Science and Information Technology (ICCIT)
- Publisher
- IEEE
- Published
- 2017-04
- Pages
- 121-125
- OpenAlex
- W2727230610
- Cited by
- 42
- References
- 0
- Citations by year
- 2026: 1 · 2025: 2 · 2024: 2 · 2023: 5 · 2022: 9 · 2021: 4 · 2020: 7 · 2019: 7 · 2018: 5
- FWCI
- 1.52
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- International Conference on Current Research in Computer Science and Information Technology (ICCIT) (publishedVersion)
- 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 maps, Arnold cat map, Henon map, logistic map, pixel shuffling, diffusion, key images, NPCR, UACI, Shannon entropy
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