Name
Title | ||
|---|---|---|
A Fast And Scalable String Matching Algorithm Using Contents Correction Signature Hashing For Network Ids |
Abstract | ||
|---|---|---|
A contents correction signature hashing scheme for fast string matching algorithm in high performance network intrusion detection systems is proposed. The objective is to design a highly scalable pattern matching system suitable for wide spreading similar varieties of malicious behaviors in network. Simulation results show the proposed method maintains the hash table evenly compared with general hash table and shows high scalability as the increase of signatures and 130% of performance gain compared with SNORT. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1587/elex.5.949 | IEICE ELECTRONICS EXPRESS |
Keywords | Field | DocType |
signature hashing, string matching, SNORT, IDS | Hopscotch hashing,Double hashing,Computer science,Algorithm,Theoretical computer science,Electronic engineering,Rabin–Karp algorithm,Hash function,Dynamic perfect hashing,Cuckoo hashing,Hash table,Linear hashing | Journal |
Volume | Issue | ISSN |
5 | 22 | 1349-2543 |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
6 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| J. S. Wang | 1 | 0 | 0.34 |
| H. K. Kwak | 2 | 0 | 0.34 |
| Y. J. Jung | 3 | 0 | 0.68 |
| H. U. Kwon | 4 | 0 | 0.34 |
| C. G. Kim | 5 | 0 | 0.34 |
| K. S. Chung | 6 | 0 | 0.34 |