A Fast Determinate String Matching Algorithm for the Network Intrusion Detection Systems

A perfect hash function for processing string is constructed by applying the Chinese remainder theorem, and a fast string matching algorithm, which is suited to process the successive sequences like the network traffic data, is presented. The theoretical analysis shows that this algorithm not only obtains the determinate match results but also holds a linear time complexity in the worst case. The experiment results for matching a sequence database in the network intrusion detection systems also shows that this algorithm is efficient.