All
All

What are you looking for?

All
Projects
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Deterministic Finite Automaton with Perfect Hashing for Fast Pattern Matching

Result description

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 AutomataFPGAperfect hashing

The result's identifiers

Alternative languages

  • Result language

    angličtina

  • Original language name

    Deterministic Finite Automaton with Perfect Hashing for Fast Pattern Matching

  • Original language description

    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.

  • Czech name

    Deterministický konečný automat s perfektním hashováním pro rychlé vyhledávání vzorů

  • Czech description

    Článek prezentuje nový způsob implementace deterministických konečných automatů vhodný pro implementaci v FPGA.

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    JC - Computer hardware and software

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    Z - Vyzkumny zamer (s odkazem do CEZ)

Others

  • Publication year

    2008

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Proceedings of Junior Scientist Conference 2008

  • ISBN

    978-3-200-01612-5

  • ISSN

  • e-ISSN

  • Number of pages

    2

  • Pages from-to

  • Publisher name

    Technical University Wien

  • Place of publication

    Vienna

  • Event location

    Vídeň

  • Event date

    Nov 16, 2008

  • Type of event by nationality

    EUR - Evropská akce

  • UT code for WoS article