Stringology Based Cryptology

TL;DR

This paper proposes a novel approach called Stringology-Based Cryptology (SBC) that applies string processing techniques to analyze the structural properties of cryptographic outputs, offering new insights beyond traditional methods.

Contribution

It introduces the SBC framework, combining stringology algorithms with cryptographic analysis to evaluate structural properties of cryptographic sequences.

Findings

SBC reveals pattern recurrence and structural correlations in cryptographic outputs.

Pattern frequency and substring recurrence metrics provide new evaluation tools.

Experimental results show SBC offers complementary insights to traditional analysis.

Abstract

The modern cryptographic primitives are known to generate large volumes of sequential data like keystreams, ciphertext blocks, and hash outputs. Traditional cryptgraphic evaluation methods rely primarily on statistical randomness tests and algebraic cryptanalysis techniques. This paper introduces the concept of Stringology-Based Cryptology (SBC), which applies classical string processing and pattern matching techniques to analyze structural properties of cryptographic outputs. By interpreting cryptographic outputs as symbolic sequences, stringology algorithms can be used to detect pattern recurrence, substring distributions, and structural correlations. In addition, the paper demonstrate how pattern frequency analysis and substring recurrence metrics can be applied to evaluate keystream outputs generated by stream ciphers. Experimental results illustrate that SBC analysis provides complementary insights into structural characteristics of cryptographic sequences and may support future research in structural cryptanalysis and cryptographic evaluation