Multi-Character String Matching Algorithm Based on State Machine

Abstract

One way to enhance the string matching process is by processing multiple characters at once. This research purpose is to create a multi-pattern string matching algorithm that is able to process multiple characters at once and can be implemented by software. The proposed algorithm is based on a state machine string matching algorithm. The experiment is done using data geared for Network Intrusion Detection System which use snort rules and some network packet file captured for research purpose. The research results show that the proposed multi-character string matching algorithm is faster but consume more memory against the tested single character string matching algorithm.