Detail výsledku

Deterministic Finite Automaton with Perfect Hashing for Fast Pattern Matching

KAŠTIL, J.; KOŘENEK, J. Deterministic Finite Automaton with Perfect Hashing for Fast Pattern Matching. Proceedings of Junior Scientist Conference 2008. Vienna: Technical University Wien, 2008. p. 103-104. ISBN: 978-3-200-01612-5.
Typ
článek ve sborníku konference
Jazyk
angličtina
Autoři
Kaštil Jan, Ing., Ph.D., FIT (FIT), UPSY (FIT)
Kořenek Jan, doc. Ing., Ph.D., FIT (FIT), UPSY (FIT)
Abstrakt

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.

Klíčová slova

Deterministic Finite Automata, FPGA, perfect hashing

Rok
2008
Strany
103–104
Sborník
Proceedings of Junior Scientist Conference 2008
Konference
Junior Scientist Conference 2008
ISBN
978-3-200-01612-5
Vydavatel
Technical University Wien
Místo
Vienna
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"
}
Projekty
Výzkum informačních technologií z hlediska bezpečnosti, MŠMT, Institucionální prostředky SR ČR (např. VZ, VC), MSM0021630528, zahájení: 2007-01-01, ukončení: 2013-12-31, řešení
Pracoviště
Ústav počítačových systémů (UPSY)
Nahoru