A Faster Pattern Matching Algorithm for Intrusion Detection

2012 ◽  
Vol 532-533 ◽  
pp. 1414-1418 ◽  
Author(s):  
Feng Du

In this paper, a Faster algorithm: BMF is proposed, which sets improvements in the time complexity of the BM algorithm. The BMF algorithm defines a new pre-calculation function to increase in the skips of pattern significantly. Experiments indicate that the time complexity is reduced by 63% at most. Therefore, the improved algorithm could provide significant improvement in pattern matching performance when using in an IDS.

2014 ◽  
Vol 556-562 ◽  
pp. 3010-3013
Author(s):  
Qing Qing Zhang ◽  
Qian Zhang ◽  
Yue Jiang Feng

This paper makes a summary of pattern matching algorithm in Intrusion Detection System: KMP algorithm, BM algorithm and BMH algorithm algorithm. The performances of various algorithms are analyzed, and then through the experiment data is verified. Last an improved algorithm based on the BM algorithm: BMD is proposed. BMD algorithm can reduce the space complexity and maintain the time complexity by reducing a pretreatment function and recording the number of times that a bad char found in the pattern.


2011 ◽  
Vol 148-149 ◽  
pp. 1145-1148
Author(s):  
Chao Yin

An improved BM-algorithm in intrusion detection system was presented which can increase displacements using the next character of the substring has been matched in the main string and pattern string. Experimental results obtained by capturing network packets with the number of matches, the number of pattern moves, the number of character comparisons as the main indicators. Experimental results show that the number of matches after and before improved is equal, and the number of pattern moves decreased by about13.3% after improved, and the number of character comparisons decreased by about 15.1% after improved. This indicates that the improved algorithm improved the efficiency of pattern matching.


2013 ◽  
Vol 380-384 ◽  
pp. 1576-1579
Author(s):  
Shi Song Xiao ◽  
Ao Lin Wang ◽  
Hui Feng

The pattern matching algorithm is the mainstream technology in the instruction detection system, and therefore as a pattern-matching methods core string matching algorithm directly affect an intrusion detection system performance and efficiency. So based on the discussions of the most fashionable pattern matching algorithms at present, an improved algorithm of AC-BM is presented. From the experiments in the Snort ,it is concluded that the improved algorithm of the performance and efficiency is higher than AC-BM algorithm.


2011 ◽  
Vol 48-49 ◽  
pp. 203-207 ◽  
Author(s):  
Ping Zhang ◽  
Jiang Hui Liu

This paper proposed a matching algorithm FBMH(Fast Boyer Moor Horspool),which made an improvement on the BMH(Boyer Moor Horspool) and BMHS(Boyer Moor Horspool Sundy) matching algorithm based on the study of several typical pattern matching algorithms used in intrusion detection. The result shows that, the FBMH algorithm has less intrusion detection matching time than BMH and BMHS algorithm. The FBMH algorithm accelerated the speed of pattern matching effectively, therefore enhanced the efficiency of the intrusion detection system.


Sign in / Sign up

Export Citation Format

Share Document