2013
DOI: 10.1016/j.sysarc.2013.03.013
|View full text |Cite
|
Sign up to set email alerts
|

ENREM: An efficient NFA-based regular expression matching engine on reconfigurable hardware for NIDS

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
5
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 14 publications
(5 citation statements)
references
References 14 publications
0
5
0
Order By: Relevance
“…Ideas on automated rule generation can be traced back to early 2000 (Levine et al, 2003). Many papers on automated rule generation focus on the detection of activity performed after a vulnerability has been exploited (e.g., connecting to command-and-control networks (Zand et al, 2014)), performance improvements (e.g., using field programmable gate arrays (Hieu et al, 2013)), or the creation of new rules by aggregation of existing rules (e.g., by correlating alerts from different NIDSs (Vasilomanolakis et al, 2015)). These contributions are beyond the scope of the study described in this paper as they concern-specific solutions that are not (yet) used by most practitioners.…”
Section: Previous Tests Of Rules and Rulesetsmentioning
confidence: 99%
“…Ideas on automated rule generation can be traced back to early 2000 (Levine et al, 2003). Many papers on automated rule generation focus on the detection of activity performed after a vulnerability has been exploited (e.g., connecting to command-and-control networks (Zand et al, 2014)), performance improvements (e.g., using field programmable gate arrays (Hieu et al, 2013)), or the creation of new rules by aggregation of existing rules (e.g., by correlating alerts from different NIDSs (Vasilomanolakis et al, 2015)). These contributions are beyond the scope of the study described in this paper as they concern-specific solutions that are not (yet) used by most practitioners.…”
Section: Previous Tests Of Rules and Rulesetsmentioning
confidence: 99%
“…A matching engine for nondeterministic finite automaton (NFA)‐based regular expression has been suggested by Hieu et al . [11], in which a new sharing architecture has been utilised with many other mechanisms to enhance the desired area of pattern matching circuits. Despite that this work utilises a special hardware, i.e.…”
Section: Related Workmentioning
confidence: 99%
“…Nevertheless, it only considered matching pattern separately, to solve a combination of several patterns [27,28] presented a multi-pattern signature. A more efficient way to process payload contents is using regular expression matching (REM) which usually includes DFA-based [23] and NFA-based [43]. Simultaneously, in paper [43] gave a comparison between them.…”
Section: B Payload Processing Design Of Netfpga-basedmentioning
confidence: 99%
“…A more efficient way to process payload contents is using regular expression matching (REM) which usually includes DFA-based [23] and NFA-based [43]. Simultaneously, in paper [43] gave a comparison between them. Furthermore, to prevent degrading network throughput in detecting strings in streaming data, a data structure Bloom Filter [24,25] is used in DPI.…”
Section: B Payload Processing Design Of Netfpga-basedmentioning
confidence: 99%