Image Encryption Using Chaotic Maps: Development, Application, and Analysis

Alexandru Dinu () and Madalin Frunzete
Additional contact information
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

Mathematics, 2025, vol. 13, issue 16, 1-16

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.

Keywords: image encryption; chaotic maps; statistical independence; security analysis; key generation; AES benchmark (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/13/16/2588/pdf (application/pdf)
https://www.mdpi.com/2227-7390/13/16/2588/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:13:y:2025:i:16:p:2588-:d:1723278

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().