Analisys of the robust quick string matching for the network security
Л. О. Дворська · Problems of Informatization and Management · 2008
The problem of string matching for network security, especially the anti-algorithmic performance attack problem has been examined. Based on the most efficient string matching algorithm in usual applications, the Boyer-Moore algorithm, a novel algorithm called Robust Quick String Matching is proposed