Institutional Repository [SANDBOX]
Technical University of Crete
EN  |  EL

Search

Browse

My Space

Hashing + memory = low cost, exact pattern matching.

Pnevmatikatos Dionysios, Giorgos Papadopoulos

Simple record


URIhttp://purl.tuc.gr/dl/dias/8865A838-B065-48D1-8CD1-6A1F4D4BFAB4-
Identifierhttps://doi.org/ 10.1109/FPL.2005.1515696-
Languageen-
Extent6 pagesen
TitleHashing + memory = low cost, exact pattern matching.en
CreatorPnevmatikatos Dionysiosen
CreatorΠνευματικατος Διονυσιοςel
CreatorGiorgos Papadopoulosen
Content SummaryIn 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 ItemConference Full Paperen
Licensehttp://creativecommons.org/licenses/by/4.0/en
Date of Item2015-10-19-
Date of Publication2005-
Bibliographic CitationG.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

Available Files

Services

Statistics