Abstract
Fast pattern matching algorithms mostly used by IDS, which are considered one of the important systems used to monitor and analyze host and network traffic. Their main function is to detect various types of malicious and malware files by examining incoming and outgoing data through the network. As the network speed growing, the malicious behavior and malware files are increasing; the pattern matching algorithms must be faster. In this research paper we are presenting a new method of pattern matching, which could be a platform for enhancement in the future. In this field, researchers spared no efforts to introduce fast algorithms for pattern matching. The Most popular algorithms are Boyer-Moore, Aho–Corasick, Naïve String search, Rabin Karp String Search and Knuth–Morris–Pratt. Based on studying these techniques we are developing algorithms that process the text data, using different algorithm technique and then we’ll test the performance and compare the processing time with the fastest proven pattern matching algorithms available. Document the result and draw the overall conclusion.
Highlights
The rapid growth in information technology and the hardware capabilities brings a new challenge to security
Intrusion detection system must perform to the optimal level to detect signature based malicious behavior
Pattern matching algorithms called a string searching algorithms are class of strings algorithms that processes a large number of or text to find a place of patterns
Summary
The rapid growth in information technology and the hardware capabilities brings a new challenge to security. The algorithm is meant to process text. The faster the compute system the more efficient the pattern matching needs to be. There is a collective demand to bring a faster patternmatching algorithm to keep pace with hardware rapid development, performance improvement and innovations. We are developing a new text processing technique and we’ll measure its performance. The algorithm will index the text string and create an array of similar character indexes. The arrays of the characters will be responsible to assemble the pattern need to be matched or detected. We will conduct comparison with two of the fastest patterns matching algorithms to date. If the performance is less, it might be considered as new algorithm where further research and enhancement could be done
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
