1 / 10

ARCHITECTURES FOR BIT-SPLIT STRING SCANNING IN INTRUSION DETECTION

This research paper delves into the use of Aho-Corasick algorithm and bit-split techniques to enhance intrusion detection systems. It covers the theory behind bit-split idea, string matching engine, finding a match, optimal partitioning strategies, and overall performance evaluation. Published in IEEE Micro in 2006 by Lin Tan and Timothy Sherwood, with a presentation by Hsin-Mao Chen in 2009.

bobl
Download Presentation

ARCHITECTURES FOR BIT-SPLIT STRING SCANNING IN INTRUSION DETECTION

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. ARCHITECTURES FOR BIT-SPLIT STRING SCANNING IN INTRUSION DETECTION Author: Lin Tan, Timothy Sherwood Publisher: IEEE MICRO, 2006 Presenter: Hsin-Mao Chen Date:2009/11/11

  2. Outline • Introduction • Aho-Corasick • Bit-Split Idea • String Matching Engine • Finding a Match • Practical Optimal Partitioning • Performance

  3. Introduction • Aho-Corasick algorithm is an efficient algorithm for string matching. It performs well even in the worst case.

  4. Aho-Corasick String: he, hers, his, she h

  5. Bit-Split Idea 0 ABC 000 011 001 0 1 A C B AB C 0 1 A BC

  6. Bit-Split Idea

  7. String Matching Engine

  8. Finding a Match

  9. Practical Optimal Partitioning

  10. Performance

More Related