Cryptanalysis and design for a family of plaintext-non-delayed chaotic ciphers

Qianxue Wang; Simin Yu

arxiv: 2509.11158 · v2 · submitted 2025-09-14 · 💻 cs.CR

Cryptanalysis and design for a family of plaintext-non-delayed chaotic ciphers

Qianxue Wang , Simin Yu This is my paper

Pith reviewed 2026-05-18 17:03 UTC · model grok-4.3

classification 💻 cs.CR

keywords chaotic ciphercryptanalysisPNDCCchain attackpermutation-diffusiondifferential attackplaintext-delayed cipher

0 comments

The pith

Statistical tests are not enough to secure plaintext-non-delayed chaotic ciphers.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper re-examines plaintext non-delayed chaotic ciphers, where the diffusion equation gives plaintext no delay term but includes ciphertext feedback. It constructs a three-stage permutation-diffusion-permutation example that meets all common statistical criteria yet falls to four attacks: a homogeneous differential attack, an S-PTC attack, a new impulse-step-based differential attack, and a new chain attack. The authors then generalize the chain attack to any multi-stage PNDCC by showing that consistent decryption chains let an attacker recover every permutation, after which the diffusion equations can be solved directly. They close by proposing plaintext-delayed chaotic ciphers as a design that avoids the same reconstruction path.

Core claim

The chain attack breaks a class of multi-stage PNDCCs because, once a consistent decryption chain is reconstructed, all permutations become known; the entire diffusion process then reduces to solving a system of simultaneous equations.

What carries the argument

The chain attack, which recovers every permutation by applying summarized chaining rules to a consistent decryption chain.

Load-bearing premise

The mathematical model of multi-stage PNDCC and the chaining rules let an attacker reconstruct all permutations whenever a consistent decryption chain exists.

What would settle it

A concrete multi-stage PNDCC for which no consistent decryption chain exists or for which the resulting linear system remains unsolvable after any attempted chain reconstruction.

Figures

Figures reproduced from arXiv: 2509.11158 by Qianxue Wang, Simin Yu.

