Malware detection: program run length against detection rate

  • Okane, Philip
  • Sezer, Sakir
  • McLaughlin, Kieran
  • Im, Eul Gyu
Citations

WEB OF SCIENCE

10
Citations

SCOPUS

14

초록

N-gram analysis is an approach that investigates the structure of a program using bytes, characters or text strings. This research uses dynamic analysis to investigate malware detection using a classification approach based on N-gram analysis. A key issue with dynamic analysis is the length of time a program has to be run to ensure a correct classification. The motivation for this research is to find the optimum subset of operational codes (opcodes) that make the best indicators of malware and to determine how long a program has to be monitored to ensure an accurate support vector machine (SVM) classification of benign and malicious software. The experiments within this study represent programs as opcode density histograms gained through dynamic analysis for different program run periods. A SVM is used as the program classifier to determine the ability of different program run lengths to correctly determine the presence of malicious software. The findings show that malware can be detected with different program run lengths using a small number of opcodes.

키워드

invasive softwarepattern classificationrunlength codessupport vector machinessystem monitoringprogram classifieropcode density histogramsmalicious softwarebenign softwareSVM classificationsupport vector machineprogram monitoring timeoperational codesdynamic analysisN-gram analysisdetection rateprogram run lengthmalware detectionSupport vector machines
제목
Malware detection: program run length against detection rate
저자
Okane, PhilipSezer, SakirMcLaughlin, KieranIm, Eul Gyu
DOI
10.1049/iet-sen.2013.0020
발행일
2014-02
유형
Article
저널명
IET Software
8
1
페이지
42 ~ 51