Stringology Based Cryptology
For cryptographers and security analysts, this work offers a new perspective on evaluating cryptographic outputs, but it is an incremental contribution as it applies existing stringology methods to a new domain without demonstrating concrete improvements over existing techniques.
This paper introduces Stringology-Based Cryptology (SBC), applying classical string processing techniques to analyze structural properties of cryptographic outputs. Experimental results show that SBC provides complementary insights into structural characteristics of cryptographic sequences, potentially supporting future research in structural cryptanalysis.
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