**Figure 2.** Figure 2: Histograms of the Boy plaintext and ciphertext [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗

**Figure 4.** Figure 4: Block diagram of breaking a three-stage permutation-diffusion-permutation PNDCC using a left-to-right impulse-step-based differential attack. [PITH_FULL_IMAGE:figures/full_fig_p004_4.png] view at source ↗

**Figure 5.** Figure 5: Flowchart of the ISBDA algorithm [PITH_FULL_IMAGE:figures/full_fig_p004_5.png] view at source ↗

**Figure 6.** Figure 6: Simulation results of breaking the three-stage permutation-diffusion [PITH_FULL_IMAGE:figures/full_fig_p005_6.png] view at source ↗

**Figure 7.** Figure 7: Decryption block diagram for multi-stage PNDCC. [PITH_FULL_IMAGE:figures/full_fig_p006_7.png] view at source ↗

**Figure 8.** Figure 8: Schematic of a complete chain of length M×N derived from Eq. (13). B. Basic Method of the Chain Attack In this section, we continue to use the five-stage permutation-diffusion-permutation-diffusion-permutation PNDCC as an example to illustrate the basic method of the chain attack, which generalizes to other multi-stage cases without loss of generality. Decrypting associated positions via the positional d… view at source ↗

**Figure 9.** Figure 9: A complete chain of length 9 formed by the decryption machine. [PITH_FULL_IMAGE:figures/full_fig_p008_9.png] view at source ↗

**Figure 10.** Figure 10: Block diagram of the decryption machine and illustration of the change in [PITH_FULL_IMAGE:figures/full_fig_p009_10.png] view at source ↗

**Figure 11.** Figure 11: A complete chain of length 9 obtained by reordering Eq. (22) using [PITH_FULL_IMAGE:figures/full_fig_p010_11.png] view at source ↗

**Figure 13.** Figure 13: Result after reordering by plaintext serial indices. [PITH_FULL_IMAGE:figures/full_fig_p010_13.png] view at source ↗

**Figure 14.** Figure 14: Illustration of recovering the mid-permutation 1 [PITH_FULL_IMAGE:figures/full_fig_p011_14.png] view at source ↗

**Figure 15.** Figure 15: Flowchart of the chain attack in the general case. [PITH_FULL_IMAGE:figures/full_fig_p011_15.png] view at source ↗

read the original abstract

Plaintext non-delayed chaotic cipher (PNDCC) means that in the diffusion equation, plaintext has no delay terms while ciphertext has a feedback term. In existing literature, chaotic cipher diffusions invariably take this form. Since its introduction, PNDCC has attracted attention but also doubts. Designers of chaotic ciphers usually claim PNDCC security by statistical tests, while rigorous cryptographic proofs are absent. Thus, it is necessary to re-examine its design rationale and empirical security. To address this issue, we present a typical example of a three-stage permutation-diffusion-permutation PNDCC, which contains multiple security vulnerabilities. Although all of its statistical indicators show good performance, we are able to break it using four different attacks. The first is a differential attack based on homogeneous operations; the second is an S-PTC attack; the third is a novel impulse-step-based differential attack (ISBDA), proposed in this paper, and the fourth is a novel chain attack, also introduced here. These results demonstrate that the fulfilment of statistical criteria is not a sufficient condition for the security of PNDCC. Then, based on a mathematical model of multi-stage PNDCC, we show that the proposed chain attack can successfully break a class of multi-stage PNDCCs. The key technique of the chain attack depends on how to reveal all permutations. To address this key problem, we summarize the chaining rules and show that, from the attacker's perspective, if the same decryption chain can be reconstructed then all permutations can be deciphered. To that end, the entire diffusion process can be broken by solving a system of simultaneous equations. Finally, as a secure improvement, we propose a new scheme termed plaintext-delayed chaotic cipher (PDCC) that can resist various cryptanalytic attacks.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

This paper breaks a common PNDCC diffusion structure with two new attacks and generalizes one to a class, but the chain attack's reach depends on how well its rules hold up beyond the example.

read the letter

The main takeaway is that statistical tests alone do not secure plaintext-non-delayed chaotic ciphers. The authors give a concrete three-stage permutation-diffusion-permutation example that passes the usual batteries yet falls to four attacks, including their new impulse-step-based differential attack and a chain attack that recovers permutations via explicit chaining rules before solving the diffusion equations. They then model a wider family of multi-stage PNDCCs and argue the same chain method applies once the rules let an attacker reconstruct all permutations from a consistent decryption path. Finally they sketch a plaintext-delayed variant (PDCC) meant to block these lines of attack. What stands out is the explicit chaining rules and the move from one example to a class; that framing is cleaner than most prior chaos-cipher attacks I have seen. The three-stage case is worked out in enough detail to show the attacks actually recover material, which is better than pure theoretical sketches. The soft spot is the generalization step. The chain attack only works if the summarized rules really let you recover every permutation for arbitrary multi-stage choices and realistic key sizes; if the rules are narrower or need extra attacker knowledge not stated in the model, the class claim shrinks. The PDCC countermeasure is described at a high level, so it is not yet clear how thoroughly it was checked against the same attack family. This paper is aimed at people who design or analyze chaos-based image or multimedia encryption schemes. A reader who already works in that niche will find the attacks and the model useful to test against their own constructions. It is coherent enough on its own terms to deserve a serious referee, though the review should focus on verifying the chaining rules and the scope of the multi-stage result.

Referee Report

3 major / 2 minor

Summary. The paper examines plaintext-non-delayed chaotic ciphers (PNDCC), presents a three-stage permutation-diffusion-permutation example that passes statistical tests yet is broken by four attacks (differential, S-PTC, novel impulse-step-based differential attack, and novel chain attack), generalizes the chain attack to a class of multi-stage PNDCCs via a mathematical model and summarized chaining rules that reconstruct permutations from consistent decryption chains before solving a system of equations for the diffusion, and proposes a plaintext-delayed chaotic cipher (PDCC) as an improved design resistant to such attacks.

Significance. If the attacks and generalization hold, the work demonstrates that statistical criteria are insufficient for security in chaotic ciphers, provides concrete cryptanalytic techniques including two novel ones, and offers a design alternative; this contributes to the field by supplying falsifiable attacks on a common diffusion form and machine-checkable reconstruction rules in the chain attack.

major comments (3)

[Abstract] Abstract, paragraph on chain attack generalization: The central claim that the chain attack breaks a class of multi-stage PNDCCs rests on the mathematical model and summarized chaining rules enabling reconstruction of all permutations from any consistent decryption chain. The manuscript must supply the explicit mathematical statements of these chaining rules (including how they apply for arbitrary permutation families and key sizes) and verify that the reconstruction step succeeds without additional attacker knowledge; otherwise the subsequent system-of-equations recovery of the diffusion does not apply to the claimed class.
[Three-stage example] Section describing the three-stage example and attacks: The four attacks (including the novel ISBDA and chain attack) are asserted to break the cipher despite good statistical performance, but the manuscript should include concrete verification such as recovered key sizes, success probabilities, or the explicit system of equations solved in the chain attack to confirm full key recovery rather than theoretical vulnerabilities only.
[PDCC proposal] Section on the proposed PDCC improvement: The security claims for the plaintext-delayed chaotic cipher must be supported by analysis showing resistance to the differential, S-PTC, ISBDA, and chain attacks presented earlier; without this, the improvement remains unverified against the paper's own attack techniques.

minor comments (2)

[Mathematical model] Notation: Ensure consistent definition and use of terms such as 'chaining rules' and 'decryption chain' when first introduced in the mathematical model section.
[Introduction] References: Add citations to prior work on chaotic cipher cryptanalysis to better situate the novel ISBDA and chain attack relative to existing differential and algebraic attacks.

Simulated Author's Rebuttal

3 responses · 0 unresolved

We thank the referee for the careful reading and constructive major comments. We respond to each point below and indicate planned revisions to strengthen the presentation of the attacks and the PDCC proposal.

read point-by-point responses

Referee: [Abstract] Abstract, paragraph on chain attack generalization: The central claim that the chain attack breaks a class of multi-stage PNDCCs rests on the mathematical model and summarized chaining rules enabling reconstruction of all permutations from any consistent decryption chain. The manuscript must supply the explicit mathematical statements of these chaining rules (including how they apply for arbitrary permutation families and key sizes) and verify that the reconstruction step succeeds without additional attacker knowledge; otherwise the subsequent system-of-equations recovery of the diffusion does not apply to the claimed class.

Authors: We agree that the abstract and the generalization section would benefit from more explicit statements. In the revised manuscript we will insert the full mathematical formulation of the chaining rules, including their precise application to arbitrary permutation families and key sizes, together with a short verification argument showing that any consistent decryption chain suffices for permutation reconstruction without further attacker knowledge. revision: yes
Referee: [Three-stage example] Section describing the three-stage example and attacks: The four attacks (including the novel ISBDA and chain attack) are asserted to break the cipher despite good statistical performance, but the manuscript should include concrete verification such as recovered key sizes, success probabilities, or the explicit system of equations solved in the chain attack to confirm full key recovery rather than theoretical vulnerabilities only.

Authors: The current text presents the attacks through their mathematical derivations. To supply the requested concrete verification we will add, in the revised version, an explicit system of equations for the chain attack on the three-stage example, together with numerical results on recovered key sizes and observed success probabilities obtained from our simulations. revision: yes
Referee: [PDCC proposal] Section on the proposed PDCC improvement: The security claims for the plaintext-delayed chaotic cipher must be supported by analysis showing resistance to the differential, S-PTC, ISBDA, and chain attacks presented earlier; without this, the improvement remains unverified against the paper's own attack techniques.

Authors: We accept that a targeted resistance analysis is necessary. In the revised manuscript we will add a dedicated subsection that examines the PDCC against each of the four attacks, showing how the plaintext-delay term prevents the homogeneous differential relations, disrupts the S-PTC structure, invalidates the impulse-step assumptions of ISBDA, and breaks the formation of consistent decryption chains required by the chain attack. revision: yes

Circularity Check

0 steps flagged

No significant circularity: attack reduces to cipher equations and observed chaining rules

full rationale

The paper presents cryptanalytic attacks on PNDCC constructions, including a chain attack that reconstructs permutations via summarized chaining rules derived from the multi-stage model and then solves the resulting system of equations taken directly from the diffusion definition. These steps are not equivalent to their inputs by construction; the rules and equations originate from the cipher specification and attacker observations rather than from any fitted parameter or self-referential definition. No load-bearing self-citation, uniqueness theorem, or ansatz smuggling is present in the provided derivation. The statistical-test critique is independent of the attack success. The work is therefore self-contained against external benchmarks.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claims rest on the assumption that the described three-stage structure and the multi-stage mathematical model accurately represent the family of PNDCCs under study, plus the domain assumption that the chaining rules permit full permutation recovery from consistent decryption chains.

axioms (2)

domain assumption The diffusion equation takes the standard plaintext-non-delayed form with ciphertext feedback but no plaintext delay.
Invoked when defining PNDCC and when constructing the example and the multi-stage model.
ad hoc to paper The chaining rules derived from the attacker's perspective allow reconstruction of all permutations when a consistent decryption chain exists.
This rule is summarized in the paper and is load-bearing for the chain attack generalization.

pith-pipeline@v0.9.0 · 5855 in / 1581 out tokens · 44081 ms · 2026-05-18T17:03:14.576761+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

the diffusion equation is given by C(k) = mod(P(k)−C(k−1)−K(k),256)

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

36 extracted references · 36 canonical work pages

[1]

A VPMIR: Adaptive verifiable privacy-preserving medical image retrieval,

D. Li, Q. L ¨u, X. Liao, T. Xiang, J. Wu, and J. Le, “A VPMIR: Adaptive verifiable privacy-preserving medical image retrieval,”IEEE Trans. Dependable Secure Comput., vol. 21, no. 5, pp. 4637–4651, Sept.–Oct. 2024, doi: 10.1109/TDSC.2024.3355223

work page doi:10.1109/tdsc.2024.3355223 2024
[2]

Applying chaos theory for runtime hardware Trojan monitoring and detection,

H. Zhao, L. Kwiat, K. A. Kwiat, C. A. Kamhoua, and L. Njilla, “Applying chaos theory for runtime hardware Trojan monitoring and detection,”IEEE Trans. Dependable Secure Comput., vol. 17, no. 4, pp. 716–729, July–Aug. 2020, doi: 10.1109/TDSC.2018.2864733

work page doi:10.1109/tdsc.2018.2864733 2020
[3]

Secure biometric-based authentication scheme using Chebyshev chaotic map for multi-server environment,

S. Chatterjee, S. Roy, A. K. Das, S. Chattopadhyay, N. Kumar, and A. V . Vasilakos, “Secure biometric-based authentication scheme using Chebyshev chaotic map for multi-server environment,”IEEE Trans. Dependable Secure Comput., vol. 15, no. 5, pp. 824–839, Sept.–Oct. 2018, doi: 10.1109/TDSC.2016.2616876

work page doi:10.1109/tdsc.2016.2616876 2018
[4]

Practical and provably secure three-factor authentication protocol based on extended chaotic- maps for mobile lightweight devices,

S. Qiu, D. Wang, G. Xu, and S. Kumari, “Practical and provably secure three-factor authentication protocol based on extended chaotic- maps for mobile lightweight devices,”IEEE Trans. Dependable Se- cure Comput., vol. 19, no. 2, pp. 1338–1351, Mar.–Apr. 2022, doi: 10.1109/TDSC.2020.3022797

work page doi:10.1109/tdsc.2020.3022797 2022
[5]

Security of streaming media communications with logistic map and self-adaptive detection-based steganography,

J. Peng, Y . Jiang, S. Tang, and F. Meziane, “Security of streaming media communications with logistic map and self-adaptive detection-based steganography,”IEEE Trans. Dependable Secure Comput., vol. 18, no. 4, pp. 1962–1973, July–Aug. 2021, doi: 10.1109/TDSC.2019.2946138

work page doi:10.1109/tdsc.2019.2946138 1962
[6]

Chebyshev polynomial based emer- gency conditions with authentication scheme for 5G-assisted vehicular fog computing,

M. A. Al-Shareeda, T. Gaber, M. A. Alqarni, M. H. Alkinani, A. A. Almazroey, and A. A. Almazroi, “Chebyshev polynomial based emer- gency conditions with authentication scheme for 5G-assisted vehicular fog computing,”IEEE Trans. Dependable Secure Comput., early access, doi: 10.1109/TDSC.2025.3553868

work page doi:10.1109/tdsc.2025.3553868 2025
[7]

Anonymous lightweight chaotic map-based authenticated key agreement proto- col for industrial Internet of Things,

J. Srinivas, A. K. Das, M. Wazid, and N. Kumar, “Anonymous lightweight chaotic map-based authenticated key agreement proto- col for industrial Internet of Things,”IEEE Trans. Dependable Se- cure Comput., vol. 17, no. 6, pp. 1133–1146, Nov.–Dec. 2020, doi: 10.1109/TDSC.2018.2857811

work page doi:10.1109/tdsc.2018.2857811 2020
[8]

Breaking a new image cryptosystem from three perspectives,

R. Zhou and S. Yu, “Breaking a new image cryptosystem from three perspectives,”IEEE Trans. Circuits Syst. Video Technol., early access, doi: 10.1109/TCSVT.2025.3589800

work page doi:10.1109/tcsvt.2025.3589800 2025
[9]

Differential cryptanalysis of a novel image encryption algorithm based on chaos and line map,

L. Chen, B. Ma, X. Zhao, and S. Wang, “Differential cryptanalysis of a novel image encryption algorithm based on chaos and line map,” Nonlinear Dyn., vol. 87, no. 3, pp. 1797–1807, Feb. 2017

work page 2017
[10]

Universal differential cryptanalysis for chaotic ciphers,

Q. Wang and S. Yu, “Universal differential cryptanalysis for chaotic ciphers,”Int. J. Bifurcation Chaos, vol. 25, no. 5, p. 2550142, 2025, doi: 10.1142/S0218127425501421

work page doi:10.1142/s0218127425501421 2025
[11]

Cryptanalyzing an image-scrambling encryp- tion algorithm of pixelbits,

C. Li, D. Lin, and J. L ¨u, “Cryptanalyzing an image-scrambling encryp- tion algorithm of pixelbits,”IEEE MultiMedia, vol. 24, no. 3, pp. 64–71, 2017

work page 2017
[12]

Cryptanalyzing a chaos-based image encryption algorithm using alternate structure,

L. Y . Zhang, C. Li, K.-W. Wong, S. Shu, and G. Chen, “Cryptanalyzing a chaos-based image encryption algorithm using alternate structure,”J. Syst. Softw., vol. 85, no. 9, pp. 2077–2085, 2012

work page 2077
[13]

Cryptanalysis of image ciphers with permutation-substitution network and chaos,

J. Chen, L. Chen, and Y . Zhou, “Cryptanalysis of image ciphers with permutation-substitution network and chaos,”IEEE Trans. Circuits Syst. Video Technol., vol. 31, no. 6, pp. 2494–2508, 2020

work page 2020
[14]

Universal chosen-ciphertext attack for a family of image encryption schemes,

J. Chen, L. Chen, and Y . Zhou, “Universal chosen-ciphertext attack for a family of image encryption schemes,”IEEE Trans. Multimedia, vol. 23, pp. 2372–2385, 2020

work page 2020
[15]

A symmetric image encryption scheme based on 3D chaotic cat maps,

G. Chen, Y . Mao, and C. Chui, “A symmetric image encryption scheme based on 3D chaotic cat maps,”Chaos Solitons Fractals, vol. 21, no. 3, pp. 749–761, 2004

work page 2004
[16]

A novel fast image encryption scheme based on 3D chaotic baker maps,

Y . Mao, G. Chen, and S. Lian, “A novel fast image encryption scheme based on 3D chaotic baker maps,”Int. J. Bifurcation Chaos, vol. 14, no. 10, pp. 3613–3624, 2004

work page 2004
[17]

Novel image encryption based on quantum walks,

Y . Yang, Q. Pan, S. Pan, and P. Xu, “Novel image encryption based on quantum walks,”Sci. Rep., vol. 5, art. no. 7784, 2015

work page 2015
[18]

A new secure and sensi- tive image encryption scheme based on new substitution with chaotic function,

Z. Parvin, H. Seyedarabi, and M. Shamsi, “A new secure and sensi- tive image encryption scheme based on new substitution with chaotic function,”Multimedia Tools Appl., vol. 75, no. 17, pp. 10631–10648, 2016

work page 2016
[19]

A novel color image encryption scheme using rectangular transform-enhanced chaotic tent maps,

X. Wu, B. Zhu, Y . Hu, and Y . Ran, “A novel color image encryption scheme using rectangular transform-enhanced chaotic tent maps,”IEEE Access, vol. 5, pp. 6429–6436, 2017

work page 2017
[20]

Medical image encryption using high-speed scrambling and pixel adaptive diffusion,

Z. Hua, S. Yi, and Y . Zhou, “Medical image encryption using high-speed scrambling and pixel adaptive diffusion,”Signal Process., vol. 144, pp. 134–144, 2018

work page 2018
[21]

A novel image encryption scheme based on Brownian motion and PWLCM chaotic system,

X. Wang and D. Xu, “A novel image encryption scheme based on Brownian motion and PWLCM chaotic system,”Nonlinear Dyn., vol. 75, no. 1, pp. 345–353, 2014

work page 2014
[22]

Cascade chaotic system with applications,

Y . Zhou, Z. Hua, C.-M. Pun, and C. L. P. Chen, “Cascade chaotic system with applications,”IEEE Trans. Cybern., vol. 45, no. 9, pp. 2001–2012, Sept. 2015

work page 2001
[23]

Image encryption using 2D logistic-adjusted-sine map,

Z. Hua and Y . Zhou, “Image encryption using 2D logistic-adjusted-sine map,”Inf. Sci., vol. 339, pp. 237–253, 2016

work page 2016
[24]

A new 1D chaotic system for image encryption,

Y . Zhou, L. Bao, and C. L. P. Chen, “A new 1D chaotic system for image encryption,”Signal Process., vol. 97, pp. 172–182, 2014

work page 2014
[25]

An efficient and secure medical image protection scheme based on chaotic maps,

C. Fu, W. Meng, Y . Zhan, Z. Zhu, F. C. M. Lau, C. K. Tse, and H. Ma, “An efficient and secure medical image protection scheme based on chaotic maps,”Comput. Biol. Med., vol. 43, no. 8, pp. 1000–1010, 2013

work page 2013
[26]

A novel image encryption algorithm based on genetic recombination and hyper-chaotic systems,

X. Wang and H. Zhang, “A novel image encryption algorithm based on genetic recombination and hyper-chaotic systems,”Nonlinear Dyn., vol. 83, no. 1, pp. 333–346, 2016

work page 2016
[27]

Novel image encryption scheme based on chaotic signals with finite-precision error,

S. Zhou, X. Wang, and Y . Zhang, “Novel image encryption scheme based on chaotic signals with finite-precision error,”Inf. Sci., vol. 621, pp. 782–798, Apr. 2023

work page 2023
[28]

Multi-image encryption algorithm based on novel spatiotemporal chaotic system and fractal geometry,

L. Huang and H. Gao, “Multi-image encryption algorithm based on novel spatiotemporal chaotic system and fractal geometry,”IEEE Trans. Circuits Syst. I, Reg. Papers, vol. 71, no. 8, pp. 3726–3739, Aug. 2024, doi: 10.1109/TCSI.2024.3407809

work page doi:10.1109/tcsi.2024.3407809 2024
[29]

Globally coupled private image encryption algorithm based on infinite interval spatiotemporal chaotic system,

P. Liu, X. Wang, Y . Su, H. Liu, and S. Unar, “Globally coupled private image encryption algorithm based on infinite interval spatiotemporal chaotic system,”IEEE Trans. Circuits Syst. I, Reg. Papers, vol. 70, no. 6, pp. 2511–2522, Jun. 2023, doi: 10.1109/TCSI.2023.3250713

work page doi:10.1109/tcsi.2023.3250713 2023
[30]

Spiral-transform- based fractal sorting matrix for chaotic image encryption,

Y . Xian, X. Wang, X. Wang, Q. Li, and X. Yan, “Spiral-transform- based fractal sorting matrix for chaotic image encryption,”IEEE Trans. Circuits Syst. I, Reg. Papers, vol. 69, no. 8, pp. 3320–3327, Aug. 2022, doi: 10.1109/TCSI.2022.3172116

work page doi:10.1109/tcsi.2022.3172116 2022
[31]

Image encryption based on 8D hyperchaotic system using Fibonacci Q-matrix,

G. Biban, R. Chugh, and A. Panwar, “Image encryption based on 8D hyperchaotic system using Fibonacci Q-matrix,”Chaos Solitons Fractals, vol. 170, p. 113396, 2023

work page 2023
[32]

A robust image encryption technique based on an improved fractional order chaotic map,

J. Jackson and R. Perumal, “A robust image encryption technique based on an improved fractional order chaotic map,”Nonlinear Dyn., vol. 113, pp. 7277–7296, 2025

work page 2025
[33]

Symmetric ciphers based on two-dimensional chaotic maps,

J. Fridrich, “Symmetric ciphers based on two-dimensional chaotic maps,”Int. J. Bifurcation Chaos, vol. 8, no. 6, pp. 1259–1284, 1998

work page 1998
[34]

A chaos-based image encryption algorithm using alternate structure,

Y . Zhang, Y . Wang, and X. Shen, “A chaos-based image encryption algorithm using alternate structure,”Sci. China Ser . F Inf. Sci., vol. 50, no. 3, pp. 334–341, 2007

work page 2007
[35]

Wang, ”Impulse-step-based differential attack,” Code Ocean, 2025

Q. Wang, ”Impulse-step-based differential attack,” Code Ocean, 2025. [Online]. Available: https://codeocean.com/capsule/6382298/tree

work page arXiv 2025
[36]

Wang, ”Chain Attack on diffusion-permutation-diffusion-permutation plaintext non-delayed chaotic cipher,” Code Ocean, 2025

Q. Wang, ”Chain Attack on diffusion-permutation-diffusion-permutation plaintext non-delayed chaotic cipher,” Code Ocean, 2025. [Online]. Available: https://codeocean.com/capsule/9651281/tree Qianxue Wangreceived the Ph.D. degree in Com- puter Science and Engineering, from the Depart- ment of Complex System (DISC), FEMTO-ST In- stitute, University of Franc...

work page arXiv 2025

[1] [1]

A VPMIR: Adaptive verifiable privacy-preserving medical image retrieval,

D. Li, Q. L ¨u, X. Liao, T. Xiang, J. Wu, and J. Le, “A VPMIR: Adaptive verifiable privacy-preserving medical image retrieval,”IEEE Trans. Dependable Secure Comput., vol. 21, no. 5, pp. 4637–4651, Sept.–Oct. 2024, doi: 10.1109/TDSC.2024.3355223

work page doi:10.1109/tdsc.2024.3355223 2024

[2] [2]

Applying chaos theory for runtime hardware Trojan monitoring and detection,

H. Zhao, L. Kwiat, K. A. Kwiat, C. A. Kamhoua, and L. Njilla, “Applying chaos theory for runtime hardware Trojan monitoring and detection,”IEEE Trans. Dependable Secure Comput., vol. 17, no. 4, pp. 716–729, July–Aug. 2020, doi: 10.1109/TDSC.2018.2864733

work page doi:10.1109/tdsc.2018.2864733 2020

[3] [3]

Secure biometric-based authentication scheme using Chebyshev chaotic map for multi-server environment,

S. Chatterjee, S. Roy, A. K. Das, S. Chattopadhyay, N. Kumar, and A. V . Vasilakos, “Secure biometric-based authentication scheme using Chebyshev chaotic map for multi-server environment,”IEEE Trans. Dependable Secure Comput., vol. 15, no. 5, pp. 824–839, Sept.–Oct. 2018, doi: 10.1109/TDSC.2016.2616876

work page doi:10.1109/tdsc.2016.2616876 2018

[4] [4]

Practical and provably secure three-factor authentication protocol based on extended chaotic- maps for mobile lightweight devices,

S. Qiu, D. Wang, G. Xu, and S. Kumari, “Practical and provably secure three-factor authentication protocol based on extended chaotic- maps for mobile lightweight devices,”IEEE Trans. Dependable Se- cure Comput., vol. 19, no. 2, pp. 1338–1351, Mar.–Apr. 2022, doi: 10.1109/TDSC.2020.3022797

work page doi:10.1109/tdsc.2020.3022797 2022

[5] [5]

Security of streaming media communications with logistic map and self-adaptive detection-based steganography,

J. Peng, Y . Jiang, S. Tang, and F. Meziane, “Security of streaming media communications with logistic map and self-adaptive detection-based steganography,”IEEE Trans. Dependable Secure Comput., vol. 18, no. 4, pp. 1962–1973, July–Aug. 2021, doi: 10.1109/TDSC.2019.2946138

work page doi:10.1109/tdsc.2019.2946138 1962

[6] [6]

Chebyshev polynomial based emer- gency conditions with authentication scheme for 5G-assisted vehicular fog computing,

M. A. Al-Shareeda, T. Gaber, M. A. Alqarni, M. H. Alkinani, A. A. Almazroey, and A. A. Almazroi, “Chebyshev polynomial based emer- gency conditions with authentication scheme for 5G-assisted vehicular fog computing,”IEEE Trans. Dependable Secure Comput., early access, doi: 10.1109/TDSC.2025.3553868

work page doi:10.1109/tdsc.2025.3553868 2025

[7] [7]

Anonymous lightweight chaotic map-based authenticated key agreement proto- col for industrial Internet of Things,

J. Srinivas, A. K. Das, M. Wazid, and N. Kumar, “Anonymous lightweight chaotic map-based authenticated key agreement proto- col for industrial Internet of Things,”IEEE Trans. Dependable Se- cure Comput., vol. 17, no. 6, pp. 1133–1146, Nov.–Dec. 2020, doi: 10.1109/TDSC.2018.2857811

work page doi:10.1109/tdsc.2018.2857811 2020

[8] [8]

Breaking a new image cryptosystem from three perspectives,

R. Zhou and S. Yu, “Breaking a new image cryptosystem from three perspectives,”IEEE Trans. Circuits Syst. Video Technol., early access, doi: 10.1109/TCSVT.2025.3589800

work page doi:10.1109/tcsvt.2025.3589800 2025

[9] [9]

Differential cryptanalysis of a novel image encryption algorithm based on chaos and line map,

L. Chen, B. Ma, X. Zhao, and S. Wang, “Differential cryptanalysis of a novel image encryption algorithm based on chaos and line map,” Nonlinear Dyn., vol. 87, no. 3, pp. 1797–1807, Feb. 2017

work page 2017

[10] [10]

Universal differential cryptanalysis for chaotic ciphers,

Q. Wang and S. Yu, “Universal differential cryptanalysis for chaotic ciphers,”Int. J. Bifurcation Chaos, vol. 25, no. 5, p. 2550142, 2025, doi: 10.1142/S0218127425501421

work page doi:10.1142/s0218127425501421 2025

[11] [11]

Cryptanalyzing an image-scrambling encryp- tion algorithm of pixelbits,

C. Li, D. Lin, and J. L ¨u, “Cryptanalyzing an image-scrambling encryp- tion algorithm of pixelbits,”IEEE MultiMedia, vol. 24, no. 3, pp. 64–71, 2017

work page 2017

[12] [12]

Cryptanalyzing a chaos-based image encryption algorithm using alternate structure,

L. Y . Zhang, C. Li, K.-W. Wong, S. Shu, and G. Chen, “Cryptanalyzing a chaos-based image encryption algorithm using alternate structure,”J. Syst. Softw., vol. 85, no. 9, pp. 2077–2085, 2012

work page 2077

[13] [13]

Cryptanalysis of image ciphers with permutation-substitution network and chaos,

J. Chen, L. Chen, and Y . Zhou, “Cryptanalysis of image ciphers with permutation-substitution network and chaos,”IEEE Trans. Circuits Syst. Video Technol., vol. 31, no. 6, pp. 2494–2508, 2020

work page 2020

[14] [14]

Universal chosen-ciphertext attack for a family of image encryption schemes,

J. Chen, L. Chen, and Y . Zhou, “Universal chosen-ciphertext attack for a family of image encryption schemes,”IEEE Trans. Multimedia, vol. 23, pp. 2372–2385, 2020

work page 2020

[15] [15]

A symmetric image encryption scheme based on 3D chaotic cat maps,

G. Chen, Y . Mao, and C. Chui, “A symmetric image encryption scheme based on 3D chaotic cat maps,”Chaos Solitons Fractals, vol. 21, no. 3, pp. 749–761, 2004

work page 2004

[16] [16]

A novel fast image encryption scheme based on 3D chaotic baker maps,

Y . Mao, G. Chen, and S. Lian, “A novel fast image encryption scheme based on 3D chaotic baker maps,”Int. J. Bifurcation Chaos, vol. 14, no. 10, pp. 3613–3624, 2004

work page 2004

[17] [17]

Novel image encryption based on quantum walks,

Y . Yang, Q. Pan, S. Pan, and P. Xu, “Novel image encryption based on quantum walks,”Sci. Rep., vol. 5, art. no. 7784, 2015

work page 2015

[18] [18]

A new secure and sensi- tive image encryption scheme based on new substitution with chaotic function,

Z. Parvin, H. Seyedarabi, and M. Shamsi, “A new secure and sensi- tive image encryption scheme based on new substitution with chaotic function,”Multimedia Tools Appl., vol. 75, no. 17, pp. 10631–10648, 2016

work page 2016

[19] [19]

A novel color image encryption scheme using rectangular transform-enhanced chaotic tent maps,

X. Wu, B. Zhu, Y . Hu, and Y . Ran, “A novel color image encryption scheme using rectangular transform-enhanced chaotic tent maps,”IEEE Access, vol. 5, pp. 6429–6436, 2017

work page 2017

[20] [20]

Medical image encryption using high-speed scrambling and pixel adaptive diffusion,

Z. Hua, S. Yi, and Y . Zhou, “Medical image encryption using high-speed scrambling and pixel adaptive diffusion,”Signal Process., vol. 144, pp. 134–144, 2018

work page 2018

[21] [21]

A novel image encryption scheme based on Brownian motion and PWLCM chaotic system,

X. Wang and D. Xu, “A novel image encryption scheme based on Brownian motion and PWLCM chaotic system,”Nonlinear Dyn., vol. 75, no. 1, pp. 345–353, 2014

work page 2014

[22] [22]

Cascade chaotic system with applications,

Y . Zhou, Z. Hua, C.-M. Pun, and C. L. P. Chen, “Cascade chaotic system with applications,”IEEE Trans. Cybern., vol. 45, no. 9, pp. 2001–2012, Sept. 2015

work page 2001

[23] [23]

Image encryption using 2D logistic-adjusted-sine map,

Z. Hua and Y . Zhou, “Image encryption using 2D logistic-adjusted-sine map,”Inf. Sci., vol. 339, pp. 237–253, 2016

work page 2016

[24] [24]

A new 1D chaotic system for image encryption,

Y . Zhou, L. Bao, and C. L. P. Chen, “A new 1D chaotic system for image encryption,”Signal Process., vol. 97, pp. 172–182, 2014

work page 2014

[25] [25]

An efficient and secure medical image protection scheme based on chaotic maps,

C. Fu, W. Meng, Y . Zhan, Z. Zhu, F. C. M. Lau, C. K. Tse, and H. Ma, “An efficient and secure medical image protection scheme based on chaotic maps,”Comput. Biol. Med., vol. 43, no. 8, pp. 1000–1010, 2013

work page 2013

[26] [26]

A novel image encryption algorithm based on genetic recombination and hyper-chaotic systems,

X. Wang and H. Zhang, “A novel image encryption algorithm based on genetic recombination and hyper-chaotic systems,”Nonlinear Dyn., vol. 83, no. 1, pp. 333–346, 2016

work page 2016

[27] [27]

Novel image encryption scheme based on chaotic signals with finite-precision error,

S. Zhou, X. Wang, and Y . Zhang, “Novel image encryption scheme based on chaotic signals with finite-precision error,”Inf. Sci., vol. 621, pp. 782–798, Apr. 2023

work page 2023

[28] [28]

Multi-image encryption algorithm based on novel spatiotemporal chaotic system and fractal geometry,

L. Huang and H. Gao, “Multi-image encryption algorithm based on novel spatiotemporal chaotic system and fractal geometry,”IEEE Trans. Circuits Syst. I, Reg. Papers, vol. 71, no. 8, pp. 3726–3739, Aug. 2024, doi: 10.1109/TCSI.2024.3407809

work page doi:10.1109/tcsi.2024.3407809 2024

[29] [29]

Globally coupled private image encryption algorithm based on infinite interval spatiotemporal chaotic system,

P. Liu, X. Wang, Y . Su, H. Liu, and S. Unar, “Globally coupled private image encryption algorithm based on infinite interval spatiotemporal chaotic system,”IEEE Trans. Circuits Syst. I, Reg. Papers, vol. 70, no. 6, pp. 2511–2522, Jun. 2023, doi: 10.1109/TCSI.2023.3250713

work page doi:10.1109/tcsi.2023.3250713 2023

[30] [30]

Spiral-transform- based fractal sorting matrix for chaotic image encryption,

Y . Xian, X. Wang, X. Wang, Q. Li, and X. Yan, “Spiral-transform- based fractal sorting matrix for chaotic image encryption,”IEEE Trans. Circuits Syst. I, Reg. Papers, vol. 69, no. 8, pp. 3320–3327, Aug. 2022, doi: 10.1109/TCSI.2022.3172116

work page doi:10.1109/tcsi.2022.3172116 2022

[31] [31]

Image encryption based on 8D hyperchaotic system using Fibonacci Q-matrix,

G. Biban, R. Chugh, and A. Panwar, “Image encryption based on 8D hyperchaotic system using Fibonacci Q-matrix,”Chaos Solitons Fractals, vol. 170, p. 113396, 2023

work page 2023

[32] [32]

A robust image encryption technique based on an improved fractional order chaotic map,

J. Jackson and R. Perumal, “A robust image encryption technique based on an improved fractional order chaotic map,”Nonlinear Dyn., vol. 113, pp. 7277–7296, 2025

work page 2025

[33] [33]

Symmetric ciphers based on two-dimensional chaotic maps,

J. Fridrich, “Symmetric ciphers based on two-dimensional chaotic maps,”Int. J. Bifurcation Chaos, vol. 8, no. 6, pp. 1259–1284, 1998

work page 1998

[34] [34]

A chaos-based image encryption algorithm using alternate structure,

Y . Zhang, Y . Wang, and X. Shen, “A chaos-based image encryption algorithm using alternate structure,”Sci. China Ser . F Inf. Sci., vol. 50, no. 3, pp. 334–341, 2007

work page 2007

[35] [35]

Wang, ”Impulse-step-based differential attack,” Code Ocean, 2025

Q. Wang, ”Impulse-step-based differential attack,” Code Ocean, 2025. [Online]. Available: https://codeocean.com/capsule/6382298/tree

work page arXiv 2025

[36] [36]

Wang, ”Chain Attack on diffusion-permutation-diffusion-permutation plaintext non-delayed chaotic cipher,” Code Ocean, 2025

Q. Wang, ”Chain Attack on diffusion-permutation-diffusion-permutation plaintext non-delayed chaotic cipher,” Code Ocean, 2025. [Online]. Available: https://codeocean.com/capsule/9651281/tree Qianxue Wangreceived the Ph.D. degree in Com- puter Science and Engineering, from the Depart- ment of Complex System (DISC), FEMTO-ST In- stitute, University of Franc...

work page arXiv 2025