This paper introduces a new basic building block based on Non- deterministic Finite Automata (NFA) hardware implementation to support complex constraint ...

This paper introduces a new basic building block based on Non- deterministic Finite Automata (NFA) hardware implementation to support complex constraint ...

This paper introduces a new basic building block based on Non-deterministic Finite Automata (NFA) hardware implementation to support complex constraint ...

Since current Snort ruleset does not use these features, not currently supported by our engines, we have been able to implement a regular expression matching.

Miad Faezipour , Mehrdad Nourani: Regular Expression Matching for Reconfigurable Constraint Repetition Inspection. GLOBECOM 2008: 2094-2098.

This paper presents an overview of the synthesis of regular expressions with the aim of achieving high-performance engines for FPGAs. We focus on describing ...

A regular expression pattern matching approach for reconfigurable hardware that is 10–20× more efficient than previous Field Programmable Gate Array approaches.

In this paper, we focus on NFA-based approaches for RegExp matching circuits in hardware. B. Main Contribution and Paper Organization. Ever since Sidhu and ...

In this paper we describe a regular expression pattern matching approach for reconfigurable hardware. Following a Non-deterministic Finite Automata direction, ...

In this paper we present regular expression pattern matching architecture supporting constrained repetitions. The proposed architecture can implement the ...