![Ιδρυματικό Αποθετήριο [SANDBOX]](images/dias.logo.png "Ιδρυματικό Αποθετήριο [SANDBOX]"){kind=logo}
Ιδρυματικό Αποθετήριο [SANDBOX]
Πολυτεχνείο Κρήτης
Πολυτεχνείο Κρήτης
EN
|
EL
| URI | http://purl.tuc.gr/dl/dias/8865A838-B065-48D1-8CD1-6A1F4D4BFAB4 | - |
| Αναγνωριστικό | https://doi.org/ 10.1109/FPL.2005.1515696 | - |
| Γλώσσα | en | - |
| Μέγεθος | 6 pages | en |
| Τίτλος | Hashing + memory = low cost, exact pattern matching. | en |
| Δημιουργός | Pnevmatikatos Dionysios | en |
| Δημιουργός | Πνευματικατος Διονυσιος | el |
| Δημιουργός | Giorgos Papadopoulos | en |
| Περίληψη | 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 |
| Τύπος | Πλήρης Δημοσίευση σε Συνέδριο | el |
| Τύπος | Conference Full Paper | en |
| Άδεια Χρήσης | http://creativecommons.org/licenses/by/4.0/ | en |
| Ημερομηνία | 2015-10-19 | - |
| Ημερομηνία Δημοσίευσης | 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 | en |
Copyright © DIAS 2013
