Rapid string matching algorithm for intrusion detection systems

In the intrusion detection systems,matching speed of the string matching algorithm is very important.To enhance the speed and accuracy of the pattern matching,by using of protocol analysis and pattern matching,a rapid string matching algorithm is proposed,which is based on the Chinese remainder Theorem.Through a hash function,the pattern strings and text strings are converted to pairs of integers to be matched.The theorem of matching equivalence between the stringsto be matched and the integers converted from the strings is proven.The experiment results show the validity of proposed matching algorithm is dealt with the network data,and compared with the traditional single-mode-matching algorithms and multi-mode-matching algorithms,this algorithm has a certain degree of superiority.