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.

关键词： Network intrusion detection Stringmatching Pattern matching Chinese remainder theorem

作者: CHENG ZHONG GUO-LIANG CHEN

作者单位: School of Computer and Electronics and Information, Guangxi University, Nanning 530004, China Dept.of Computer Sci.and Tech., Univ.of Science and Technology of China, Hefei 230027, China

会议类型: 国际会议

会议名称: 2007 International Conference on Machine Learning and Cybernetics(IEEE第六届机器学习与控制论国际会议)

会议地点: 香港

会议语种:英文

页码: 3173-3177

在线出版日期: 2007-08-19（万方平台首次上网日期，不代表论文的发表时间）