Plaintext Structure Vulnerability: Robust Cipher Identification via a Distributional Randomness Fingerprint Feature Extractor
Preprint
Abstract
Modern encryption algorithms form the foundation of digital security. However, the widespread use of encryption algorithms results in significant challenges for network defenders in identifying which specific algorithms are being employed. More importantly, we find that when the plaintext distribution of test data departs from the training data, the performance of classifiers often declines significantly. This issue exposes the feature extractor's hidden dependency on plaintext features. To reduce this dependency, we adopt a method that does not learn end-to-end from ciphertext bytes. Specifically, this method is based on a set of statistical tests to compute the randomness feature of the ciphertext, and then uses the frequency distribution pattern of this feature to construct the algorithms' respective fingerprints. The experimental results demonstrate that our method achieves high discriminative performance (e.g., AUC > 0.98) in the Canterbury Corpus dataset, which contains a diverse set of data types. Furthermore, in our cross-domain evaluation, baseline models' performance degrades significantly when tested on data with a reduced proportion of structured plaintext. In sharp contrast, our method demonstrates high robustness: performance degradation is minimal when transferring between different structured domains, and even on the most challenging purely random dataset, it maintains a high level of ranking ability (AUC > 0.90).Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- FoC: Figure Out the Cryptographic Functions in Stripped Binaries with LLMsACM Transactions on Software Engineering and Methodology, 2025
- A Machine Learning-Based Framework for Assessing Cryptographic Indistinguishability of Lightweight Block Ciphers2025
- Detecting Misuse of Security APIs: A Systematic ReviewACM Computing Surveys, 2025
- Binary Cryptographic Function Identification via Similarity Analysis with Path-Insensitive EmulationProceedings of the ACM on Programming Languages, 2025
- A generic cryptographic algorithm identification scheme based on ciphertext featuresJournal of Information Security and Applications, 2025
- ERW-Radar: An Adaptive Detection System against Evasive Ransomware by Contextual Behavior Detection and Fine-grained Content Analysis2025
- A Block Cipher Algorithm Identification Scheme Based on Hybrid Random Forest and Logistic Regression ModelNeural Processing Letters, 2022
- GENDA: A Graph Embedded Network Based Detection Approach on encryption algorithm of binary programJournal of Information Security and Applications, 2022
- Cauchy Combination Test: A Powerful Test With Analytic p-Value Calculation Under Arbitrary Dependency StructuresJournal of the American Statistical Association, 2019
- HMAC-based Extract-and-Expand Key Derivation Function (HKDF)2010