答复: Pattern matching vs Regular expression

[LHP]

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

-----------------------------------------------------------------------------------
 Dr. Li hongpei
 
 Information Security One ( China ) Ltd.
 9 Floor, Haijian Tower, No.8 Changwa Road West,
 Haidian District, Beijing P. R. China 100089
 Tel: 8610-82643699-5268
 Fax: 8610-82644970
 mobile: 13651008229
 e-mail: lihp at cn.is-one.net
 http://www.is-one.net

-----原始邮件-----
发件人: owner-bro at lbl.gov [mailto:owner-bro at lbl.gov]代表 Vern Paxson
发送时间: 2002年5月24日 14:36
收件人: Ashley Thomas
抄送: bro at lbl.gov
主题: Re: 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.

		Vern