A fast multi-pattern matching algorithm for anti-virus scanning

Anti-virus Scanning is one of the key technologies in today's network security field. Multi-pattern matching algorithm plays an important role in the anti-virus applications. This paper analyzed some commonly used pattern matching algorithm. On the basis of AC-BNFA algorithm, this paper proposed an algorithm handling viruses with more than one signatures quickly. Experiments show that this algorithm is much faster than both exsited automaton-based algorithms and BM algorithm without consuming much memory.

[1]  Robert S. Boyer,et al.  A fast string searching algorithm , 1977, CACM.

[2]  Evangelos P. Markatos,et al.  : A DOMAIN-SPECIFIC STRING MATCHING ALGORITHM FOR INTRUSION DETECTION , 2003 .

[3]  Liu Yan-bing,et al.  Charactering memory access behavior of large scale multi-string matching algorithms , 2007 .

[4]  Xin Zhou,et al.  MRSI: A Fast Pattern Matching Algorithm for Anti-virus Applications , 2008, Seventh International Conference on Networking (icn 2008).

[5]  Nen-Fu Huang,et al.  A fast pattern-match engine for network processor-based network intrusion detection system , 2004, International Conference on Information Technology: Coding and Computing, 2004. Proceedings. ITCC 2004..

[6]  Donald E. Knuth,et al.  Fast Pattern Matching in Strings , 1977, SIAM J. Comput..

[7]  Qin Zhi-guang.  An Improved AC Algorithm for Intrusion Detection , 2010 .

[8]  Alfred V. Aho,et al.  Efficient string matching , 1975, Commun. ACM.