开发GUI应用程序:gpu加速恶意域检测

Trevor Rice, Dae Wook Kim, Mengkun Yang
{"title":"开发GUI应用程序:gpu加速恶意域检测","authors":"Trevor Rice, Dae Wook Kim, Mengkun Yang","doi":"10.1145/3564746.3587105","DOIUrl":null,"url":null,"abstract":"Our study uses the power of a graphics processing unit (GPU) to run malicious domain detection algorithms quickly and efficiently. We have developed a graphical user interface-based system that allows users to upload datasets (malicious domains) into a local database and then run tests with a list of domains to identify whether they are malicious. We have collected real malicious domain data from malicious domain websites and tested the five most widely used string-matching algorithms (Naïve, Levenshtein distance, Hamming distance, KMP and Rabin Karp), which allow users to compare the speeds of different string algorithms with varying time complexities against the number of domains both on the GPU (or the CPU) and our sample. On a CPU, this task becomes slower as our dataset grows. On a GPU, however, these algorithms can be run on any dataset size within the limit of the GPU's capacity with consistent performance.","PeriodicalId":322431,"journal":{"name":"Proceedings of the 2023 ACM Southeast Conference","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Developing a GUI Application: GPU-Accelerated Malicious Domain Detection\",\"authors\":\"Trevor Rice, Dae Wook Kim, Mengkun Yang\",\"doi\":\"10.1145/3564746.3587105\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Our study uses the power of a graphics processing unit (GPU) to run malicious domain detection algorithms quickly and efficiently. We have developed a graphical user interface-based system that allows users to upload datasets (malicious domains) into a local database and then run tests with a list of domains to identify whether they are malicious. We have collected real malicious domain data from malicious domain websites and tested the five most widely used string-matching algorithms (Naïve, Levenshtein distance, Hamming distance, KMP and Rabin Karp), which allow users to compare the speeds of different string algorithms with varying time complexities against the number of domains both on the GPU (or the CPU) and our sample. On a CPU, this task becomes slower as our dataset grows. On a GPU, however, these algorithms can be run on any dataset size within the limit of the GPU's capacity with consistent performance.\",\"PeriodicalId\":322431,\"journal\":{\"name\":\"Proceedings of the 2023 ACM Southeast Conference\",\"volume\":\"6 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-04-12\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2023 ACM Southeast Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3564746.3587105\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2023 ACM Southeast Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3564746.3587105","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

我们的研究使用图形处理单元(GPU)的功能来快速有效地运行恶意域检测算法。我们开发了一个基于图形用户界面的系统,允许用户将数据集(恶意域)上传到本地数据库,然后使用域列表运行测试,以确定它们是否恶意。我们从恶意域名网站收集了真实的恶意域名数据,并测试了五种最广泛使用的字符串匹配算法(Naïve, Levenshtein距离,Hamming距离,KMP和Rabin Karp),这允许用户比较不同时间复杂度的不同字符串算法的速度,以及GPU(或CPU)和我们的样本上的域名数量。在CPU上,随着数据集的增长,这个任务会变慢。然而,在GPU上,这些算法可以在GPU容量限制的任何数据集大小上运行,并且性能一致。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Developing a GUI Application: GPU-Accelerated Malicious Domain Detection
Our study uses the power of a graphics processing unit (GPU) to run malicious domain detection algorithms quickly and efficiently. We have developed a graphical user interface-based system that allows users to upload datasets (malicious domains) into a local database and then run tests with a list of domains to identify whether they are malicious. We have collected real malicious domain data from malicious domain websites and tested the five most widely used string-matching algorithms (Naïve, Levenshtein distance, Hamming distance, KMP and Rabin Karp), which allow users to compare the speeds of different string algorithms with varying time complexities against the number of domains both on the GPU (or the CPU) and our sample. On a CPU, this task becomes slower as our dataset grows. On a GPU, however, these algorithms can be run on any dataset size within the limit of the GPU's capacity with consistent performance.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Scan Stack: A Search-based Concurrent Stack for GPU Mobility-based Optimal Relay Node Selection for IoT-oriented SDWSN Conti Ransomware Development Evaluation News Consumption Among CS Majors: Habits, Perceptions, and Challenges Analysis of ECDSA's Computational Impact on IoT Network Performance
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1