z-logo
open-access-imgOpen Access
Improving Speed of the Signature Scanner using BMH Algorithm
Author(s) -
Sunita Kanaujiya,
Shikha Tripathi,
Navneet Sharma
Publication year - 2010
Publication title -
international journal of computer applications
Language(s) - English
Resource type - Journals
ISSN - 0975-8887
DOI - 10.5120/1569-2096
Subject(s) - computer science , scanner , signature (topology) , algorithm , artificial intelligence , mathematics , geometry
As the importance of data in our computing systems has increased, number of viruses that may harm its integrity has also increased. It has become very important to detect them, so that we can remove them as well as disinfect the infected files. This paper presents an implementation of a fast signature scanner to detect the viruses. To reduce the scanning time, it uses Boyer-Moore-Horspool (BMH), a fast pattern-matching algorithm. It showed the best performance among commonly used pattern matching algorithms like Boyer Moore and Turbo-Boyer-Moore algorithms. General Terms Integrity checking technique, Signature scanning technique, Pattern matching problem.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom