4.6 Article

A block cipher algorithm identification scheme based on hybrid k-nearest neighbor and random forest algorithm

期刊

PEERJ COMPUTER SCIENCE
卷 8, 期 -, 页码 -

出版社

PEERJ INC
DOI: 10.7717/peerj-cs.1110

关键词

Cryptographic algorithm identification; Machine learning; Randomness test; Random forest algorithm; K-nearest neighbor algorithm

资金

  1. National Natural Science Foundation of China [61972073, 61972215, 62066040]
  2. Natural Science Foundation of Tianjin [20JCZDJC00640]
  3. Key Specialized Research and Development Program of Henan Province [222102210062]
  4. Basic Higher Educational Key Scientific Research Program of Henan Province [22A413004]
  5. National Innovation Training Program of University Student [202110475072]

向作者/读者索取更多资源

This article proposes a new ensemble learning-based model for analyzing and identifying encryption algorithms in cryptographic systems, achieving higher classification accuracy.
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.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据