A rapid implementation method for overlapped subsequence detection
An implementation method and sub-sequence technology, applied in the field of information security, can solve the problems of low detection efficiency and achieve the effects of high inspection efficiency, less resource occupation, and small calculation scale
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0053] Embodiment 1. In this example, a byte sequence is input, and overlapping subsequence detection is performed.
[0054] Refer to attached Figure 1~2 , the input sequence to be checked is a byte sequence, a fast implementation method for overlapping subsequence detection, which includes the following steps:
[0055] S1: Count the frequency of the 5-digit subsequence: count the frequency of the 5-digit subsequence v of the sequence to be checked (5) [i], 0≤i≤31. Note the xth bit to the yth bit of word A as A [x..y] . The concatenation of the words A and B is A||B=2 8w A+B. Perform the following steps for j=0 to n-1:
[0056] S11: Acquire position variables: split j into word position information a and word position information b, j=8wa+b, 0≤b<8w.
[0057] S12: Obtain 5-bit value: if b+5[b:b+5] ;Otherwise get the ath word A and the a+1th word B, take x=(B||A) [b:b+5] .
[0058] S13: Update frequency: v (5) [x]=v (5) [x]+1.
[0059] S2: Calculate the frequency of...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


