An Improved Pattern Matching Algorithm in the Intrusion Detection System

Detection System ◽

Typical Pattern ◽

Matching Algorithm ◽

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.

Single Digit Hash Boyer Moore Horspool Pattern Matching Algorithm for Intrusion Detection System

International Journal of Future Generation Communication and Networking ◽

10.14257/ijfgcn.2016.9.9.15 ◽

2016 ◽

Vol 9 (9) ◽

pp. 169-180

Author(s):

Sakshi Sharma ◽

Manish Dixit

Keyword(s):

Intrusion Detection ◽

Pattern Matching ◽

Detection System ◽

Single Digit ◽

Matching Algorithm ◽

Research of Pattern Matching Algorithm in Intrusion Detection System

International Conference on Measurement and Control Engineering 2nd (ICMCE 2011) ◽

10.1115/1.859858.paper33 ◽

2011 ◽

pp. 229-236

Keyword(s):

Intrusion Detection ◽

Pattern Matching ◽

Detection System ◽

Matching Algorithm ◽

IEEE International Conference on Performance, Computing, and Communications, 2004 ◽

A fast pattern matching algorithm for network processor-based intrusion detection system

10.1109/pccc.2004.1301087 ◽

2004 ◽

Cited By ~ 1

Author(s):

Rong-Tai Liu ◽

Nen-Fu Huang ◽

Chia-Nan Kao ◽

Chih-Hao Chen

Keyword(s):

Intrusion Detection ◽

Pattern Matching ◽

Detection System ◽

Network Processor ◽

Matching Algorithm ◽

Design of Intrusion Detection System Based on a New Pattern Matching Algorithm

2009 International Conference on Computer Engineering and Technology ◽

10.1109/iccet.2009.244 ◽

2009 ◽

Cited By ~ 3

Author(s):

Hu Zhang

Keyword(s):

Intrusion Detection ◽

Pattern Matching ◽

Detection System ◽

Matching Algorithm ◽

Efficient pattern matching algorithm for security and Binary Search Tree (BST) based memory system in Wireless Intrusion Detection System (WIDS)

Computer Communications ◽

10.1016/j.comcom.2019.11.035 ◽

2020 ◽

Vol 151 ◽

pp. 111-118 ◽

Cited By ~ 1

Author(s):

P. Suresh ◽

R. Sukumar ◽

S. Ayyasamy

Keyword(s):

Intrusion Detection ◽

Pattern Matching ◽

Detection System ◽

Search Tree ◽

Memory System ◽

Binary Search ◽

Binary Search Tree ◽

Matching Algorithm ◽

Research and optimization of pattern matching algorithm based on Intrusion Detection System

2011 International Conference on Business Management and Electronic Information ◽

10.1109/icbmei.2011.5920964 ◽

2011 ◽

Author(s):

Hai-sheng Qin ◽

Xin-hua Li ◽

Hai-lan Wei ◽

Jun-hui Li

Keyword(s):

Intrusion Detection ◽

Pattern Matching ◽

Detection System ◽

Matching Algorithm ◽

IEEE International Conference on Performance, Computing, and Communications, 2004 ◽

A fast pattern matching algorithm for network processor-based intrusion detection system

10.1109/pccc.2004.1394999 ◽

2005 ◽

Author(s):

Rong-Tai Liu ◽

Nen-Fu Huang ◽

Chia-Nan Kao ◽

Chih-Hao Chen

Keyword(s):

Intrusion Detection ◽

Pattern Matching ◽

Detection System ◽

Network Processor ◽

Matching Algorithm ◽

An Effective Pattern Matching Algorithm for Intrusion Detection

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.556-562.3010 ◽

2014 ◽

Vol 556-562 ◽

pp. 3010-3013

Author(s):

Qing Qing Zhang ◽

Qian Zhang ◽

Yue Jiang Feng

Keyword(s):

Intrusion Detection ◽

Pattern Matching ◽

Time Complexity ◽

Detection System ◽

Space Complexity ◽

Experiment Data ◽

Matching Algorithm ◽

Bm Algorithm ◽

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.