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 research team, led by Ahmed Kamal of Alexandria University together with H. A. El-Kamchochi, Adel El-Fahar, and Esam A. A. Hagras of Delta University for Science and Technology, calls the framework CCEC-SIE, short for Chaotic Complex Elliptic Curve-based Secure Image Encryption. The scheme’s central innovation is deceptively simple: instead of defining elliptic curves over ordinary prime fields, the researchers define them over Gaussian primes, complex numbers of the form c plus di whose norm equals an ordinary prime. Because each coordinate in such a field is itself a complex number, the number of available points on the curve grows quadratically, expanding the cryptographic space without requiring larger primes or heavier computation.

The mathematics behind this expansion follows directly from Hasse’s theorem, which bounds the number of points on an elliptic curve over a finite field. For a rational prime p, the field contains roughly p elements, but a Gaussian prime built from the same p yields a field of order p squared. In a worked example using the curve y squared equals x cubed plus x plus 1 over the prime 7, the rational version produces a modest set of points, while the Gaussian extension yields 55 points, comfortably within the Hasse bound of 36 to 64 for a field of order 49. Scaled to cryptographic sizes, this means a 256-bit parameter effectively doubles the key space, a gain achieved with the same curve equation and no increase in prime size.

Key exchange in the scheme adapts the classical ElGamal protocol to this Gaussian domain. The sender picks a random ephemeral key, computes two cipher points on the curve, and transmits them to the receiver, who recovers the shared secret using a private scalar. Because every point coordinate carries both real and imaginary components, the resulting shared key is itself a complex number, which then seeds the entire encryption pipeline. The authors demonstrate the protocol with complete numerical examples, showing that the receiver’s recovered point matches the sender’s original plaintext point exactly, confirming the algebraic correctness of the construction.

Once the shared key is established, the scheme turns to chaos theory for bulk encryption. Classical one-dimensional chaotic maps such as the Logistic and Tent maps are workhorses of image encryption, but they suffer from well-documented weaknesses: restricted chaotic ranges, non-uniform output distributions, periodic windows, and vulnerability to parameter estimation attacks. The researchers address these flaws by splitting each map’s control parameter into a primary value and a dynamically selected coefficient derived from the secret key, then applying a modulo-1 operation to keep iterations bounded. The resulting Iterative Logistic Map and Iterative Tent Map sustain chaotic behavior across a parameter interval roughly ten times wider than their classical counterparts, with Lyapunov exponents remaining positive throughout the operating range. The enhanced maps also passed the full NIST SP800-22 randomness test suite over a thousand independent iterations on million-bit sequences.

These chaotic sequences feed a second major component: a Complex Invertible Key Matrix, or CIKM. The construction generalizes the classical Hill cipher, a linear encryption technique long considered too fragile for modern use, into the complex domain. A chaotic matrix whose entries are complex numbers generated independently by the two enhanced maps is embedded in a block structure alongside identity matrices, producing a larger key matrix that is its own inverse. This self-invertibility means the same matrix encrypts and decrypts, eliminating the computationally expensive inversion step entirely. Pixel-level scrambling is handled separately by Arnold’s Cat Map, whose control parameters are derived from the shared secret key, ensuring that both the permutation and the diffusion stages are keyed and image-dependent.

Authentication is woven into the design rather than bolted on. Before transmission, the sender computes a hash of the encrypted image, combines it with a hash derived from a curve point tied to the plaintext, and produces a digital signature using the sender’s private key. Crucially, the signature is verified before decryption begins, so any tampered or corrupted ciphertext is rejected without wasting computational resources on a meaningless reconstruction. The verification requires only a single complex point multiplication, which the authors note is more efficient than existing authenticated image encryption schemes. This pre-decryption check is particularly valuable in distributed or resource-constrained environments where bandwidth and processing cycles are at a premium.

The security evaluation is extensive. Encrypted versions of standard test images including Lena, Cameraman, Baboon, and Peppers at resolutions from 256 by 256 up to 1024 by 1024 showed uniformly flat histograms, with chi-square tests confirming statistical uniformity that outperformed a recent Sine-map-based competitor. Pixel correlation coefficients, which approach one in natural images, dropped to near zero in all horizontal, vertical, and diagonal directions. Information entropy of the ciphertexts approached the theoretical maximum of 8 bits per pixel for 8-bit grayscale images. Against differential attacks, the scheme achieved a Number of Pixels Change Rate of 99.62 percent and a Unified Average Changing Intensity of 33.46 percent, both matching or exceeding the ideal theoretical values. The total key space, computed from the secret key components, image hashes, private keys, chaotic map parameters, and scrambling controls, reaches an estimated 2 to the power of 896, far beyond the 2 to the 128 threshold generally considered safe against brute-force enumeration.

Perhaps the most surprising results concern computational efficiency, an area where complex arithmetic might be expected to hurt rather than help. Because multiplication of Gaussian integers splits into independent computations of real and imaginary parts, hardware multipliers handle inputs on the order of p rather than p squared, roughly halving the digit count per operand. Under schoolbook long multiplication, this reduces time complexity from order n squared to order n squared divided by 4, a fourfold speedup that persists even when two parallel multipliers compute the real and imaginary parts simultaneously. Elliptic curve operations are deliberately restricted to a constant number per session, independent of image size, so the dominant cost remains efficient pixel-level operations and complex matrix diffusion. The authors report low computational overhead suitable for near real-time secure image transmission at standard resolutions.

The scheme does make a deliberate trade-off. Because the complex self-invertible matrix applies a global transformation, any modification to the ciphertext, whether from noise injection, data loss, or deliberate cropping, propagates across the entire decrypted image. Peak signal-to-noise ratio measurements under Gaussian noise, salt-and-pepper noise, and occlusion attacks at 12.5, 25, and 50 percent data loss all showed severe degradation, rendering decrypted outputs unusable. The authors frame this not as a vulnerability but as a feature aligned with high-security requirements: the digital signature catches any corruption before decryption, and the extreme sensitivity guarantees that tampering cannot go undetected. Future work, they note, will extend the framework to video and hyperspectral imagery and explore adaptive key management strategies, but for now the Gaussian domain offers image encryption a broader, faster, and more defensible mathematical home.

Subject of Research: Gaussian elliptic curve cryptography and chaotic complex matrix methods for secure image encryption and authentication

Article Title: Secure image encryption and authentication using Gaussian elliptic curve and complex invertible matrix

Article References: Kamal, A., El-Kamchochi, H. A., El-Fahar, A., & Hagras, E. A. A. (2026). Secure image encryption and authentication using Gaussian elliptic curve and complex invertible matrix. Cluster Computing, 29(14), Article 798. https://doi.org/10.1007/s10586-026-06373-6

Image Credits: AI Generated

DOI: 10.1007/s10586-026-06373-6

Keywords: image encryption, elliptic curve cryptography, Gaussian integers, chaotic maps, ElGamal key exchange, digital signature, Hill cipher, Arnold Cat Map, cryptography, information security, complex numbers, differential attacks