{"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}
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.