Exact and like string matching algorithm for web and network security

String matching algorithms look for one, or more generally, all the occurrences of a search string in an input string. The most efficient string-matching algorithm in usual applications is the well-known Boyer-Moore (BM) algorithm. The aim of this paper is to introduce a novel fast string-matching algorithm to detect the exact and like occurrences of a given pattern within input string. It is based on computing the sum of character´s values in the search string and comparing this sum with the sum of the values of the corresponding characters in the sliding window. The sliding window includes number of characters equals that of the search string and is right shifted from the beginning and toward the end of the input string. The experimental results reveal that the novel algorithm appears more efficient than BM many times in worst case, and the longer the pattern, the bigger the performance improvement.