Stringology-Based Cryptanalysis for EChaCha20 Stream Cipher

• URL: http://arxiv.org/abs/2604.08862v1
• Date: Fri, 10 Apr 2026 01:49:39 GMT
• Title: Stringology-Based Cryptanalysis for EChaCha20 Stream Cipher
• Abstract summary: This paper analyzes textttECha20, a variant of ChaCha20 that features an expanded 6$times$6 state matrix and an enhanced textttQR-F.<n>We find that textttECha20 is able to maintain strong pseudorandomness at 16-bit and 32-bit levels with minor irregularities observed in the 8-bit domain.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Stringology-Based Cryptanalysis (SBC) offers a suitable and a structurally aligned approach for uncovering structural patterns in stream ciphers that traditional statistical tests may often fail to detect. Despite \texttt{EChaCha20}'s design enhancements, no systematic investigation has been performed to determine whether its expanded 6$\times$6 state matrix and modified Quarter-Round Function (\texttt{QR-F}) introduce subtle keystream patterns, rotational biases, or partial collisions that could serve as statistical distinguishers. As such, addressing this gap is critical to ensure that the cipher's modifications do not unintentionally reduce its security margin. Therefore, this paper leverages Knuth-Morris-Pratt (\texttt{KMP}) and Boyer-Moore (\texttt{BM}) algorithms to analyze \texttt{EChaCha20}, which is a variant of ChaCha20 that features an expanded 6$\times$6 state matrix and an enhanced \texttt{QR-F}. The author has developed and optimized adaptations of the \texttt{KMP} and \texttt{BM} algorithms for 32-bit word level pattern analysis and employed them to investigate $m$-bit pattern frequency distributions to assess the \texttt{EChaCha20}'s resistance of rotational-differential attacks. Our experimental results on large-scale one million keystream datasets have confirmed that \texttt{EChaCha20} is able to maintain strong pseudorandomness at 16-bit and 32-bit levels with minor irregularities observed in the 8-bit domain. In addition to these, the differential tests have indicated a rapid diffusion, exhibiting an avalanche effect after two \texttt{QR-F} rounds and no statistically significant rotational collisions were observed within the evaluated bounds, consistent with expected ARX diffusion behavior beyond 3 rounds. This work puts forward SBC as a complementary tool for ARX cipher evaluation and provide new thoughts on the security properties of \texttt{EChaCha20}.

Related papers

• LoRC: Detecting AI-Generated Images via Low-Rank Collapse in Semantic Residuals [50.157719466558696]
  We show that modern generators exhibit low-rank collapse in the semantic-residual subspace while preserving the dominant semantic direction.<n>We propose textbfLoRC, a framework that decouples semantic dominance to capture the collapsed residual geometry.<n>Our method improves accuracy by an average of 7.0% across multiple benchmarks and achieves 97.0% accuracy on 39 unseen generators.
  arXiv  Detail & Related papers  (2026-08-21T08:58:47Z)
• C$^{2}$R: Cross-sample Consistency Regularization Mitigates Feature Splitting and Absorption in Sparse Autoencoders [56.67585330425431]
  Sparse Autoencoders (SAEs) are widely used to interpret large language models by decomposing activations into sparse, human-understandable features.<n>These issues stem from inconsistent latent assignment across samples.<n>We introduce C$2$R, which penalizes the co-activation of directionally similar latents.
  arXiv  Detail & Related papers  (2026-06-29T17:45:31Z)
• Evaluation of Variational Quantum Classifiers (VQC) for Cyberattack Detection in the NISQ Era [0.0]
  Variational Quantums (VQC) can detect network anomalies in the era of Noisy Intermediate-Scale Quantum (NISQ) systems.<n>Model was trained on a class-balanced set spanning the 22 raw NSL-KDD attack categories and evaluated as a probe of representational capacity.<n>We interpret this behavior as consistent with the loss of linear separability induced by excessive compression.
  arXiv  Detail & Related papers  (2026-06-19T20:00:48Z)
• Many Circuits, One Mechanism: Input Variation and Evaluation Granularity in Circuit Discovery [49.50794188352666]
  We show that structural differences between circuits are not sufficient evidence for distinct mechanisms.<n>Standard evaluation practice obscures this pattern, while edge-level evaluation reveals the many-to-one mapping from structure to function.
  arXiv  Detail & Related papers  (2026-06-04T15:10:14Z)
• UnGAP: Uncertainty-Guided Affine Prompting for Real-Time Crack Segmentation [16.902729686979303]
  Uncertainty-Prompted Feature Modulator (UPFM) treats aleatoric uncertainty as an active visual prompt rather than a mere output.<n>UnGAP balances superior segmentation accuracy with real-time inference speed.
  arXiv  Detail & Related papers  (2026-05-04T09:18:57Z)
• The Illusion of Equivalence: Systematic FP16 Divergence in KV-Cached Autoregressive Inference [2.954681536906518]
  KV caching is a ubiquitous optimization in autoregressive transformer inference.<n>We show that FP16 KV cache inference is fundamentally non-equivalent to recomputation.
  arXiv  Detail & Related papers  (2026-04-16T15:59:40Z)
• Neural Stringology Based Cryptanalysis of EChaCha20 [0.0]
  A Neural Stringology Cryptanalysis (NSC) framework combines classical string pattern analysis with machine learning techniques to investigate potential structural anomalies in stream cipher keystreams is introduced.<n>The proposed NSC framework can identify distinguishable structural characteristics in the keystream data under controlled conditions.
  arXiv  Detail & Related papers  (2026-04-14T20:33:42Z)
