2018
DOI: 10.18576/amis/120214
|View full text |Cite
|
Sign up to set email alerts
|

Efficient String Matching FPGA for speed up Network Intrusion Detection

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 0 publications
0
3
0
Order By: Relevance
“…By contrast, software-based pattern matching is flexible and can be used for any number of times on different applications. Therefore, software-based pattern string matching algorithms are popular [32], [63]- [65].…”
Section: ) Hardware-based Pattern Matchingmentioning
confidence: 99%
“…By contrast, software-based pattern matching is flexible and can be used for any number of times on different applications. Therefore, software-based pattern string matching algorithms are popular [32], [63]- [65].…”
Section: ) Hardware-based Pattern Matchingmentioning
confidence: 99%
“…Maciel et al [32] proposed a high-performance and energy-efficient reconfigurable FPGA-based K-means/K-modes architecture for network intrusion detection. Joseph et al [33] studied the efficiency of an intrusion detection system by using an FPGA with a string-matching system design and a predecoder finite state machine for use in the high-speed network intrusion detection system. Lin et al [34] introduced the design of a Gigabit Ethernet firewall based on FPGA.…”
Section: Related Workmentioning
confidence: 99%
“…So, it is an algorithm for searching all occurrences of short strings (i.e., patterns) in longer strings of text. There are many approaches and implementations of string matching proposed, such as a practical comparative study between syntactic and semantic techniques was presented in [15], a universal string maching has been introduced in [16], and the algorithm Boyer Moyer was used for dealing with intrusion detection system [17]. Moreover, the string-matching method called Levenshtein distance was used for spelling correction system with the ability to fix real word error and non-word error ends [18].…”
Section: String Matching Using the Knuth-morris-pratt Algorithmmentioning
confidence: 99%