The scheme, developed by El Mahdi Mouloua and colleagues, rests on two novel operators that work in tandem. The first is a chaotic polycyclic shift, denoted by the Greek letter phi with a chaotic vector index, which generalizes the familiar left and right bit rotations used in classical cryptography. Instead of shifting data by a fixed amount, the operator displaces pixels and their bits by amounts dictated by a chaotic sequence, so that the pattern of movement never repeats and cannot be predicted without the secret key. This operator drives the confusion mechanism of the cipher, scrambling the relationship between the original image and its encrypted form.

The second operator addresses the other pillar of strong encryption: diffusion. In cryptographic terms, confusion hides the connection between the key and the ciphertext, while diffusion ensures that a change to a single element of the plaintext spreads throughout the entire encrypted output. The researchers call their diffusion engine the chaotic avalanche effect, symbolized by xi. It creates a strong binding between each encrypted pixel and the following original pixel, so that information from one part of the image cascades into the encryption of subsequent parts. A single flipped bit in the input therefore triggers an avalanche of changes across the ciphertext, denying attackers the ability to modify localized regions of an image undetected.

The intellectual roots of the work reach into an unexpected corner of mathematics: the theory of polycyclic codes. One of the co-authors, Oussama Kabbouch, had previously explored the algebraic structure of polycyclic codes with collaborators, building on earlier generalizations of cyclic codes introduced by Lopez-Permouth, Parra-Avila and Szabo in 2009. By importing the cyclic shift idea from coding theory into the chaotic domain, the team transformed a static algebraic operation into a dynamic, key-dependent one. The chaotic vector that steers the shift is generated by chaotic maps, whose extreme sensitivity to initial conditions means that even a minute difference in the key produces a completely different scrambling pattern.

Chaos theory has long fascinated cryptographers for precisely this reason. Chaotic systems, such as the logistic map and its more elaborate relatives like the intertwining logistic map, exhibit deterministic but seemingly random behavior. Their trajectories never settle into a pattern, yet they can be reproduced exactly by anyone holding the same initial values. This combination of reproducibility and unpredictability makes them natural candidates for generating the keystreams and permutation sequences that encryption demands. The new scheme taps this property to control both the polycyclic shifts and the avalanche diffusion, ensuring that every stage of the cipher is driven by the same chaotic engine and the same secret key material.

The experimental evaluation reported in the paper reads like a checklist of modern cryptographic benchmarks, and the scheme passes each one. The key space, which measures how many possible secret keys an attacker would need to brute-force, is described as large, a critical property given that many published chaotic ciphers have been broken because their key spaces proved too small. Key sensitivity is similarly high: encrypting the same image with keys that differ by a single digit yields entirely different ciphertexts, which prevents an attacker from gleaning information through near-miss keys.

Statistical tests on the encrypted images tell a similar story. The histograms of the encrypted outputs are uniform, meaning that every pixel value appears with equal frequency and no statistical fingerprint of the original image survives. The correlation between adjacent pixels, which in natural images is typically very high because neighboring pixels tend to look alike, drops to low values in the ciphertext, destroying the structural redundancy that attackers exploit in known-plaintext and chosen-plaintext attacks. Information entropy, a measure of randomness, reaches high values close to the theoretical maximum of eight bits per pixel for eight-bit images, indicating that the encrypted data is essentially indistinguishable from noise.

Two additional metrics, standard in the image encryption literature, quantify the scheme’s resistance to differential attacks. The number of pixels change rate, or NPCR, measures the fraction of pixels that change when the plaintext is altered by a single bit, while the unified average changing intensity, or UACI, measures the average strength of those changes. Ideal values are close to 99.6 percent and 33.4 percent respectively, and the reported strong encryption performance of the scheme, together with low peak signal-to-noise ratio values between original and encrypted images, indicates that the chaotic avalanche effect delivers the full diffusion strength needed to defeat these attacks. Low PSNR here is a virtue: it confirms that the encrypted image leaks essentially nothing about the original.

