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

PeerJ Computer Science Pub Date : 2022-10-10 eCollection Date: 2022-01-01 DOI:10.7717/peerj-cs.1110
Ke Yuan, Daoming Yu, Jingkai Feng, Longwei Yang, Chunfu Jia, Yiwang Huang
{"title":"A block cipher algorithm identification scheme based on hybrid k-nearest neighbor and random forest algorithm.","authors":"Ke Yuan,&nbsp;Daoming Yu,&nbsp;Jingkai Feng,&nbsp;Longwei Yang,&nbsp;Chunfu Jia,&nbsp;Yiwang Huang","doi":"10.7717/peerj-cs.1110","DOIUrl":null,"url":null,"abstract":"<p><p>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.</p>","PeriodicalId":503620,"journal":{"name":"PeerJ Computer Science","volume":" ","pages":"e1110"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9575859/pdf/","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"PeerJ Computer Science","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.7717/peerj-cs.1110","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2022/1/1 0:00:00","PubModel":"eCollection","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

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.

Abstract Image

Abstract Image

Abstract Image

一种基于混合k近邻和随机森林算法的分组密码算法识别方案。
密码算法识别是指对密码系统中使用的加密算法进行分析和识别,对密码分析具有重要意义。为了提高识别工作的准确性,本文提出了一种新的基于集成学习的混合k近邻与随机森林模型(HKNNRF),并构建了分组密码算法的识别方案。在纯密文场景下,我们使用NIST随机测试方法提取密文特征,并使用所提出的方案对分组密码算法进行了二分类和五分类实验。实验表明,在密文大小等实验条件相同的情况下,与基线相比,HKNNRF模型具有更高的分类准确率。具体而言,HKNNRF的平均二分类识别准确率为69.5%,比单层支持向量机(SVM)、k近邻(KNN)和随机森林(RF)分别高出13%、12.5%和10%。五种分类识别准确率可达34%,高于相同实验条件下KNN 21%的准确率、RF 22%的准确率和SVM 23%的准确率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书