Chaos-Based Encryption With Dynamic Keys Falls to Chosen-Ciphertext Attack

Chaos has long seduced cryptographers. The unpredictable, butterfly-effect behavior of nonlinear dynamical systems seems, at first glance, tailor-made for secrecy: scramble an image with a chaotic map and the output looks like pure noise, indistinguishable from random. But looking random and being secure are two very different things, and a new study published in Applied Intelligence by Rong Zhou and Simin Yu of Guangdong University of Technology delivers a pointed reminder of that gap. The researchers have broken a chaos-based cryptosystem that was specifically designed to resist the very kind of attack they deployed, showing that its central security innovation — a dynamic key whose position is tied to the ciphertext — can be dismantled with far less effort than its designers assumed.

The target of the analysis is a class of image encryption schemes known as DKPC, short for a dynamic key whose position is related to the ciphertext. The appeal of such designs is easy to understand. In classical permutation-diffusion architectures, a static key shuffles pixel positions and then a diffusion stage mixes pixel values so that changing one input pixel alters many output pixels. Cryptanalysts have learned to exploit schemes in which these operations depend only on a fixed key, recovering the equivalent permutation and diffusion machinery once and then decrypting everything. Plaintext-related and ciphertext-related mechanisms were invented precisely to close that door: if the encryption process changes depending on the data being encrypted, the attacker cannot simply replay a recovered equivalent key against new ciphertexts.

DKPC pushes this idea further by introducing an additional dynamic key whose location within the algorithm is associated with the ciphertext itself, layered on top of a static key. The permutation stage is built on a breadth-first search, a graph-traversal technique that determines how pixels are shuffled, and this permutation depends only on the static key. The diffusion stage, which spreads the influence of each pixel across the image, is governed by both the static key and the dynamic key whose position shifts with the ciphertext. The designers of the scheme presented this dynamic key placement as its best innovation, arguing that because the attacker cannot even pin down where the dynamic key acts without knowing the ciphertext relationships, the system gains a substantial security margin over earlier plaintext-related algorithms.

Zhou and Yu’s analysis shows that this margin was largely an illusion. Their first move targets the permutation stage, which they demonstrate can be equivalently transformed into a typical permutation-diffusion structure. Once that structural equivalence is established, the intimidating appearance of the dynamic mechanism dissolves into a familiar form that cryptanalysts have attacked many times before. The breadth-first-search-based permutation, being dependent only on the static key, is deciphered through what the authors describe as an innovative approach — a method that peels away the shuffling layer without needing to know anything about the diffusion that follows it.

With the permutation neutralized, the attack proceeds to the diffusion stage, and here the chosen-ciphertext attack does the heavy lifting. In a chosen-ciphertext scenario, the attacker is granted access to a decryption oracle: they can submit ciphertexts of their choosing and observe the plaintexts that come out. This is a standard and widely accepted model in cryptanalysis, and it is often realistic, since decryption failures, padding errors, and interactive systems can leak exactly this kind of information. By crafting special ciphertexts and observing how the decryption process behaves, the attackers recover the equivalent static key of the diffusion first, then break the equivalent dynamic key separately. The separation is the crucial technical insight: although the dynamic key’s position is entangled with the ciphertext, its effect can be isolated and characterized through carefully chosen queries, allowing the two key components to be dismantled one after the other.

Perhaps the most striking claim in the paper concerns cost. The authors report that the complexity of their attack is much lower than that of cryptanalysis on other plaintext-related algorithms — the very family of schemes that DKPC was meant to outclass. In other words, the mechanism marketed as a security upgrade actually made the system easier to break than its predecessors, at least under the attack strategy Zhou and Yu developed. Theoretical analysis and experimental results both support the conclusion that the cryptanalysis is effective and feasible, meaning the researchers did not merely sketch an attack on paper but demonstrated it working against the actual scheme.

This result lands in a field that has seen a remarkable string of similar collapses. The paper’s reference list reads like a graveyard of chaotic ciphers: image encryption schemes built on two-point diffusion strategies and Hénon maps, algorithms using DNA coding and chaos, ciphers based on compressive sensing, systems built on memristive Hopfield neural networks, and enhanced plaintext-related chaotic schemes have all been broken in recent years by cryptanalysis groups, including Zhou and Yu themselves, who previously published security analyses of chaotic encryption algorithms related to the sum of plaintext pixel values and broke an enhanced plaintext-related chaotic image encryption algorithm. The pattern is consistent: a designer adds a clever twist to resist known attacks, the twist looks impregnable in security analyses that measure statistical randomness, and a cryptanalyst finds an equivalent structure or an oracle-based strategy that renders the twist irrelevant.

Why does this keep happening? Part of the answer lies in how chaotic ciphers are evaluated. Many proposed schemes are validated by showing that encrypted images have uniform histograms, low correlation between adjacent pixels, high entropy, and sensitivity to small key changes. These are necessary properties, but they are nowhere near sufficient. A cipher can produce beautifully random-looking output and still leak enough structure for an attacker to reconstruct equivalent keys. Cryptanalysis, by contrast, works at the level of algorithmic structure: it asks what an attacker with oracle access can infer, not what the ciphertext looks like to the eye. The DKPC break is a textbook illustration — the dynamic key position created a genuine structural complication, but the complication could be equivalently transformed away, and once transformed, standard chosen-ciphertext techniques finished the job.

The broader lesson for the field is that security must be argued against attack models, not against statistical tests. Modern cryptography rests on the principle, articulated by pioneers like Auguste Kerckhoffs, that a system should remain secure even if everything about it is public except the key. Chaos-based designs often implicitly assume that the complexity and apparent randomness of the chaotic dynamics substitute for rigorous proof. The accumulating record of breaks suggests otherwise: nonlinearity and sensitivity to initial conditions do not, by themselves, confer cryptographic strength. What matters is whether the mapping from key and plaintext to ciphertext can be inverted or equivalently reconstructed by an adversary with bounded resources, and that is a question that only formal cryptanalysis — or a proof of security — can answer.

For practitioners choosing encryption for real systems, the practical guidance is sobering and simple. Chaotic image encryption schemes published in the academic literature, however inventive their mechanisms, should not be treated as battle-tested cryptography; established, publicly vetted standards such as AES remain the appropriate choice for protecting data. For researchers, the Zhou and Yu paper is both a warning and a template: any new mechanism that ties key behavior to plaintext or ciphertext should be assumed vulnerable until it has survived chosen-plaintext and chosen-ciphertext analysis, and designers should proactively attempt the kind of equivalent-structure transformation that felled DKPC. The dynamic key idea was meant to move the goalposts; instead, it demonstrated once again that in cryptography, novelty is not security, and every clever twist must ultimately face the cryptanalyst’s oracle.

Subject of Research: Cryptanalysis of a chaos-based image encryption scheme with a ciphertext-related dynamic key

Article Title: Cryptanalysis on a chaos-based cryptosystem with dynamic key

Article References: Zhou, R., & Yu, S. (2026). Cryptanalysis on a chaos-based cryptosystem with dynamic key. Applied Intelligence, 56(14), Article 413. https://doi.org/10.1007/s10489-026-07446-0

Image Credits: AI Generated

DOI: 10.1007/s10489-026-07446-0

Keywords: chaos, cryptography, cryptanalysis, dynamic key, image encryption, chosen-ciphertext attack, permutation-diffusion, breadth-first search, Applied Intelligence, security analysis, nonlinear dynamics, equivalent key