Přístupnostní navigace
E-application
Search Search Close
Publication detail
KAŠTIL, J. KOŘENEK, J.
Original Title
Deterministic Finite Automaton with Perfect Hashing for Fast Pattern Matching
Type
article in a collection out of WoS and Scopus
Language
English
Original Abstract
As todays networks grow very fast, it is necessary to protect networks by security systems such as firewalls and Intrusion Detection Systems. Pattern matching is time critical operation on multigigabit networks for current IDS. Patterns are often described by regular expressions. The paper deals with fast regular expression matching using the Deterministic Finite Automata (DFA) with perfect hash function. We introduce decomposition of the statement to the transformation of the alphabet and fast DFA. We introduced perfect hash to reduce space/speed trade off for DFA transition table.
Keywords
Deterministic Finite Automata, FPGA, perfect hashing
Authors
KAŠTIL, J.; KOŘENEK, J.
RIV year
2008
Released
18. 11. 2008
Publisher
Technical University Wien
Location
Vienna
ISBN
978-3-200-01612-5
Book
Proceedings of Junior Scientist Conference 2008
Pages from
103
Pages to
104
Pages count
2
BibTex
@inproceedings{BUT30724, author="Jan {Kaštil} and Jan {Kořenek}", title="Deterministic Finite Automaton with Perfect Hashing for Fast Pattern Matching", booktitle="Proceedings of Junior Scientist Conference 2008", year="2008", pages="103--104", publisher="Technical University Wien", address="Vienna", isbn="978-3-200-01612-5" }