Hashing + memory = low cost, exact pattern matching.

URI	http://purl.tuc.gr/dl/dias/8865A838-B065-48D1-8CD1-6A1F4D4BFAB4	-
Identifier	https://doi.org/ 10.1109/FPL.2005.1515696	-
Language	en	-
Extent	6 pages	en
Title	Hashing + memory = low cost, exact pattern matching.	en
Creator	Pnevmatikatos Dionysios	en
Creator	Πνευματικατος Διονυσιος	el
Creator	Giorgos Papadopoulos	en
Content Summary	In this paper we propose the combination of hashing and use of memory to achieve low cost, exact matching of SNORT-like intrusion signatures. The basic idea is to use hashing to generate a distinct address for each candidate pattern, which is stored in memory. Our implementation, Hash- Mem, uses simple CRC-style polynomials implemented with XOR gates, to achieve low cost hashing of the input patterns. We reduce the sparseness of the memory using an indirection memory that allows a compact storing of the search patterns and use a simple comparator to verify the match. Our implementation uses in the order of 0.15 Logic Cells per search pattern character, and a few tens of memory blocks, fitting comfortably in small or medium FPGA devices.	en
Type of Item	Πλήρης Δημοσίευση σε Συνέδριο	el
Type of Item	Conference Full Paper	en
License	http://creativecommons.org/licenses/by/4.0/	en
Date of Item	2015-10-19	-
Date of Publication	2005	-
Bibliographic Citation	G.Papadopoulos, D.Pnevmatikatos,"Hashing + memory = low cost, exact pattern matching," in 2005 15th Intern. Conf. on Field Program. Logic and Appl.,doi:10.1109/FPL.2005.1515696	en

Export

Metadata & Content in a METS Package:

Metadata in Format: