The mathematical heart of the construction is a Lorenz system whose parameters are not fixed. In the classical Lorenz equations, the parameters sigma, rho, and beta are constants that shape the famous butterfly-shaped attractor. Kareem and Pirdawood instead allow these parameters to be dynamically modified based on the system’s own state trajectory and on information derived from the plaintext image itself. This produces what the authors describe as non-stationary chaos: a chaotic process whose statistical properties shift over time rather than settling into a predictable pattern. The practical consequence is a significant improvement in resistance to phase-space reconstruction attacks, a family of techniques in which an eavesdropper attempts to rebuild the underlying attractor from observed outputs and thereby reconstruct the pseudo-random keystream that protects the image.

Chaotic maps have long been attractive to cryptographers because of their extreme sensitivity to initial conditions and their high nonlinearity. A tiny change in the starting state of a chaotic system produces an exponentially diverging trajectory, which is precisely the property one wants in a keystream generator. However, as the authors note, many existing image encryption schemes suffer from degraded chaotic properties, particularly when implemented on finite-precision digital hardware where chaotic orbits can fall into short, repeating cycles. Others rely too heavily on a single protection mechanism, leaving them vulnerable once that mechanism is compromised. The new paradigm is designed to avoid both pitfalls by layering multiple, independent transformations whose parameters are continuously refreshed by the hyperchaotic system.

The encryption pipeline unfolds in four sequential stages. In the first, the bits of the image undergo permutation driven by a hyperchaotic sequence, shuffling the individual bits of each pixel rather than merely rearranging whole pixels. Bit-level permutation is far more destructive to an image’s internal structure than pixel-level shuffling, because it scrambles the binary representation itself, destroying correlations at the finest granularity. In the second stage, the scrambled bits are reinterpreted as DNA sequences. Under standard DNA encoding rules, groups of two binary bits are mapped to one of the four nucleotide bases, A, C, G, or T, and the specific mapping rule is selected dynamically by a second chaotic sequence, so that the encoding scheme itself varies across the image and from one encryption run to the next.

The third stage introduces a confusion layer built on a DNA-based XOR operation. Here, the DNA-encoded image data is combined with a nucleotide stream derived from the secret key, performing the familiar exclusive-or logic in the four-letter DNA alphabet rather than on raw binary. Because the encoding rule and the keystream both evolve chaotically, an attacker who recovers part of the nucleotide stream gains little leverage over the rest. Finally, a fourth stage applies chaotic bit masking, a last diffusion pass in which chaotic sequences once again modify the bit values directly. The authors formally prove the perfect reconstructability of the scheme, meaning the entire chain of transformations can be exactly inverted with the correct key, so decryption recovers the original image without any loss.

Security analysis of the scheme yields numbers that approach the theoretical ideals used to benchmark image ciphers. When a single pixel of a plaintext image is changed, the encrypted versions differ at a Number of Changing Pixel Rate exceeding 99.61 percent, and the Unified Average Changing Intensity reaches approximately 33.46 percent, both near the optimal values expected of a cryptographically strong system. These metrics, NPCR and UACI, measure whether an attacker can probe the cipher by making tiny changes to the input and observing the output; near-ideal results indicate that even a one-bit change in the plaintext cascades into a completely different ciphertext, a property known as plaintext sensitivity that defeats differential attacks.

Empirical validation on standard test images reinforces the formal results. The encrypted images exhibit uniformly distributed histograms, meaning that no gray level occurs more often than any other and no statistical fingerprint of the original image survives. Information entropy, a measure of randomness, reaches approximately 7.997 on an eight-bit scale where the theoretical maximum is 8, indicating ciphertext that is nearly indistinguishable from pure noise. Correlation coefficients between adjacent pixels, which in natural images are typically close to 1 because neighboring pixels look alike, fall below 0.01 in absolute value in the encrypted output. In visual terms, the encrypted images appear as featureless static, revealing nothing about faces, text, or structures hidden within.

The choice of DNA operations is more than an aesthetic flourish. DNA computing and DNA cryptography have emerged as a fertile research area because the four-symbol alphabet and the combinatorial explosion of possible encoding rules add layers of complexity that are awkward to replicate in pure binary arithmetic. Recent literature has explored eight-base DNA encodings, DNA-based linear feedback shift registers, and diffusive DNA coding operations combined with hyperchaotic systems with cross-feedback structures. Kareem and Pirdawood’s contribution is to bind these DNA operations tightly to a non-degenerate hyperchaotic map, ensuring that the rule selection, the nucleotide keystream, and the bit masks all derive from the same continuously evolving chaotic state, so the layers reinforce rather than duplicate one another.

The work arrives amid a broader surge of research into chaos-based image security, driven in part by the explosion of visual data transmitted across the Internet of Things, in medical telemetry, and in cloud storage. Related efforts in recent years have produced memristive hyperchaotic maps for pseudorandom number generation, fractional-order Hopfield neural networks applied to medical image privacy, lightweight chaotic ciphers for resource-constrained IoT devices, and hybrid schemes combining elliptic curve cryptography with genetic algorithms. The field has also learned hard lessons from cryptanalysis: several published chaotic ciphers have been broken when their chaos degenerated under finite precision or when their permutation and diffusion stages were insufficiently coupled. The new scheme’s designers explicitly target these weaknesses, grounding the design in formal proofs of key and plaintext sensitivity rather than relying solely on empirical testing.

For practitioners, the significance lies in the combination of provable properties and measured performance. A key space above 2^456 dwarfs the roughly 2^128 offered by many mainstream block ciphers in raw key size terms, and the formal sensitivity proofs provide assurance that the scheme does not harbor structural shortcuts. The authors, who contributed equally to the research, report no external funding and declare no competing interests. As data breaches grow in severity and images increasingly serve as high-capacity carriers of private information, encryption paradigms that combine nonlinear dynamics with unconventional alphabets may become essential infrastructure. This study suggests that the marriage of hyperchaos and DNA-style computation offers a cryptographically strong framework for keeping the visual world’s most sensitive frames out of unauthorized hands.

Subject of Research: Hyperchaotic image encryption using DNA sequence operations and multi-stage dynamic bit-level scrambling

Article Title: A hyperchaotic image encryption paradigm fusing DNA sequence operations with bit-level multi-stage dynamic scrambling

Article References: Kareem, S. R., & Pirdawood, M. A. (2026). A hyperchaotic image encryption paradigm fusing DNA sequence operations with bit-level multi-stage dynamic scrambling. Cluster Computing, 29(13), Article 772. https://doi.org/10.1007/s10586-026-06605-9

Image Credits: AI Generated

DOI: 10.1007/s10586-026-06605-9

Keywords: image encryption, hyperchaotic system, Lorenz system, DNA cryptography, bit-level permutation, chaotic maps, NPCR, UACI, information entropy, phase-space reconstruction attacks, Cluster Computing, cybersecurity

The scheme, named CNNHSIE, short for Convolutional Neural Network and Hyperchaotic System-based Image Encryption, is built around three core components. The first is a hyperchaotic system, a class of dynamical systems that exhibit not just one but multiple positive Lyapunov exponents, meaning their trajectories diverge exponentially in several independent directions at once. This extreme sensitivity to initial conditions makes hyperchaotic sequences ideal for generating pseudo-random matrices that look statistically indistinguishable from true noise to any observer who does not possess the exact initial values. In CNNHSIE, the hyperchaotic system produces the random matrix that drives both the scrambling of pixel positions and the alteration of pixel values, two operations that cryptographers call permutation and diffusion.

Permutation and diffusion are the twin pillars of image encryption. Permutation rearranges the positions of pixels so that the spatial structure of the original image is destroyed, while diffusion changes the actual pixel values so that even a single-bit change in the plaintext cascades through the entire ciphertext. Traditional schemes often perform these operations in separate, sequential passes, which can be computationally expensive and can leave exploitable structure behind. The Iranian researchers tackled this bottleneck with two novel techniques. The first, called HSPT for high-speed permutation technique, reorders pixels with an efficiency that dramatically reduces encryption time compared with conventional sorting-based or swapping-based permutation strategies. The second, DPDT for dynamic pixel diffusion technique, modifies pixel values in a way that adapts dynamically during the encryption process rather than following a fixed pattern, making it substantially harder for an attacker to model or reverse the transformation.

What sets CNNHSIE apart from many previous chaos-based cryptosystems is its incorporation of a convolutional neural network into the key-generation process. Specifically, the authors employ the VGG16 architecture, a deep convolutional network originally developed for large-scale image classification, to extract features from the plain image itself. These extracted features are then used to compute the public key. This design choice has an elegant consequence: the encryption key material is tied to the unique statistical fingerprint of each individual image, so even minor differences between two plaintext images lead to different key components. An attacker who obtains the ciphertext for one image gains no reusable shortcut for decrypting another, because the network-derived key material is image-specific and changes from one input to the next.

The researchers evaluated CNNHSIE rigorously using standard test images from the USC-SIPI image database, a widely used benchmark repository maintained by the University of Southern California, along with public datasets drawn from Radiopaedia, an open-access radiology resource, and Kaggle, the popular machine-learning data platform. The inclusion of medical imaging datasets is significant, because medical images are among the most sensitive classes of data transmitted over networks, and regulatory frameworks around the world impose strict confidentiality requirements on them. A scheme that performs well on both natural photographic images and clinical scans has a broader practical reach than one tested only on generic benchmarks.

