Back to Search
Start Over
A fast and scalable string matching algorithm using contents correction signature hashing for network IDS
- Source :
- IEICE Electronics Express. 5:949-953
- Publication Year :
- 2008
- Publisher :
- Institute of Electronics, Information and Communications Engineers (IEICE), 2008.
-
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.
- Subjects :
- Theoretical computer science
Computer science
Dynamic perfect hashing
Hash function
Linear hashing
Condensed Matter Physics
Rabin–Karp algorithm
Hash table
Electronic, Optical and Magnetic Materials
Hopscotch hashing
Cuckoo hashing
Electrical and Electronic Engineering
Algorithm
Double hashing
Subjects
Details
- ISSN :
- 13492543
- Volume :
- 5
- Database :
- OpenAIRE
- Journal :
- IEICE Electronics Express
- Accession number :
- edsair.doi...........154a5ccffd936d3643d07105e78632fd