Liu Gong-shen

New multi-pattern matching algorithm

The traditional multiple pattern matching algorithm, deterministic finite state automata, is implemented by tree structure. A new algorithm is proposed by substituting sequential binary tree for traditional tree. It is proved by experiment that the algorithm has three features: its construction process is quick, its cost of memory is small. At the same time, its searching process is as quick as the traditional algorithm. The algorithm is suitable for the application which requires preprocessing the patterns dynamically.

An Information Hiding method for Text by Substituted Conception

After analysis of various existing text-based steganography techniques, an efficient information hiding algorithm for text based on substituted conception is proposed in this paper. The algorithm achieves information hiding by replacing the substituted units in original text with similar conception. It takes advantage of a user-defined knowledge base, according to which the secret message can be encoded and then embedded into stego-text. Its proved by the experiments that the algorithm proposed in this paper performs well in two aspects, security and capacity. Last but not the least, in order to enhance the robustness of the algorithm, we also proposed an improved encoding algorithm to prevent information loss caused by attack.