A Faster Pattern Matching Algorithm for Intrusion Detection
2012 ◽
Vol 532-533
◽
pp. 1414-1418
◽
Keyword(s):
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
2011 ◽
Vol 148-149
◽
pp. 1145-1148
2013 ◽
Vol 380-384
◽
pp. 1576-1579
2016 ◽
Vol 9
(9)
◽
pp. 169-180
2011 ◽
Vol 48-49
◽
pp. 203-207
◽
Keyword(s):