The motivation for the work begins with a fundamental mismatch. Standard encryption algorithms such as AES, DES and RSA were designed to protect streams of text or raw data, and they perform reasonably well on such inputs. Digital images, however, are different beasts. They are large, they contain highly redundant pixel information, and neighboring pixels tend to be strongly correlated with one another, often sharing values that differ by only a few bits. When conventional ciphers are applied directly to image data, the processing becomes slow and the underlying structure of the picture can leak through. Steganography, the art of hiding one file inside another, offers concealment but not true cryptographic resistance to cryptanalysis. For applications like medical imaging and military reconnaissance, where confidentiality is non-negotiable, researchers have therefore turned to specialized image encryption methods built around two classical operations: confusion, which rearranges the positions of pixels, and diffusion, which alters the values of pixels.

The first pillar of the new scheme is chaos theory. Chaotic systems are nonlinear dynamical processes in which a minuscule change in the starting conditions produces wildly divergent outcomes over time, a phenomenon popularly known as the butterfly effect. This extreme sensitivity, combined with apparent randomness, makes chaotic maps attractive for generating pseudo-random keystreams that depend on secret initial values. The particular tool chosen here is the Arnold Cat Map, a deceptively simple transformation that stretches and folds a two-dimensional space, named for the cartoon cat whose face becomes an unrecognizable blur when the map is applied repeatedly. In the encryption pipeline, the Cat Map acts as the confusion layer: it permutes the coordinates of every pixel according to a matrix equation involving two secret positive integers, m and n, applied modulo the image dimension N. In the reported experiments the team selected m and n equal to 7 and iterated the transformation four times. Because the map preserves pixel values while shuffling their locations, the picture retains its histogram but loses all recognizable geometry, appearing as pure noise.

The second pillar borrows from molecular biology. DNA cryptography exploits the four-letter alphabet of nucleotides, adenine, cytosine, guanine and thymine, along with the complementary base-pairing rules that govern how these letters bind together. In a computational setting, binary data can be encoded into quaternary DNA sequences, and operations such as substitution and exclusive OR can be performed according to the pairing rules A with T and C with G. The researchers begin with a chosen DNA sequence representing each nucleotide as an eight-bit binary string. From each string they extract pairs of bits, starting with the least significant two bits, then the next two, and so on, assembling these fragments into seed values. The resulting binary strings are concatenated, a designated bit is flipped through a significant-bit-changing strategy, and permutation selection produces four key strings. These are arranged into an eight-by-eight key matrix, which serves as the secret keystream for the diffusion stage. The DNA layer thus introduces an additional dimension of randomness and an enlarged key space beyond what the chaotic map alone provides.

The full encryption procedure weaves these components together in a carefully ordered sequence. First, the original image is passed through the Arnold Cat Map, which scatters pixel positions across the frame. Next, the shuffled image is divided into blocks of eight-by-eight pixels. Each block is then combined with the DNA-derived key matrix using the XOR operation, a bitwise comparison that outputs a one whenever the two input bits differ. This XOR step constitutes the diffusion layer, transforming pixel values rather than merely relocating them. Finally, all processed blocks are concatenated to form the encrypted image. Decryption simply reverses the pipeline: the cipher image is broken into blocks, XORed with the same key matrix to recover the shuffled picture, and the inverse Cat Map transformation restores the original pixel coordinates. Crucially, an adversary would need both the DNA sequence parameters and the Cat Map keys to reconstruct anything meaningful, a requirement that substantially raises the bar against brute-force attempts.

To evaluate the scheme, the team ran MATLAB 2019a simulations on an Intel Core i3-1005G1 processor with 6 gigabytes of RAM, testing the algorithm on a hand X-ray, a chest X-ray and the classic Baboon test image. The encrypted outputs were visually indistinguishable from random noise, and decryption with the correct keys restored the originals faithfully. The researchers measured encryption and decryption times across images of varying dimensions, finding that processing time scales with image size, an expected but practically important result for real-time or resource-constrained systems. They also note that changing the image dimension alters the period of the Cat Map, which in turn affects key size and the strength of the confusion effect, trading improved security against increased computational and memory costs.

Quantitative security metrics told a consistent story. The mean square error between original and encrypted images was high, while the peak signal-to-noise ratio, or PSNR, was correspondingly low. In image encryption, a low PSNR is a virtue rather than a flaw: it signals that the cipher image bears almost no resemblance to the source, which is precisely what a defender wants. Histogram analysis reinforced this conclusion. The histograms of the encrypted images differed dramatically from those of the originals and appeared uniformly distributed, denying an attacker the statistical fingerprints that leak information about the underlying content. Correlation coefficients between adjacent pixels, measured horizontally, vertically and diagonally, dropped to nearly zero after encryption, whereas natural images typically exhibit correlations close to one in all three directions. This near-total destruction of neighboring-pixel relationships is a hallmark of effective confusion.

Information entropy provided further evidence of robustness. For an eight-bit image, maximum theoretical entropy is eight bits, achieved when all 256 gray levels occur with equal probability. The encrypted images produced entropy values approaching 7.9980, edging out comparable schemes in the literature that reported values of 7.9966 and 7.9968. The team also subjected the method to differential attack analysis using two standard indices: the number of pixels change rate, NPCR, and the unified average changing intensity, UACI. The scheme achieved NPCR values of approximately 99 percent and UACI values near 33 percent, the theoretical benchmarks for resisting differential attacks. These figures mean that flipping a single pixel in the plaintext produces a completely different ciphertext, making chosen-plaintext and known-plaintext attacks extraordinarily difficult to mount.

The study positions itself within a broader research landscape in which one-dimensional chaotic maps have given way to richer two- and three-dimensional systems, and in which DNA operations are increasingly paired with chaos to compensate for their individual weaknesses. Earlier efforts combined chaotic maps with SHA-256 hashing, fractal structures, substitution boxes and hyperchaotic dynamics, each adding layers of complexity. The new contribution distills these lessons into a lightweight framework that pairs a well-understood permutation mechanism with biologically inspired key generation, achieving strong security without the computational overhead of multi-dimensional chaotic systems. The authors acknowledge that their future work will probe the scheme’s resistance to chosen-plaintext and known-plaintext attacks under varying ACM parameters and DNA sequences. For now, the results suggest that the humble tools of molecular biology, when married to the mathematics of chaos, can offer a surprisingly powerful shield for the images the world increasingly depends on keeping secret.

Subject of Research: Hybrid image encryption combining DNA cryptography and the Arnold Cat Map chaotic transformation

Article Title: Enhanced image encryption using a hybrid technique based on dna cryptography and arnold cat map

Article References: Bano, M., Iqbal, J., Habib, U., Hajjej, F., & Ullah, I. (2026). Enhanced image encryption using a hybrid technique based on dna cryptography and arnold cat map. Cluster Computing, 29(13), Article 770. https://doi.org/10.1007/s10586-026-06499-7

Image Credits: AI Generated

DOI: 10.1007/s10586-026-06499-7

Keywords: image encryption, DNA cryptography, Arnold Cat Map, chaotic maps, XOR operation, cryptography, information entropy, PSNR, histogram analysis, NPCR, UACI, data security

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