A Faster Pattern Matching Algorithm for Intrusion Detection

摘要：

　　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.

关键词： security of network intrusion detection pattern matching BM-algorithm BMF

作者: Feng Du

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

会议类型: 国际会议

会议名称: 2012 2nd international Conference on Materials Science and Information Technology(2012第二届材料科学与信息技术国际会议)(MSIT2012)

会议地点: 西安

会议语种:英文

页码: 1414-1418

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