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

Author

Zhong, Cheng ; Chen, Guo-Liang

Author_Institution

Guangxi Univ., Nanning

Volume

6

fYear

2007

fDate

19-22 Aug. 2007

Firstpage

3173

Lastpage

3177

Abstract

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.

Keywords

cryptography; telecommunication security; Chinese remainder theorem; fast determinate string matching algorithm; hash function; linear time complexity; network intrusion detection system; network traffic data; string processing; Computer networks; Cybernetics; Databases; Electronic mail; Equations; Intrusion detection; Machine learning; Machine learning algorithms; Pattern matching; Telecommunication traffic; Chinese remainder theorem; Network intrusion detection; Pattern matching; Stringmatching;

fLanguage

English

Publisher

ieee

Conference_Titel

Machine Learning and Cybernetics, 2007 International Conference on

Conference_Location

Hong Kong

Print_ISBN

978-1-4244-0973-0

Electronic_ISBN

978-1-4244-0973-0

Type

conf

DOI

10.1109/ICMLC.2007.4370694

Filename

4370694