Faculty of Information Technology, BUT

Publication Details

Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing

KAŠTIL Jan, KOŘENEK Jan and LENGÁL Ondřej. Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing. In: 12th EUROMICRO Conference on Digital System Design DSD 2009. Patras: IEEE Computer Society, 2009, pp. 823-289. ISBN 978-0-7695-3782-5.
English title
Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing
Type
conference paper
Language
czech
Authors
Kaštil Jan, Ing. (DCSY FIT BUT)
Kořenek Jan, doc. Ing., Ph.D. (DCSY FIT BUT)
Lengál Ondřej, Ing. (FIT BUT)
Keywords
Intrusion detection, regular expression, perfect hashing, hardware acceleration
Abstract
As the speed of current computer networks increases,
it is necessary to protect networks by security systems
such as firewalls and Intrusion Detection Systems operating
at multigigabit speeds. Pattern matching is the time-critical
operation of current IDS on multigigabit networks. Regular
expressions are often used to describe malicious network patterns.
This paper deals with fast regular expression matching using
the Deterministic Finite Automaton (DFA) with perfect hash
function. We introduce decomposition of the problem on two
parts: transformation of the input alphabet and usage of a fast
DFA, and usage of perfect hashing to reduce space/speed tradeoff
for DFA transition table
Annotation
As the speed of current computer networks increases,
it is necessary to protect networks by security systems
such as firewalls and Intrusion Detection Systems operating
at multigigabit speeds. Pattern matching is the time-critical
operation of current IDS on multigigabit networks. Regular
expressions are often used to describe malicious network patterns.
This paper deals with fast regular expression matching using
the Deterministic Finite Automaton (DFA) with perfect hash
function. We introduce decomposition of the problem on two
parts: transformation of the input alphabet and usage of a fast
DFA, and usage of perfect hashing to reduce space/speed tradeoff
for DFA transition table
Published
2009
Pages
823-289
Proceedings
12th EUROMICRO Conference on Digital System Design DSD 2009
Conference
12th EUROMICRO Conference on Digital System Design, DSD'2009, Patras, GR
ISBN
978-0-7695-3782-5
Publisher
IEEE Computer Society
Place
Patras, GR
BibTeX
@INPROCEEDINGS{FITPUB9054,
   author = "Jan Ka\v{s}til and Jan Ko\v{r}enek and Ond\v{r}ej Leng\'{a}l",
   title = "Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing",
   pages = "823--289",
   booktitle = "12th EUROMICRO Conference on Digital System Design DSD 2009",
   year = 2009,
   location = "Patras, GR",
   publisher = "IEEE Computer Society",
   ISBN = "978-0-7695-3782-5",
   language = "czech",
   url = "https://www.fit.vut.cz/research/publication/9054"
}
Files
Back to top