摘要
本文在分析入侵检测系统Snort的规则匹配算法——Boyer-Moore(BM)算法的基础上,提出了一种更为优越的字符串搜索算法,该算法充分利用每一次匹配比较的信息以跳过尽可能多的字符进行下次比较。理论分析与实验表明,该算法具有更大的平均搜索步长、更少的匹配比较次数和更快的速度。
Based on the research of the Boyer-Moore algorithm, which is used for rules matching in snort, a faster string searching algorithm is put forward. This algorithm makes full use of the information of every matching comparison to skip more characters before the next comparison. The theoretic analysis and the actual experiments show that this algorithm has the performance of longer searching step, less matching comparison and faster searching speed.
出处
《中国传媒科技》
2005年第4期47-49,共3页
Media Science and Technology of China
