A memory-efficient bit-split parallel string matching using pattern dividing for intrusion detection systems

Hyunjin Kim, Hong Sik Kim, Sungho Kang

Research output: Contribution to journalArticle

21 Citations (Scopus)


For the low-cost hardware-based intrusion detection systems, this paper proposes a memory-efficient parallel string matching scheme. In order to reduce the number of state transitions, the finite state machine tiles in a string matcher adopt bit-level input symbols. Long target patterns are divided into subpatterns with a fixed length; deterministic finite automata are built with the subpatterns. Using the pattern dividing, the variety of target pattern lengths can be mitigated, so that memory usage in homogeneous string matchers can be efficient. In order to identify each original long pattern being divided, a two-stage sequential matching scheme is proposed for the successive matches with subpatterns. Experimental results show that total memory requirements decrease on average by 47.8 percent and 62.8 percent for Snort and ClamAV rule sets, in comparison with several existing bit-split string matching methods.

Original languageEnglish
Article number5733341
Pages (from-to)1904-1911
Number of pages8
JournalIEEE Transactions on Parallel and Distributed Systems
Issue number11
Publication statusPublished - 2011 Aug 31


All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Hardware and Architecture
  • Computational Theory and Mathematics

Cite this