The headline results are striking. For the standard 1024 by 1024 pixel test image known as Male, CNNHSIE achieved a unified average changing intensity, or UACI, of 33.4809 percent, a number that sits almost exactly at the theoretical ideal of 33.46 percent for a perfectly random-looking ciphertext. The number of pixels change rate, or NPCR, reached 99.6140 percent, meaning that when the encryption key was perturbed by even a minuscule amount, more than 99.6 percent of all ciphertext pixels changed value, the hallmark of extreme key sensitivity. The information entropy of the encrypted image measured 7.9998 bits out of a theoretical maximum of 8 bits for an 8-bit image, indicating that the distribution of pixel values in the ciphertext is essentially uniform and carries virtually no exploitable information about the original.

Correlation analysis told a similarly compelling story. Adjacent pixels in a natural image are almost always highly correlated, because neighboring pixels tend to have similar brightness values. Effective encryption must drive this correlation to zero in every direction, horizontal, vertical and diagonal. CNNHSIE produced ciphertexts with near-zero correlation coefficients across all tested directions, confirming that the permutation and diffusion stages thoroughly destroyed the statistical structure of the plaintext. Perhaps most importantly for real-world deployment, the scheme achieved these security metrics while encrypting the large 1024 by 1024 Male image in just 0.1216 seconds, a speed that places it firmly in the territory of real-time applications such as live video streaming, secure telemedicine consultations and on-the-fly transmission of surveillance imagery.

The authors report that CNNHSIE demonstrated the ability to resist a variety of common attacks, including the chosen-plaintext and known-plaintext attacks that plague weaker image cryptosystems. In a chosen-plaintext attack, an adversary deliberately encrypts specially crafted images to probe the internal workings of the algorithm; image-specific key material derived from the VGG16 feature extractor makes such probing far less informative, because the relationship between plaintext and key changes with every input. The combination of hyperchaotic pseudo-randomness, dynamic diffusion and neural key generation creates multiple independent layers of defense, so a weakness in any single layer does not compromise the whole system. High key sensitivity further ensures that brute-force attempts to guess the chaotic initial conditions face an astronomically large search space with no smooth gradient to follow.

This work sits within a rapidly growing research frontier that merges deep learning with chaos-based cryptography. Earlier efforts have explored DNA encoding schemes combined with fractional-order hyperchaotic systems, Latin square constructions, Joseph traversal and discrete Fourier transforms, and several groups have experimented with neural networks for key generation or ciphertext post-processing. Zefreh himself has a track record in this area, with prior publications on Latin square-based encryption and parallel diffusion-confusion cryptosystems. What distinguishes the new contribution is the explicit pairing of a proven, off-the-shelf feature extractor with high-speed permutation and dynamic diffusion, achieving a balance of security metrics and raw throughput that many earlier designs pursued separately rather than simultaneously.

The practical implications extend across the sectors where image confidentiality matters most. In healthcare, secure transmission of radiological images could protect patient privacy without adding perceptible latency to clinical workflows. In military and defense contexts, real-time encryption of reconnaissance imagery could reduce the window of vulnerability during transmission. In finance, encrypted document images could move through cloud infrastructure with stronger guarantees against tampering. The researchers note that data and code are available upon request from the corresponding author, which opens the door for independent verification and adoption by other laboratories. As digital image traffic continues its exponential growth, schemes like CNNHSIE, which treat speed and security as joint requirements rather than competing trade-offs, are likely to shape the next generation of multimedia security systems, and the marriage of chaotic dynamics with deep neural networks may prove to be one of the defining patterns of that evolution.

Subject of Research: A CNN and hyperchaotic system-based image encryption algorithm using high-speed permutation and dynamic diffusion

Article Title: CNNHSIE: CNN and hyperchaotic-based image encryption algorithm using high-speed permutation and dynamic diffusion

Article References: Zarei Zefreh, E., & Heydari, M. (2026). CNNHSIE: CNN and hyperchaotic-based image encryption algorithm using high-speed permutation and dynamic diffusion. Neural Computing and Applications, 38(17), Article 722. https://doi.org/10.1007/s00521-026-12419-y

Image Credits: AI Generated

DOI: 10.1007/s00521-026-12419-y

Keywords: image encryption, convolutional neural network, hyperchaotic system, VGG16, permutation, diffusion, cryptography, information entropy, NPCR, UACI, medical imaging security, deep learning