The broader context makes the contribution timely. The literature is littered with image encryption schemes that looked impressive on paper but collapsed under cryptanalysis, including DNA-based ciphers and designs built on the two-dimensional logistic-adjusted-sine map, both of which were broken by dedicated attacks. Meanwhile the demand for image security keeps growing, driven by telemedicine platforms transmitting diagnostic scans, the Industrial Internet of Things streaming visual sensor data, and cloud storage services holding vast archives of personal photographs. Recent research has explored hyperchaotic maps, memristive neural networks, quantum walks and DNA encoding as ingredients for next-generation ciphers, and the Moroccan-Romanian team positions its polycyclic approach within this competitive landscape, arguing that a mathematically grounded shift operator offers a cleaner and more principled confusion mechanism than ad hoc permutation tricks.

The researchers, who contributed equally to the work alongside co-authors from institutions in Morocco and Romania, suggest that the combination of a generalized cyclic structure with chaotic dynamics could extend beyond still images, potentially informing the protection of video streams and other multimedia content where efficiency and security must coexist. For now, the scheme stands as a demonstration that classical algebra and modern chaos theory can be fused into a cipher that is more than the sum of its parts: a system in which the ancient idea of the cyclic shift is reborn, steered by randomness that only the legitimate key holder can reproduce, and in which every pixel of an image guards the secrets of every other.

Subject of Research: Chaotic image encryption using polycyclic shift operators

Article Title: Design of a secure image encryption scheme using chaotic polycyclic shift

Article References: Mouloua, E. M., Ben-Hdech, A., Bejan, C. A., Es-Sabry, M., Najmeddine, M., Kabbouch, O., Bucerzan, D., & Essaid, M. (2026). Design of a secure image encryption scheme using chaotic polycyclic shift. Cluster Computing, 29(13), Article 771. https://doi.org/10.1007/s10586-026-06588-7

Image Credits: AI Generated

DOI: 10.1007/s10586-026-06588-7

Keywords: image encryption, chaos theory, polycyclic codes, cryptography, confusion and diffusion, chaotic maps, multimedia security, NPCR, UACI, information entropy, Cluster Computing, data security

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

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

Chaos has long fascinated cryptographers because chaotic systems share a crucial property with good ciphers: extreme sensitivity to initial conditions. A tiny change in the starting values of a chaotic map produces wildly divergent trajectories, which is precisely the behavior one wants from an encryption key. Yet not all chaotic maps are created equal. Many classical one-dimensional maps, such as the logistic map, suffer from narrow chaotic ranges, windows of periodic behavior, and dynamical structures that can be reconstructed by determined attackers. Two-dimensional maps offer richer dynamics, but the field has been locked in something of an arms race, with researchers continually combining elementary functions in new ways to produce systems whose output is harder to predict and whose chaotic parameter space is broader.

The 2D-NSSCM is the latest salvo in that race. The map integrates anti-trigonometric functions, specifically inverse sine operations, together with square root and cubic terms into a coupled two-dimensional system. This synergistic combination is not arbitrary. The arcsine function folds the state space in a nonlinear way, the square root operation compresses and stretches the trajectory in a second direction, and the cubic term amplifies divergence between nearby orbits. Together, these operations dramatically increase the complexity of the system’s nonlinear dynamics. According to the authors, the resulting map demonstrates a significantly broader chaotic range, heightened sensitivity to initial conditions, and more intricate chaotic behavior than comparable maps in the literature, all of which translate directly into a stronger raw material for generating pseudo-random keystreams.

To appreciate why these dynamical properties matter, it helps to understand how chaos-based image encryption works. Unlike text, images are characterized by massive data volumes, strong redundancy between adjacent pixels, and high correlation among neighboring samples, particularly in remote sensing imagery where large regions of terrain can look nearly identical. Traditional ciphers such as AES can encrypt images, but they are often too slow for the throughput demands of satellite data pipelines and do not inherently address the structural correlations that leak information. Chaotic image ciphers typically proceed in two stages: permutation, in which pixel positions are shuffled to destroy spatial correlations, and diffusion, in which pixel values are modified so that a change to any single pixel propagates across the entire image. The quality of the chaotic keystream that drives both stages determines the security of the whole scheme.

The encryption algorithm proposed by the Qingdao team deploys the 2D-NSSCM in a carefully structured pipeline tailored to color remote sensing images, which consist of red, green, and blue channels that must each be protected while their inter-channel relationships are also obscured. The method unfolds in three primary phases. First, the image undergoes multiple iterations of interleaved scrambling, in which pixel positions are permuted in an interleaved fashion across the color channels. Second, these scrambling rounds are integrated with cross-channel diffusion, meaning that the pixel values of one channel influence the encrypted values of the others, binding the three channels together so that an attacker cannot analyze them independently. Finally, a last cycle of alternating scramble operations completes the process, adding a final layer of positional confusion.

