Yuan Ke, Yu Daoming, Feng Jingkai, Yang Longwei, Jia Chunfu, Huang Yiwang
School of Computer and Information Engineering, Henan University, Kaifeng, Henan, China.
Henan Key Laboratory of Big Data Analysis and Processing, Henan University, Kaifeng, Henan, China.
PeerJ Comput Sci. 2022 Oct 10;8:e1110. doi: 10.7717/peerj-cs.1110. eCollection 2022.
Cryptographic algorithm identification, which refers to analyzing and identifying the encryption algorithm used in cryptographic system, is of great significance to cryptanalysis. In order to improve the accuracy of identification work, this article proposes a new ensemble learning-based model named hybrid k-nearest neighbor and random forest (HKNNRF), and constructs a block cipher algorithm identification scheme. In the ciphertext-only scenario, we use NIST randomness test methods to extract ciphertext features, and carry out binary-classification and five-classification experiments on the block cipher algorithms using proposed scheme. Experiments show that when the ciphertext size and other experimental conditions are the same, compared with the baselines, the HKNNRF model has higher classification accuracy. Specifically, the average binary-classification identification accuracy of HKNNRF is 69.5%, which is 13%, 12.5%, and 10% higher than the single-layer support vector machine (SVM), k-nearest neighbor (KNN), and random forest (RF) respectively. The five-classification identification accuracy can reach 34%, which is higher than the 21% accuracy of KNN, the 22% accuracy of RF and the 23% accuracy of SVM respectively under the same experimental conditions.
密码算法识别是指对密码系统中使用的加密算法进行分析和识别,对密码分析具有重要意义。为了提高识别工作的准确性,本文提出了一种基于集成学习的新模型——混合k近邻与随机森林(HKNNRF),并构建了一种分组密码算法识别方案。在仅知密文的场景下,我们使用美国国家标准与技术研究院(NIST)的随机性测试方法来提取密文特征,并使用所提方案对分组密码算法进行二分类和五分类实验。实验表明,在密文大小和其他实验条件相同的情况下,与基线模型相比,HKNNRF模型具有更高的分类准确率。具体而言,HKNNRF的平均二分类识别准确率为69.5%,分别比单层支持向量机(SVM)、k近邻(KNN)和随机森林(RF)高13%、12.5%和10%。五分类识别准确率可达34%,在相同实验条件下分别高于KNN的21%、RF的22%和SVM的23%。