Author
Listed:
- Alexandru Dinu
(Faculty of Electronics, Telecommunications and Information Technology, National University of Science and Technology Politehnica Bucharest, 060042 Bucharest, Romania)
- Madalin Frunzete
(Faculty of Electronics, Telecommunications and Information Technology, National University of Science and Technology Politehnica Bucharest, 060042 Bucharest, Romania)
Abstract
Image encryption plays a critical role in ensuring the confidentiality and integrity of visual information, particularly in applications involving secure transmission and storage. While traditional cryptographic algorithms like AES are widely used, they may not fully exploit the properties of image data, such as high redundancy and spatial correlation. In recent years, chaotic systems have emerged as promising candidates for lightweight and secure encryption schemes, but comprehensive comparisons between different chaotic maps and standardized methods are still lacking. This study investigates the use of three classical chaotic systems—Henon, tent, and logistic maps—for image encryption, and evaluates their performance both visually and statistically. The research is motivated by the need to assess whether these well-known chaotic systems, when used with proper statistical sampling, can match or surpass conventional methods in terms of encryption robustness and complexity. We propose a key generation method based on chaotic iterations, statistically filtered for independence, and apply it to a one-time-pad-like encryption scheme. The encryption quality is validated over a dataset of 100 JPEG images of size 512 × 512 , using multiple evaluation metrics, including MSE, PSNR, NPCR, EQ, and UACI. Results are benchmarked against the AES algorithm to ensure interpretability and reproducibility. Our findings reveal that while the AES algorithm remains the fastest and most uniform in histogram flattening, certain chaotic systems, such as the tent and logistic maps, offer comparable or superior results in visual encryption quality and pixel-level unpredictability. The analysis highlights that visual encryption performance does not always align with statistical metrics, underlining the importance of multi-faceted evaluation. These results contribute to the growing body of research in chaos-based image encryption and provide practical guidelines for selecting encryption schemes tailored to specific application requirements, such as efficiency, visual secrecy, or implementation simplicity.
Suggested Citation
Alexandru Dinu & Madalin Frunzete, 2025.
"Image Encryption Using Chaotic Maps: Development, Application, and Analysis,"
Mathematics, MDPI, vol. 13(16), pages 1-16, August.
Handle:
RePEc:gam:jmathe:v:13:y:2025:i:16:p:2588-:d:1723278
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:13:y:2025:i:16:p:2588-:d:1723278. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.