| 摘要 |
Fast pattern matching is the heart of Network Intrusion Detection. A method that applies hash function to pattern matching for variable length patterns is proposed. Pattern matching always can be completed in O (log M) steps where M is the longest pattern length.
|
