Please use this identifier to cite or link to this item:
Title: NFA based regular expression matching on FPGA
Authors: Sert, Kamil
Bazlamaçcı, Cüneyt
Keywords: Network intrusion detection
Network security
Regular expression matching
String matching
Issue Date: 2021
Publisher: IEEE
Abstract: String matching is about finding all occurrences of a string within a given text. String matching algorithms have important roles in various real world areas such as web and security applications. In this work, we are interested in solving regular expression matching hence a more general form of string matching problem targeting especially the field of network intrusion detection systems (NIDS). In our work, we enhance a non-deterministic finite automata (NFA) based method on FPGA considerably. We propose to use a matching structure that processes two consecutive characters instead of one in order to yield better memory utilization and provide a novel mapping of this new architecture onto FPGA. The amount of digital circuitry needed to represent the NFA is reduced due to having less number of states and less number of LUTs in the devised 2-character regex matching process. An evaluation study is performed using the well-known Snort rule set and a sizable performance improvement is demonstrated.
Appears in Collections:Computer Engineering / Bilgisayar Mühendisliği
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection

Files in This Item:
File Description SizeFormat 
NFA_Based_Regular.pdfConference Paper1.68 MBAdobe PDFView/Open
Show full item record

CORE Recommender


checked on Feb 16, 2024

Page view(s)

checked on Feb 19, 2024


checked on Feb 19, 2024

Google ScholarTM



Items in GCRIS Repository are protected by copyright, with all rights reserved, unless otherwise indicated.