The security evaluation of the resulting ciphertext is where the scheme’s numbers become genuinely striking. Information entropy, a measure of the unpredictability of pixel values, ideally approaches eight bits for an eight-bit image; the encrypted images produced by the algorithm achieve an average entropy of 7.9993, essentially indistinguishable from perfect randomness. Adjacent pixel correlation, which measures how strongly neighboring pixels in the original image resemble one another, drops to approximately 0.001 in the encrypted output, indicating that the scrambling and diffusion stages have thoroughly erased the spatial structure that makes images visually and statistically recognizable.

Resistance to differential attacks, in which an adversary encrypts two nearly identical images and studies how the ciphertexts differ, is quantified by two standard metrics: the number of pixels change rate, or NPCR, and the unified average changing intensity, or UACI. The theoretical ideal values are roughly 99.6 percent and 33.46 percent, respectively. The 2D-NSSCM-based algorithm achieves an NPCR of 99.6104 percent and a UACI of 33.4630 percent, sitting almost exactly on those ideals. In practical terms, flipping a single pixel in the plaintext image changes more than 99.6 percent of the pixels in the encrypted image, leaving an attacker with no meaningful foothold for differential cryptanalysis.

Perhaps the most impressive figure is the key space. A cipher is only as strong as the number of possible keys an attacker must search, and modern security standards generally demand a key space of at least two to the power of one hundred to defeat brute-force attacks, even those accelerated by large computing clusters. The proposed algorithm offers a key space approaching two to the power of 478, an astronomically large number that renders exhaustive key search utterly infeasible with any conceivable technology. This vast keyspace stems from the high precision required to specify the initial conditions and parameters of the hyperchaotic map, since even a difference in the fifteenth decimal place of the initial state produces a completely different chaotic trajectory and therefore a completely different keystream.

The work, funded by the National Natural Science Foundation of China under grant number 62202252, arrives at a moment when the security of satellite imagery is no longer a niche concern. Commercial constellations now image nearly every point on the planet daily, and the downstream market for that data spans defense, insurance, commodity trading, environmental monitoring, and humanitarian response. Images transmitted in the clear or under weak encryption can reveal troop movements, expose the layouts of critical facilities, or be manipulated to mislead analysts. The authors position their scheme within a rapidly growing body of research that includes DNA-based encryption, compressive sensing combined with chaos, memristive hyperchaotic maps, and quantum-inspired multi-image schemes, each competing to offer stronger security at acceptable computational cost for the enormous data rates that modern remote sensing demands.

As with any newly proposed cipher, the ultimate test of the 2D-NSSCM will be time and scrutiny by the wider cryptanalytic community, since many chaos-based schemes that looked impregnable in their original papers later yielded to chosen-plaintext or structural attacks. But the statistical evidence presented by the Xu and Wang team, spanning entropy, correlation, differential attack resistance, and key space, places the new map among the strongest performers reported to date for color remote sensing image encryption. If the scheme withstands independent analysis and can be implemented efficiently on the hardware that flies aboard satellites and runs in ground processing centers, the humble combination of a sine function, a square root, and a cubic term may end up guarding some of the most consequential pictures humanity has ever taken.

Subject of Research: Chaos-based encryption of color remote sensing images using a novel two-dimensional nonlinear hyperchaotic map

Article Title: Color remote sensing image encryption based on a 2D nonlinear sine-sqrt-cubic map

Article References: Xu, X.-L., Jin, S.-W., Kang, Z.-C., Wang, H.-X., & Wang, M.-M. (2026). Color remote sensing image encryption based on a 2D nonlinear sine-sqrt-cubic map. Cluster Computing, 29(14), Article 808. https://doi.org/10.1007/s10586-026-06608-6

Image Credits: AI Generated

DOI: 10.1007/s10586-026-06608-6

Keywords: 2D-NSSCM, hyperchaotic map, image encryption, remote sensing, color image security, chaos theory, cryptography, information entropy, NPCR, UACI, satellite imagery, Cluster Computing