• ExpanderGraph-128: A Novel Graph-Theoretic Block Cipher with Formal Security Analysis and Hardware Implementation [0.0]
  We present bfExpanderGraph-128 (EGC128), a 128-bit block cipher constructed as a 20-round balanced Feistel network.<n>Security analysis combines MILP-based differential bounds, proven optimal through 10 rounds via SCIP, establishing 147.3-bit differential security and conservatively extrapolating to 413 bits for the full cipher.<n> FPGA synthesis on Xilinx Artix-7 achieves 261Mbps at 100MHz using only 380 LUTs, while ARM Cortex-M4F software requires 25.8KB Flash and 1.66ms per encryption.
  arXiv  Detail & Related papers  (2026-03-13T04:15:20Z)
• Fundamental Limits of Community Detection in Contextual Multi-Layer Stochastic Block Models [4.312207944236305]
  We consider the problem of community detection from the joint observation of a high-dimensional covariate matrix and $L$ sparse networks.<n>In the sparse regime where the networks have constant average degree and the number of features $p$ grows proportionally with $n$, we derive a sharp threshold under which detecting and estimating the subject labels is possible.<n>Our results show that there is no statistical-computational gap in this setting.
  arXiv  Detail & Related papers  (2026-02-09T00:27:54Z)
• CORE: Context-Robust Remasking for Diffusion Language Models [51.59514489363897]
  We propose Context-Robust Remasking (CORE), a training-free framework for inference-time revision.<n>Rather than trusting static token probabilities, CORE identifies context-brittle tokens by probing their sensitivity to targeted masked-context perturbations.<n>On LLaDA-8B-Base, CORE delivers consistent improvements across reasoning and code benchmarks, outperforming compute-matched baselines and improving MBPP by up to 9.2 percentage points.
  arXiv  Detail & Related papers  (2026-02-04T00:12:30Z)
• Plaintext Structure Vulnerability: Robust Cipher Identification via a Distributional Randomness Fingerprint Feature Extractor [23.713094083283334]
  We present a method that does not learn end-to-end from ciphertext bytes.<n>Specifically, this method is based on a set of statistical tests to compute the randomness feature of the ciphertext.<n>The experimental results demonstrate that our method achieves high discriminative performance.
  arXiv  Detail & Related papers  (2025-11-11T14:29:42Z)
• Enhancing Deep Learning-Based Rotational-XOR Attacks on Lightweight Block Ciphers Simon32/64 and Simeck32/64 [9.595193236716314]
  Gohr pioneered neural cryptanalysis by introducing differential-based neural distinguishers to attack Speck32/64.<n>This paper focuses on optimizing distinguishers and presenting key-recovery attacks for the lightweight block ciphers Simon32/64 and Simeck32/64.
  arXiv  Detail & Related papers  (2025-11-09T11:35:11Z)
• Blockwise SFT for Diffusion Language Models: Reconciling Bidirectional Attention and Autoregressive Decoding [60.06816407728172]
  Discrete diffusion language models have shown strong potential for text generation.<n>Standard supervised fine-tuning misaligns with semi-autoregressive inference.<n>We propose Blockwise SFT, which partitions responses into fixed-size blocks.
  arXiv  Detail & Related papers  (2025-08-27T02:49:33Z)
• Your Absorbing Discrete Diffusion Secretly Models the Bayesian Posterior [0.0]
  We prove that the expected denoiser output under the forward corruption distribution recovers the true posterior.<n>We introduce an inference-time ensemble that runs K independent denoising passes and aggregates both posterior means and variances.
  arXiv  Detail & Related papers  (2025-07-10T09:42:47Z)
• Theoretical Insights in Model Inversion Robustness and Conditional Entropy Maximization for Collaborative Inference Systems [89.35169042718739]
  collaborative inference enables end users to leverage powerful deep learning models without exposure of sensitive raw data to cloud servers.<n>Recent studies have revealed that these intermediate features may not sufficiently preserve privacy, as information can be leaked and raw data can be reconstructed via model inversion attacks (MIAs)<n>This work first theoretically proves that the conditional entropy of inputs given intermediate features provides a guaranteed lower bound on the reconstruction mean square error (MSE) under any MIA.<n>Then, we derive a differentiable and solvable measure for bounding this conditional entropy based on the Gaussian mixture estimation and propose a conditional entropy algorithm to enhance the inversion robustness
  arXiv  Detail & Related papers  (2025-03-01T07:15:21Z)
• Rectified Diffusion Guidance for Conditional Generation [94.83538269086613]
  We revisit the theory behind CFG and rigorously confirm that the improper combination coefficients (textiti.e.) brings about expectation shift the generative distribution.<n>We show that our approach enjoys a textbftextitform solution given the strength.<n> Empirical evidence on real-world data demonstrate the compatibility of our design with existing state-of-the-art diffusion models.
  arXiv  Detail & Related papers  (2024-10-24T13:41:32Z)
• Adaptive Shrink-Mask for Text Detection [91.34459257409104]
  Existing real-time text detectors reconstruct text contours by shrink-masks directly. The dependence on predicted shrink-masks leads to unstable detection results. Super-pixel Window (SPW) is designed to supervise the network.
  arXiv  Detail & Related papers  (2021-11-18T07:38:57Z)
• CC-Cert: A Probabilistic Approach to Certify General Robustness of Neural Networks [58.29502185344086]
  In safety-critical machine learning applications, it is crucial to defend models against adversarial attacks. It is important to provide provable guarantees for deep learning models against semantically meaningful input transformations. We propose a new universal probabilistic certification approach based on Chernoff-Cramer bounds.
  arXiv  Detail & Related papers  (2021-09-22T12:46:04Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.