Extension of Aho-Corasick Algorithm to Detect Injection Attacks

Rejeb, Jalel; Srinivasan, Mahalakshmi

doi:10.1007/978-1-4020-8741-7_37

Cited by 5 publications

(2 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The technique is widely applied in pattern recognition, spelling checking, natural language processing, intrusion detection, spam prevention, search engines, virus removal, worm containment, and bioinformatics. Fast string-matching algorithms have been greatly studied by many researchers in the past three decades [1][2][3][4] . Aho and Corasick [1] proposed a multi-string matching automation but not a complete one.…”

Section: Introductionmentioning

confidence: 99%

Complete automata for fast matching of multiple skewed strings

Wang

et al. 2010

The 2nd International Conference on Information Science and Engineering

View full text Add to dashboard Cite

Multiple string matching is required to handle massive amount of data in many applications including pattern recognition, intrusion detection, and biological sequence analysis, etc. However, the matching process is often disturbed by intentional or unintentional skewing of the strings being matched. This paper presents a new automata formation to perform fast and accurate string matching under such disturbances. This automaton will significantly enhance the accuracy of the skewed string matching process. We present a new algorithm for fast skewed string matching based on the new automaton.

show abstract

Section: Introductionmentioning

confidence: 99%

Complete automata for fast matching of multiple skewed strings

Wang

et al. 2010

The 2nd International Conference on Information Science and Engineering

View full text Add to dashboard Cite

show abstract

“…The technique is widely applied in pattern recognition, spelling checking, natural language processing, intrusion detection, spam prevention, search engines, virus removal, and bioinformatics. Fast string matching algorithms have been deeply studied by many researchers in the past several decades [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15][16]. Aho and Corasick [1] proposed a multi-string matching automation but not a complete one.…”

Section: Introduction (Heading 1)mentioning

confidence: 99%

A Dedicated Computer Architecture Framework for Large Scale Multi-string-matching Complete Automaton

2012

2012 Fourth International Conference on Computational and Information Sciences

View full text Add to dashboard Cite

Multiple string matching to handle massive amount of data could be implemented via a complete automaton. But it is difficult to implement because of computational complexity and processing speed, especially in real time. A dedicated computer architecture framework, which makes it possible, is proposed in this paper. The features of this architecture are as following: tree node is expressed by two elements instead of general three elements. The core of this architecture is hierarchical memory, including register, fast memory and mass memory, rather than computational unit. The processing unit is comparator rather than calculator. Finally the effects of parameter change to the hardware complexity are discussed also. The space complexity of this architecture is O(|P|) rather than O(|P|*|N|), and the hardware complexity is O(|N|/|P|) rather than O(|N|*|P|), where |P| is the number of state and |N| is the size of state transition table.

show abstract

Giant complete automaton for uncertain multiple string matching and its high speed construction algorithm

Gao

Guo

et al. 2011

Sci. China Inf. Sci.

View full text Add to dashboard Cite

Multiple string matching is often completed under the presence of U-or V-uncertain-strings, or combinations thereof. Recognizing large numbers of strings with U-, V-, and U-V-uncertain-strings, including the interleaving of two or more uncertain strings, is important to thoroughly gathering useful information and detecting harmful information. This paper proposes a complete automaton and its high-speed construction algorithm for large-scale U-, V-, and U-V-uncertain multiple strings, including two or more uncertain strings interlaced with one another. The maximum number of parallel complete automation of the V-uncertain string is also given. This paper reveals that there are two kinds of pretermissions, i.e., similarly-connected and interlacedstring pretermissions, and that mistake may appear in the matching of the regular expressions, or states in the automaton may increase in number, if the intersection of the U-uncertain strings sets and the homologous subsequent special point in the U-uncertain strings sets are not eliminated from the whole system.

show abstract

Extension of Aho-Corasick Algorithm to Detect Injection Attacks

Cited by 5 publications

References 6 publications

Complete automata for fast matching of multiple skewed strings

Complete automata for fast matching of multiple skewed strings

A Dedicated Computer Architecture Framework for Large Scale Multi-string-matching Complete Automaton

Giant complete automaton for uncertain multiple string matching and its high speed construction algorithm

Contact Info

Product

Resources

About