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

A memory-based NFA regular expression match engine for signature-based intrusion detection

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 14 publications
(4 citation statements)
references
References 33 publications
0
4
0
Order By: Relevance
“…It is considered more precise and accurate than anomalybased detection and has no false positive rate. However, it has its own limitation that makes it cover limited types of attacks since the attack patterns have to be known in advance [16]. Several worms can be detected by pattern-matching algorithms such as code red attack.…”
Section: Cl-cidps Main Blocks Methodology and Workflowmentioning
confidence: 99%
“…It is considered more precise and accurate than anomalybased detection and has no false positive rate. However, it has its own limitation that makes it cover limited types of attacks since the attack patterns have to be known in advance [16]. Several worms can be detected by pattern-matching algorithms such as code red attack.…”
Section: Cl-cidps Main Blocks Methodology and Workflowmentioning
confidence: 99%
“…An extended P-AC detection method called PACX is used to detect fixed-length tokens with 4 to 15 bytes that contain a string component at the front plus a small number of wildcard bytes, nibbles and/or alternate bytes. MX-NFA [8] is a more general regex detection method, and it is used to detect more complex tokens that may contain counting block(s) and other regex features. Displacement counts between tokens will be verified by the aggregation unit (AU).…”
Section: Proposed Detection Methodsmentioning
confidence: 99%
“…In this paper, we shall present hardware architectures to detect the remaining 6.4K regex patterns in the ClamAV virus database. The techniques that we have developed for string matching [3][4] [6] [7], regex matching [5] [8], perfect hash table organization [9], and codeword assignment scheme [10] will be applied in this work. It would be highly desirable for readers to have read some of our previous publications in this topic, in particular [5].…”
Section: Introductionmentioning
confidence: 99%
“…Non-deterministic finite automaton (NFA) is used in a memory-based architecture to speed up regular expression matching. This technique also supports dynamic updates and offers constant throughput (Pao et al, 2013). The contextual information and hash functions are integrated with IDS to construct an adaptive hash-based non-critical alarm filter.…”
Section: Signature-based Idsmentioning
confidence: 99%