Malicious code detection method based on malicious code dynamic forensic model
A malicious code detection and malicious code technology, which is applied in the field of malicious code detection based on the malicious code dynamic forensics model, can solve the problems of a wide range of malicious code, it is difficult to provide protection solutions, and malicious code detection is more difficult to achieve. The effect of dynamic detection capability, ensuring dynamic updateability, and ensuring system security
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0032] The present invention provides a malicious code detection method based on a malicious code dynamic forensics model, please refer to figure 1 , including the following specific steps:
[0033] Step 1: Obtain the code sequence flow to be detected;
[0034] Step 2: Based on the 3-Gram feature generation method and using the sliding window technology to slide on the code sequence flow to extract the dynamic behavior feature vector of each sample to be tested;
[0035] Wherein, the sample to be tested is a sequence fragment of a code sequence stream;
[0036] The dynamic behavior feature vector of each sample to be tested is expressed as:
[0037] B={gs 1 , gs 2 ,...gs i ...,gs n }
[0038] In the formula, B is the dynamic behavior feature vector of a sample to be tested, gs i represents the i-th 3-Gram fragment, gs i The value of is 0 or 1, and n is the fragment length of the sample to be tested;
[0039] 3-Gram is an algorithm based on a statistical language mode...
Embodiment 2
[0051] The present invention provides a malicious code detection method based on a malicious code dynamic forensics model, please refer to figure 1 , including the following specific steps:
[0052] Step 1: Obtain the code sequence flow to be detected;
[0053] Step 2: Based on the 3-Gram feature generation method and using the sliding window technology to slide the code sequence stream to extract the dynamic behavior feature vector of each sample to be tested;
[0054] Wherein, the sample to be tested is a sequence fragment of a code sequence stream;
[0055] The dynamic behavior feature vector of each sample to be tested is expressed as:
[0056] B={gs 1 , gs 2 ,...gs i ...,gs n }
[0057] In the formula, B is the dynamic behavior feature vector of a sample to be tested, gs i represents the i-th 3-Gram fragment, gs i The value of is 0 or 1, and n is the fragment length of the sample to be tested;
[0058] 3-Gram is an algorithm based on a statistical language model...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 
