CFP last date
22 April 2024
Reseach Article

Article:Improving Speed of the Signature Scanner using BMH Algorithm

by Sunita Kanaujiya, Dr. S.P.Tripathi, N.C.Sharma
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 11 - Number 4
Year of Publication: 2010
Authors: Sunita Kanaujiya, Dr. S.P.Tripathi, N.C.Sharma
10.5120/1569-2096

Sunita Kanaujiya, Dr. S.P.Tripathi, N.C.Sharma . Article:Improving Speed of the Signature Scanner using BMH Algorithm. International Journal of Computer Applications. 11, 4 ( December 2010), 27-31. DOI=10.5120/1569-2096

@article{ 10.5120/1569-2096,
author = { Sunita Kanaujiya, Dr. S.P.Tripathi, N.C.Sharma },
title = { Article:Improving Speed of the Signature Scanner using BMH Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { December 2010 },
volume = { 11 },
number = { 4 },
month = { December },
year = { 2010 },
issn = { 0975-8887 },
pages = { 27-31 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume11/number4/1569-2096/ },
doi = { 10.5120/1569-2096 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:59:45.199908+05:30
%A Sunita Kanaujiya
%A Dr. S.P.Tripathi
%A N.C.Sharma
%T Article:Improving Speed of the Signature Scanner using BMH Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 11
%N 4
%P 27-31
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

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.

References
  1. H.M. Mahmoud, R.T. Smythe, and M. Regnier.Analysis of boyer-moore-horspool string-matching heuristic. Random Structures and Algorithms, 1997, 10(1-2):169-186.
  2. http://www.extremetech.com/article2/0,1697,1154648,00 .asp
  3. Morton Swimmer, Baudouin Le Charlier, and Abdelaziz Mounji. “Dynamic Detection and Classification of Computer Viruses Using Behavior Patterns”. Proceedings of the 1995 Virus Bulletin Conference. 1995. Page 75
  4. Pathology of computer viruses March-April 2001. http://www.leavenworth.army.mil/milrev/download/ English/MarApr01/deal.pdf.
  5. R. Nigel Horspool, Practical Fast Searching in Strings, Software Practice and Experience, 1980, 10: 501-506
  6. Robert S. Boyer and J Strother Moore, A Fast String Search Algorithm, CACM, October 1977, 20(10): 762-772.
  7. www.boll.ch/fortinet/assets/AntiVirus.pdf
  8. www.cs.wright.edu/~pmateti/Courses/499/Viruses/
  9. Yisrael Radai. “Checksumming Techniques for Anti-Viral Purposes". Proceedings of the Fifth International Computer Virus & Security Conference. 1992. Page 783.
Index Terms

Computer Science
Information Sciences

Keywords

Boyer-Moore-Horspool (BMH) Boyer-Moore algorithm