Publication result detail

High Speed Pattern Matching Algorithm Based on Deterministic Finite Automata with Faulty Transition Table

KAŠTIL, J.; KOŘENEK, J.

Original Title

High Speed Pattern Matching Algorithm Based on Deterministic Finite Automata with Faulty Transition Table

English Title

High Speed Pattern Matching Algorithm Based on Deterministic Finite Automata with Faulty Transition Table

Type

Paper in proceedings outside WoS and Scopus

Original Abstract

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.

English abstract

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.

Keywords

Intrusion Detection, Protocol recognition, pattern matching, Perfect hashing

Key words in English

Intrusion Detection, Protocol recognition, pattern matching, Perfect hashing

Authors

KAŠTIL, J.; KOŘENEK, J.

RIV year

2011

Released

30.10.2010

Publisher

Association for Computing Machinery

Location

La Jolla

ISBN

978-1-4503-0379-8

Book

Proceedings of the 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems

Pages from

1

Pages to

2

Pages count

2

URL

https://www.fit.vut.cz/research/publication/9380/

BibTex

@inproceedings{BUT34955,
  author="Jan {Kaštil} and Jan {Kořenek}",
  title="High Speed Pattern Matching Algorithm Based on Deterministic Finite Automata with Faulty Transition Table",
  booktitle="Proceedings of the 6th ACM/IEEE Symposium on Architectures for Networking and Communications Systems",
  year="2010",
  pages="1--2",
  publisher="Association for Computing Machinery",
  address="La Jolla",
  isbn="978-1-4503-0379-8",
  url="https://www.fit.vut.cz/research/publication/9380/"
}

Documents

05623846