Structural Analysis of Cryptographic Sequences using Stringology-Based Fingerprinting

• URL: http://arxiv.org/abs/2605.19123v1
• Date: Mon, 18 May 2026 21:19:08 GMT
• Title: Structural Analysis of Cryptographic Sequences using Stringology-Based Fingerprinting
• Abstract summary: We introduce a stringology-based fingerprinting, (SBF) framework for the structural analysis of cryptographic sequences.<n>The proposed SBF framework interprets cryptographic outputs as symbolic strings and applies pattern-based feature extraction to capture structural statistics.<n>The results demonstrate that stringology-based pattern analysis can reveal measurable structural signatures across different sequence sources.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Cryptographic primitives such as stream ciphers,Pseudorandom Number Generators (PRNGs), and block cipher modes produce sequences that are designed to be statistically indistinguishable from random data. As a result, the traditional evaluation techniques therefore rely primarily on statistical randomness tests to assess the quality of generated sequences. While these tests verify global statistical properties, they do not address whether structural characteristics of sequences can reveal information about the underlying generator. In this paper, we introduce a stringology-based fingerprinting, (SBF) framework for the structural analysis of cryptographic sequences. The proposed SBF framework interprets cryptographic outputs as symbolic strings and applies pattern-based feature extraction to capture structural statistics such as substring frequency distributions, recurrence patterns, and entropy characteristics. These structural features are aggregated into fingerprint vectors that characterize sequence generators. The experimental evaluation is conducted using datasets composed of Cipher-Generated Sequences (CGS) and Uniformly Random Sequences (URS). The results demonstrate that stringology-based pattern analysis can reveal measurable structural signatures across different sequence sources. Although these signals do not imply practical cryptographic weaknesses, they provide an additional analytical perspective for evaluating the structural behavior of cryptographic generators.

Related papers

• 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)
• Software Platform for Hybrid Pseudo-Random Sequence Generation and Predictability Analysis Based on LFSR and Mersenne Twister [0.0]
  This work introduces a user-friendly software platform for generating, analyzing, and evaluating the predictability of pseudo-random bit sequences.<n>The proposed software provides a practical tool for analyzing, comparing, and benchmarking random sequence generators in modern electronic, sensing, and quantum-enabled communication systems.
  arXiv  Detail & Related papers  (2026-05-29T08:17:39Z)
• Stringology Based Cryptology [0.0]
  This paper introduces the concept of Stringology-Based Cryptology.<n>It applies classical string processing and pattern matching techniques to analyze structural properties of cryptographic outputs.
  arXiv  Detail & Related papers  (2026-04-17T19:58:56Z)
• 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)
• Using Modular Arithmetic Optimized Neural Networks To Crack Affine Cryptographic Schemes Efficiently [0.27309692684728615]
  We investigate the cryptanalysis of affine ciphers using a hybrid neural network architecture.<n>Our approach integrates a modular branch that processes raw ciphertext sequences and a statistical branch that leverages letter frequency features.
  arXiv  Detail & Related papers  (2025-07-17T04:54:10Z)
• A Watermark for Order-Agnostic Language Models [55.89285889529492]
  Pattern-mark is a pattern-based watermarking framework specifically designed for order-agnostic LMs. We develop a Markov-chain-based watermark generator that produces watermark key sequences with high-frequency key patterns. Our evaluations on order-agnostic LMs, such as ProteinMPNN and CMLM, demonstrate Pattern-mark's enhanced detection efficiency, generation quality, and robustness.
  arXiv  Detail & Related papers  (2024-10-17T17:41:28Z)
• Symmetric Encryption Scheme Based on Quasigroup Using Chained Mode of Operation [1.4249472316161877]
  We propose a novel construction for a symmetric encryption scheme, referred as SEBQ. We utilize concepts of chaining like mode of operation and present a block cipher with in-built properties.
  arXiv  Detail & Related papers  (2024-08-08T14:39:51Z)
• Mutual Exclusivity Training and Primitive Augmentation to Induce Compositionality [84.94877848357896]
  Recent datasets expose the lack of the systematic generalization ability in standard sequence-to-sequence models. We analyze this behavior of seq2seq models and identify two contributing factors: a lack of mutual exclusivity bias and the tendency to memorize whole examples. We show substantial empirical improvements using standard sequence-to-sequence models on two widely-used compositionality datasets.
  arXiv  Detail & Related papers  (2022-11-28T17:36:41Z)
• A Non-monotonic Self-terminating Language Model [62.93465126911921]
  In this paper, we focus on the problem of non-terminating sequences resulting from an incomplete decoding algorithm. We first define an incomplete probable decoding algorithm which includes greedy search, top-$k$ sampling, and nucleus sampling. We then propose a non-monotonic self-terminating language model, which relaxes the constraint of monotonically increasing termination probability.
  arXiv  Detail & Related papers  (2022-10-03T00:28:44Z)
• Equivariant Transduction through Invariant Alignment [71.45263447328374]
  We introduce a novel group-equivariant architecture that incorporates a group-in hard alignment mechanism. We find that our network's structure allows it to develop stronger equivariant properties than existing group-equivariant approaches. We additionally find that it outperforms previous group-equivariant networks empirically on the SCAN task.
  arXiv  Detail & Related papers  (2022-09-22T11:19:45Z)
• Numeric Lyndon-based feature embedding of sequencing reads for machine learning approaches [0.0]
  We propose a novel feature embedding method for Next-Generation Sequencing (NGS) data using the notion of fingerprint. We use fingerprints to represent RNA-Seq reads and to assign them to the most likely gene from which they were originated. We provide an implementation of the proposed method in the tool lyn2vec, which produces Lyndon-based feature embeddings of sequencing reads.
  arXiv  Detail & Related papers  (2022-02-28T15:33:37Z)
• NOTMAD: Estimating Bayesian Networks with Sample-Specific Structures and Parameters [70.55488722439239]
  We present NOTMAD, which learns to mix archetypal networks according to sample context. We demonstrate the utility of NOTMAD and sample-specific network inference through analysis and experiments, including patient-specific gene expression networks.
  arXiv  Detail & Related papers  (2021-11-01T17:17:34Z)
• Disentangled Sequence to Sequence Learning for Compositional Generalization [62.954842223732435]
  We propose an extension to sequence-to-sequence models which allows us to learn disentangled representations by adaptively re-encoding the source input. Experimental results on semantic parsing and machine translation empirically show that our proposal yields more disentangled representations and better generalization.
  arXiv  Detail & Related papers  (2021-10-09T22:27:19Z)

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.