Publication Details
High Speed Pattern Matching Algorithm Based on Deterministic Finite Automata with Faulty Transition Table
Intrusion Detection, Protocol recognition, pattern matching, Perfect hashing
Regular expression matching is the time-critical opera-
tion of many modern intrusion detection systems (IDS).
This paper proposes pattern matching algorithm to
match regular expression against multigigabit data
stream. As usually used regular expressions are only
subjectively tested and often generates many false po-
sitives/negatives, proposed algorithm support the pos-
sibility to reduce memory requirements by introducing
small amount of faults into the pattern matching. Al-
gorithm is based on the perfect hashing and is suitable
for hardware implementation.
Regular expression matching is the time-critical opera-
tion of many modern intrusion detection systems (IDS).
This paper proposes pattern matching algorithm to
match regular expression against multigigabit data
stream. As usually used regular expressions are only
subjectively tested and often generates many false po-
sitives/negatives, proposed algorithm support the pos-
sibility to reduce memory requirements by introducing
small amount of faults into the pattern matching. Al-
gorithm is based on the perfect hashing and is suitable
for hardware implementation.
@INPROCEEDINGS{FITPUB9380,
author = "Jan Ka\v{s}til and Jan Ko\v{r}enek",
title = "High Speed Pattern Matching Algorithm Based on Deterministic Finite Automata with Faulty Transition Table",
pages = 2,
booktitle = "Proceedings of the 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems",
year = 2010,
location = "La Jolla, US",
publisher = "Association for Computing Machinery",
ISBN = "978-1-4503-0379-8",
language = "english",
url = "https://www.fit.vut.cz/research/publication/9380"
}