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