ACM Home Page
Please provide us with feedback. Feedback
Hardware implementation for network intrusion detection rules with regular expression support
Full text PdfPdf (126 KB)
Source Symposium on Applied Computing archive
Proceedings of the 2008 ACM symposium on Applied computing table of contents
Fortaleza, Ceara, Brazil
SESSION: Embedded systems: applications, solutions, and techniques table of contents
Pages 1535-1539  
Year of Publication: 2008
ISBN:978-1-59593-753-7
Authors
Chia-Tien Dan Lo  University of Texas at San Antonio, San Antonio, TX
Yi-Gang Tai  University of Texas at San Antonio, San Antonio, TX
Kleanthis Psarris  University of Texas at San Antonio, San Antonio, TX
Sponsor
SIGAPP: ACM Special Interest Group on Applied Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 13,   Downloads (12 Months): 134,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1363686.1364044
What is a DOI?

ABSTRACT

Signature-based network intrusion detection systems (NIDSs), such as Snort and Bro, rely on a rule database that describes traffic patterns for known attacks. They examine each packets flowing through a network segment and report suspicious packets to assure security. An attack signature may be represented in terms of fields in a packet such as source/destination IP addresses, source/destination ports, protocols, specific contents in payload, etc. Typically, a Perl Compatible Regular Expression (PCRE) is used to describe a specific content in the payload which may identify an attack. Our study shows that over 60% of the execution time in an NIDS is found to perform string comparisons against a signature database of over 5,950 tokens and over 1,763 PCREs. This paper proposes to extend a bit-parallel algorithm to support multi-byte processing and PCRE. This design takes a segment of bytes from the payload of a packet and detects all possible tokens including those crossing text segment boundaries. A tool is designed to generate VHDL code from a rule set automatically. Performance results are reported.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Snort intrusion detection system. http://snort.org, 2006.
2
3
4
 
5
 
6
 
7
 
8
C.-T. D. Lo. Hardware-assisted network-based intrusion detection. In Porc. of International Conference on Informatics, Cybernetics and Systems, Kaohsiung, Taiwan, December 2003.
 
9
C.-T. D. Lo, Y.-G. Tai, K. Psarris, and W.-J. Hwang. Super fast hardware string matching. In Proc. of the 2006 IEEE International Conference on Field Programmable Technology, Bangkok Thailand, December 2006.
 
10
I. McAfee. Mcafee products. http://us.mcafee.com/root/catalog.asp, 2006.
 
11
 
12
H.-C. Roan, W.-J. Hwang, and C.-T, D. Lo. Shift-or circuit for efficient network intrusion detection pattern matching. In Proc. of the 16th International Conference on Field Programmable Logic and Applications (FPL 2006), pages 785--790, Madrid, SPAIN, August 2006.
 
13
L. Schaelicke, T. Slabach, B. Moore, and C. Freeland. Characterizing the performance of network intrusion detection sensors. In Proceedings of the Sixth International Symposium on Recent Advances in Intrusion Detection (RAID 2003), Berlin - Heidelberg - New York, 2003. Springer-Verlag.
 
14
G. Singh and H. Singh. Databases, models, and algorithms for functional genomics: A bioinformatics perspective. In Molecular Biotechnology, volume 29, pages 165--184, February 2005.
 
15
I. Sourdis and D. Pnevmatikatos. Fast, large-scale string match for a 10gbps fpga-based network intrusion detection system. In Proc. of the 13th International Conference on Field Programmable Logic and Applications (FPL 03), pages 880--889, Lisbon, Portugal, September 2003.
16
 
17
S. Wu and U. Manber. A fast algorithm for multi-pattern searching. In Technical Report TR-94-17, Department of Compucter Science, University of Arizona, 1994.

Collaborative Colleagues:
Chia-Tien Dan Lo: colleagues
Yi-Gang Tai: colleagues
Kleanthis Psarris: colleagues