Lorenz, Rossler, and Chan systems for key generation and pixel selection in chaotic image encryption

The increasing need for secure multimedia communication has driven the development of more robust encryption schemes. This paper introduces a novel chaotic image encryption algorithm that uniquely integrates three different chaotic systems, including Lorenz, Rossler, and Chan, to generate a highly unpredictable, non-sequential encryption process. Unlike prior dual-system approaches, the proposed method assigns distinct roles to each chaotic system for key generation, pixel selection, and indexing, thereby enhancing both confusion and diffusion properties while maintaining low computational overhead. The three proposed chaotic systems, Lorenz, Rossler, and Chan, introduce a high level of randomness in the encryption process. Lorenz system generates chaotic random integer numbers (CRINs) as encryption keys to ensure unpredictability. Rossler system randomly selects nonsequential pixel indices to enhance diffusion. Chan system applies an XOR operation between the selected image pixels and the generated chaotic keys and encrypt image with highly resistant to decryption attempts. The Diffie-Hellman key exchange protocol was also incorporated to share encryption keys between parties securely. Multiple image quality assessment metrics were used to evaluate the proposed algorithm’s effectiveness. The results indicated that the encrypted images exhibited significant distortion with a Mean Squared Error (MSE) of 9254.5 and a Peak Signalto-Noise Ratio (PSNR) of 8.4673 dB, indicating strong encryption. The Structural Similarity Index Measure (SSIM) was very low (0.000604), reflecting high image scrambling. The encrypted image’s entropy was 7.9997, nearing the ideal value of 8, ensuring maximum randomness. The decryption process accurately reconstructed the original image with an SSIM of 1 and zero MSE, with encryption and decryption times of 0.409s and 0.369s, respectively. The proposed encryption algorithm offers an effective solution for protecting digital images in public communication channels. Integrating chaotic systems with a structured encryption framework shows strong resistance to modern cryptographic threats. This approach is particularly valuable in high-security areas such as military operations, medical data transfer, and confidential communications.

Authors

Institutions

Publication Details

Journal
Journal of university of Anbar for pure science
Published
2025-12-01
DOI
https://doi.org/10.37652/juaps.2025.161423.1435
Primary Topic
Chaos-based Image/Signal Encryption
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Lorenz, Rossler, and Chan systems for key generation and pixel selection in chaotic image encryption

Lamis Hamood Al-Saadi, Ahmed Hamad, Raghad Sahun
Journal of university of Anbar for pure science
Chaos-based Image/Signal Encryption
article

Lorenz, Rossler, and Chan systems for key generation and pixel selection in chaotic image encryption

Lamis Hamood Al-Saadi, Ahmed Hamad, Raghad Sahun
article en

Abstract

The increasing need for secure multimedia communication has driven the development of more robust encryption schemes. This paper introduces a novel chaotic image encryption algorithm that uniquely integrates three different chaotic systems, including Lorenz, Rossler, and Chan, to generate a highly unpredictable, non-sequential encryption process. Unlike prior dual-system approaches, the proposed method assigns distinct roles to each chaotic system for key generation, pixel selection, and indexing, thereby enhancing both confusion and diffusion properties while maintaining low computational overhead. The three proposed chaotic systems, Lorenz, Rossler, and Chan, introduce a high level of randomness in the encryption process. Lorenz system generates chaotic random integer numbers (CRINs) as encryption keys to ensure unpredictability. Rossler system randomly selects nonsequential pixel indices to enhance diffusion. Chan system applies an XOR operation between the selected image pixels and the generated chaotic keys and encrypt image with highly resistant to decryption attempts. The Diffie-Hellman key exchange protocol was also incorporated to share encryption keys between parties securely. Multiple image quality assessment metrics were used to evaluate the proposed algorithm’s effectiveness. The results indicated that the encrypted images exhibited significant distortion with a Mean Squared Error (MSE) of 9254.5 and a Peak Signalto-Noise Ratio (PSNR) of 8.4673 dB, indicating strong encryption. The Structural Similarity Index Measure (SSIM) was very low (0.000604), reflecting high image scrambling. The encrypted image’s entropy was 7.9997, nearing the ideal value of 8, ensuring maximum randomness. The decryption process accurately reconstructed the original image with an SSIM of 1 and zero MSE, with encryption and decryption times of 0.409s and 0.369s, respectively. The proposed encryption algorithm offers an effective solution for protecting digital images in public communication channels. Integrating chaotic systems with a structured encryption framework shows strong resistance to modern cryptographic threats. This approach is particularly valuable in high-security areas such as military operations, medical data transfer, and confidential communications.

Journal of university of Anbar for pure scienceVol. 19(2)
Mustansiriyah University (IQ), University of Babylon (IQ), Al-Zahra College for Women (OM), University of Kerbala (IQ), Nahrain University (IQ)
Openalex Percentile: Top 61%
Chaos-based Image/Signal Encryption
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.