"Intrusion detection, regular expression, perfect hashing, hardware acceleration
"@en . "IEEE Computer Society" . "26230" . . "Z(MSM0021630528), Z(MSM6383917201)" . "Ko\u0159enek, Jan" . "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"@cs . . . "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" . . "2009-08-27+02:00"^^ . . . "Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing" . "RIV/00216305:26230/09:PU82695" . "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"@en . . . "3"^^ . "Leng\u00E1l, Ond\u0159ej" . . "Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing" . "325683" . "3"^^ . "6"^^ . . . . "Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing"@cs . "12th EUROMICRO Conference on Digital System Design DSD 2009" . "Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing"@cs . "978-0-7695-3782-5" . . . "Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing"@en . . . . . "Methodology for Fast Pattern Matching by Deterministic Finite Automaton with Perfect Hashing"@en . "Patras" . "Patras" . . "RIV/00216305:26230/09:PU82695!RIV10-MSM-26230___" . . "Ka\u0161til, Jan" . "[D0C72BF1D89B]" .