Algorithm of Direct Multi-string Matching to Anti-spam
Ying Sha · Jisuanji gongcheng · 2005
A direct multi-string matching algorithm is presented to anti-spam. For the content of e-mail is usually Base64 encoded, which is context sensitive, hence, a special matching algorithm is needed. This paper proposes an algorithm to direct-match without decoding. On the other hand, for the encoding results of Base64 are 32-bit streams,it utilizes 32-bit block instead of 8-bit ones to speed up. Experiment shows that the algorithm run faster than both the decode-matching method and direct-match in original contents.