An iterative pattern mapping for parallel string matching architecture in intrusion detection systems

The exact string matching is essential in application areas such as Bioinformatics and Intrusion Detection Systems. Speeding-up the string matching algorithm will therefore result in accelerating the searching process in DNA and binary data. Previously, there are two types of fast algorithms exist, bit-parallel based algorithms and hashing algorithms. The bit-parallel based are efficient when dealing with patterns of short lengths, less than 64, but slow on long patterns. On the other hand, hashing algorithms have optimal sublinear average case on large alphabets and long patterns, but the efficiency not so good on small alphabet such as DNA and binary texts. In this paper, the authors present hybrid algorithm to overcome the shortcomings of those previous algorithms. The proposed algorithm is based on q-gram hashing with guaranteeing the maximal shift in advance. Experimental results on random and complete human genome confirm that the proposed algorithm is efficient on various pattern lengths and small alphabet.

Download Full-text

Implementing high-speed string matching hardware for network intrusion detection systems

Proceedings of the 16th international ACM/SIGDA symposium on Field programmable gate arrays - FPGA '08 ◽

10.1145/1344671.1344726 ◽

2008 ◽

Cited By ~ 3

Author(s):

Atul Mahajan ◽

Benfano Soewito ◽

Sai K. Parsi ◽

Ning Weng ◽

Haibo Wang

Keyword(s):

Intrusion Detection ◽

High Speed ◽

String Matching ◽

Intrusion Detection Systems ◽

Network Intrusion Detection ◽

Detection Systems ◽

Network Intrusion ◽

Network Intrusion Detection Systems

Download Full-text

Efficient String Matching Algorithm for Searching Large DNA and Binary Texts

International Journal on Semantic Web and Information Systems ◽

10.4018/ijswis.2017100110 ◽

2017 ◽

Vol 13 (4) ◽

pp. 198-220

Author(s):

Abdulrakeeb M. Al-Ssulami ◽

Hassan Mathkour ◽

Mohammed Amer Arafah

Keyword(s):

Intrusion Detection ◽

Hybrid Algorithm ◽

Binary Data ◽

String Matching ◽

The Other ◽

Intrusion Detection Systems ◽

Average Case ◽

Matching Algorithm ◽

Detection Systems ◽

Maximal Shift

The exact string matching is essential in application areas such as Bioinformatics and Intrusion Detection Systems. Speeding-up the string matching algorithm will therefore result in accelerating the searching process in DNA and binary data. Previously, there are two types of fast algorithms exist, bit-parallel based algorithms and hashing algorithms. The bit-parallel based are efficient when dealing with patterns of short lengths, less than 64, but slow on long patterns. On the other hand, hashing algorithms have optimal sublinear average case on large alphabets and long patterns, but the efficiency not so good on small alphabet such as DNA and binary texts. In this paper, the authors present hybrid algorithm to overcome the shortcomings of those previous algorithms. The proposed algorithm is based on q-gram hashing with guaranteeing the maximal shift in advance. Experimental results on random and complete human genome confirm that the proposed algorithm is efficient on various pattern lengths and small alphabet.

Download Full-text