Publication detail

Hardware Accelerated Pattern Matching Based on Deterministic Finite Automata with Perfect Hashing

KAŠTIL, J. KOŘENEK, J.

Original Title

Hardware Accelerated Pattern Matching Based on Deterministic Finite Automata with Perfect Hashing

Type

article in a collection out of WoS and Scopus

Language

English

Original Abstract

With the increased amount of data transferred by computer networks, the amount of the malicious traffic also increases and therefore it is necessary to protect networks by security systems such as firewalls and Intrusion Detection Systems (IDS) operating at multigigabit speeds. Pattern matching is the time critical operation of current IDS. This paper deals with the analysis of regular expressions used by modern IDS to describe malicious traffic. According to our analysis, more than 64 percent of regular expressions create Deterministic Finite Automaton (DFA) with less than 20 percent of saturation of the transition table which allows efficient implementation of pattern matching into FPGA platform. We propose architecture for fast pattern matching using perfect hashing suitable for implementation into FPGA platform. The memory requirements of presented architecture is closed to the theoretical minimum for sparse transition tables.

Keywords

Intrusion Detection, Perfect Hashing,hardware acceleration, Deterministic Finite Automata

Authors

KAŠTIL, J.; KOŘENEK, J.

RIV year

2010

Released

19. 4. 2010

Publisher

IEEE Computer Society

Location

Vienna

ISBN

978-1-4244-6610-8

Book

Proceedings of the 13th IEEE International Symposium on Design and Diagnostics of Electronic Circuits and Systems DDECS 2010

Pages from

149

Pages to

152

Pages count

4

URL

BibTex

@inproceedings{BUT35426,
  author="Jan {Kaštil} and Jan {Kořenek}",
  title="Hardware Accelerated Pattern Matching Based on Deterministic Finite Automata with Perfect Hashing",
  booktitle="Proceedings of the 13th IEEE International Symposium on Design and Diagnostics of Electronic Circuits and Systems DDECS 2010",
  year="2010",
  pages="149--152",
  publisher="IEEE Computer Society",
  address="Vienna",
  isbn="978-1-4244-6610-8",
  url="https://www.fit.vut.cz/research/publication/9200/"
}