Ιδρυματικό Αποθετήριο
Πολυτεχνείο Κρήτης
Πολυτεχνείο Κρήτης
EN
|
EL
| URI: | http://purl.tuc.gr/dl/dias/8865A838-B065-48D1-8CD1-6A1F4D4BFAB4 | ||
| Έτος | 2005 | ||
| Τύπος | Πλήρης Δημοσίευση σε Συνέδριο | ||
| Άδεια Χρήσης |
|
||
| Βιβλιογραφική Αναφορά | 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 https://doi.org/ 10.1109/FPL.2005.1515696 | ||
| Εμφανίζεται στις Συλλογές |
In this paper we propose the combination of hashingand use of memory to achieve low cost, exact matching ofSNORT-like intrusion signatures. The basic idea is to usehashing to generate a distinct address for each candidate pattern,which is stored in memory. Our implementation, Hash-Mem, uses simple CRC-style polynomials implemented withXOR gates, to achieve low cost hashing of the input patterns.We reduce the sparseness of the memory using an indirectionmemory that allows a compact storing of the search patternsand use a simple comparator to verify the match. Ourimplementation uses in the order of 0.15 Logic Cells persearch pattern character, and a few tens of memory blocks,fitting comfortably in small or medium FPGA devices.
Copyright © DIAS 2013
