An Effective Pattern Matching Algorithm for Intrusion Detection

摘要：

In this paper, 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. Experiments indicate that the space complexity is reduced by 36％ at most. Therefore, the improved algorithm can provide significant improvement in pattern matching performance when using in an IDS.

关键词： security of network intrusion detection pattern matching space complexity BMD

作者: Feng Du

作者单位: Zhijiang College, Zhejiang University of Technology Hangzhou Zhejiang, China

会议类型: 国际会议

会议名称: 2012 International Conference on Computer Science and Electronic Engineering(2012 IEEE计算机科学与电子工程国际会议 ICCSEE 2012)

会议地点: 杭州

会议语种:英文

页码: 34-38

在线出版日期: 2012-03-23（万方平台首次上网日期，不代表论文的发表时间）