City University of Hong Kong
DSpace
 

CityU Institutional Repository >
4_Student Final Year Projects >
Electronic Engineering - Undergraduate Final Year Projects >

Please use this identifier to cite or link to this item: http://hdl.handle.net/2031/5947

Title: High speed string matching for virus scanning - Quick Sampling and Verification
Authors: Wang, Xiaoran (王瀟然)
Department: Department of Electronic Engineering
Issue Date: 2010
Supervisor: Supervisor: Dr. Pao, Derek C W; Assessor: Dr. Cheung, Ray C C
Subjects: Computer viruses.
Notes: Nominated as OAPS (Outstanding Academic Papers by Students) paper by Department in 2010-11.
Abstract: This report introduces the lookup table constructions for the QSV and AU modules of a string searching engine of virus detection purpose. The QSV (quick sampling and verification) method is based on quick sampling of the input data with fixed-length prefixes, and on-demand verification of variable-length suffixes. Patterns are required to possess distinct 16-byte prefix, which is ensured by the segmentation process. Some short and exceptional cases patterns are transferred to pipelined Aho-Corasick (P-AC) module.[1] The AU (aggregation unit) is responsible for concatenating partial segment matches to produce the final pattern match. Only 3 lookup table entries in QSV are occupied for a pattern with unique 16-byte prefix and the overall memory cost is 1.4Mbyte. The lookup tables for QSV are T1, T2, and T3, while the lookup tables for AU are A0 and A1. Several methods and algorithms are introduced to improve the memory efficiencies of the lookup tables by reducing the total memory cost.
Appears in Collections:Electronic Engineering - Undergraduate Final Year Projects
OAPS - Dept. of Electronic Engineering

Files in This Item:

File SizeFormat
fulltext.html131 BHTMLView/Open

Items in CityU IR are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0!
DSpace Software © 2013 CityU Library - Send feedback to Library Systems
Privacy Policy · Copyright · Disclaimer