Pattern matching vs Regular expression

Apart from that speed-wise is reg-exp matching still much faster than
simple sring matching like Bayer-moore or similar algos ??

Regular expression matching is comparable in speed to simple string
matching, and (generally) slower than Boyer-Moore *for single strings*.
Where it can gain performance is that it can efficiently match a lot of
strings in parallel. Robin Sommer & I are now working on using this to
significantly enhance Bro's signature-matching capabilities - stay tuned.


hi, dear all,

how about the multi-pattern matching algorithms?
I think the multi-pattern matching algorithms may be a well choice to solve the signatures matching problems in IDS.
use these algorithms, we can match multi-signatures in parallel.

Li hongpei

That's really nice.

I was trying to do a comparison of Bro with Snort
trying to compare the good and not so good
qualities of each..

I'll be tuned for all news :))



where I can get source code of the bro ?

Alex Levin