Journal of Northeastern University ›› 2013, Vol. 34 ›› Issue (3): 339-343.DOI: -

• Information & Control • Previous Articles     Next Articles

FPGA Implementation of String Matching System in Intrusion Detection

LI Jingjiao1, CHEN Yong1, HO Cholman1,2, LU Zhenlin1   

  1. 1. School of Information Science & Engineering, Northeastern University, Shenyang 110819, China; 2. College of Computer Science, Kim IL Sung University, PyongYang 999093, DPR of Korea.
  • Received:2012-07-12 Revised:2012-07-12 Online:2013-03-15 Published:2013-01-26
  • Contact: CHEN Yong
  • About author:-
  • Supported by:
    -

Abstract: In the intrusion detection system, due to processor’s performance and serial execution, the processing speed of softwarebased string matching system is limited. ASICbased string matching system can provide high throughputs, but its pattern strings is difficult to update. In order to improve processing speed and adapt to the detection rules’ update, a string matching system based on FPGA is designed and implemented. Hash address could be quickly computed to match the data, which was parallel processed using XOR Hash algorithm. Logical rules was updated on the basis of original invasion implement, and through preprocessing, mode cluster of conflict was separately matched in order to solve the conflict. The experimental results showed that the system throughput is 129Gbps, more than 35 times of the software method. The throughput of each million frequency is 0806Gbps. When the number of processing Snort rules are increased, the system throughput is almost not affected.

Key words: string matching, FPGA(fieldprogrammable gate array), intrusion detection, XOR Hash algorithm, Hash conflict

CLC Number: