The paper shows how to convert the pattern DB into the q-gram index structure with the 'next byte range' and how to filter the data item (e.g. packet) using this structure. We indexed the patterns of the given DB as 6byte-part to raise the speed of matching and the utilization of memory. In this paper, we aimed to largely decrease the full-pattern matching system's load(the number of the input data item) and improve the performance of pattern matching by using 'SigArrg', 'next byte range' and 'Bloom Filter'. We made an algorithm so that you can apply it easily to the fields connected with pattern matching, and the experiment result shows that our proposed method speeds up pattern matching. This paper has several scalabilities.

Three-party authentication key exchange (3PAKE) is a protocol that allows two users to set up a common session key with the help of a trusted remote server, which is effective for secret communication between clients in a large-scale network environment. Since chaotic maps have superior characteristics, researchers have recently presented some of the studies that apply it to authentication key exchange and cryptography. Providing user anonymity in the authentication key exchange is one of the important security requirements to protect users' personal secrets. We analyse Lu et al.'s scheme which attempts to provide user anonymity and we prove that his scheme has errors in the key exchange phase and password change phase. We propose a round-effective three-party authentication key exchange (3PAKE) protocol that provides user anonymity and we analyse its security properties based on BAN logic and AVISPA tool.

The data used in the database has characteristics of sequence and can be used to create the index structure by using the tree structure. Currently, many cryptographic techniques are being studied in databases, but some of them have a significant impact on the performance of the system after being used in DBMS. This means that if the data is encrypted at the field level, it will not be able to maintain its characteristics of sequence, so that the indexing technique used in DBMS does not play its role and the speed of the query processing of the encrypted data will be slowed down. From this, the problem of high-speed query processing of data encrypted in the database system is seriously raised and becomes an important study. In this paper we improve the retrieval performance of the encrypted data by making the external indexing file based on B+ tree and by proceeding with the node encryption for the external indexing file. The results show that the proposed method surpasses the previous methods in terms of execution time and data retrieval capability.

In the network intrusion detection system (NIDS), there is a limitation on the speed of software-based packet classification because of the processor performance, the serial program execution and so on. It has become a great challenge to develop scalable solutions for next-generation packet classification that support higher throughput, larger rule sets and more packet header fields. For low-cost high performance embedded networking applications, the best solution could be doing packet classification by special designed hardware, which can effectively release the burden of system CPU. In order to improve the speed of packet classification, exhibit good memory performance and support quick rule update, a high-speed packet classification system based on FPGA is proposed in this paper. Taking advantage of parallel processing, pipeline and hardware circuit, the throughput has been improved greatly; defining the size of the tree nodes to be binary tree, the memory usage can be more efficient. The binary tree structure is generated through pre-processing on computer, which does not influence the searching speed of FPGA. During the packet header division, the division field is dynamic and selected according to the rules. The experimental results show that the pre-processing time for 50000 rules is shorter than 0.051s, the average speed of rule-header classification for Snort IDS is higher than 10 Gbps.

Fuzzy reasoning methods have demonstrated their ability to solve different kinds of problems in various applications domains. Currently, there is an increasing interest to augment new fuzzy reasoning principles and methods with speeding and processing capabilities. This paper points out a kind of fuzzy reasoning (CFR: Compensation Fuzzy Reasoning), and its application on DoS attack detection. Because proposed method is not based on traditional compositional operation and its operation is simple, it could be used to solve different kinds of problems. In addition, test results explained that proposed method is faster than others and it is effective on DoS attack detection. Through comparison of the existing reasoning method and application, effectiveness of proposed method is shown. This reasoning method gives us various abilities of realization in various applications domains as artificial intelligence problem and so on.

Intrusion detection for network security is an application area demanding high throughput. The pattern matching in intrusion detection requires extremely high performance to process string matching. Most of pattern matching using software has many time complexities and cannot reach the requirements of high throughput. The pattern matching using hardware considerably improves the speed of matching and has several other advantages. This paper describes a FPGA-based pattern matching architecture, using hashing method called XOR Hashing. The proposed method updates new patterns without reconfiguration and processes the collision and has high matching performance. The proposed system implements the pattern matching by using Snort rule-set, an open source Network Intrusion Detection and has simulation processing on PC. Compared with existing hardware method, the results explained that our method has relatively high performance for the pattern matching and can else process the pattern matching with high performance on low–cost FPGA device.

String matching is a key problem in many network processing applications. Current implementations of this process using software are time consuming. This paper presents a string matching system that based on FPGA. This paper uses DM9000A to receive network data and uses Snort rule and HashMem function to match pattern. With software simulation the conflict pattern of Snort rules found out and processed separately. In the system, conflict can be high-speed solved. With the PC handle string matching that more than 16 Byte, the FPGA processing speed has improved greatly .The experimental results show that the system throughput is 1.22Gbps, more than 20 times of the software method. When processing more Snort rules system throughput is not affected. Experimental results show that the system can quickly adapt to the demand for hardware reconfiguration and meet the network application requirements.

Fuzzy reasoning methods have demonstrated their ability to solve different kinds of problems in various applications domains. Currently, there is an increasing interest to augment fuzzy reasoning methods with speeding and processing capabilities. Fuzzy reasoning methods are based on four different ideas; compositional rule, it’s variants, type-distance, move method of fuzzy membership functions. Traditional methods have complex processing operation and large complexity. This paper points out a kind of move fuzzy reasoning method which is based on moving of fuzzy membership functions. Because proposed method is not based on traditional implication operation and it’s operation is simple, it could be used to solve different kinds of problems. Moreover the proposed method is compared with TS method and TD method theoretically and experimentally. Through comparison of the past reasoning method, effectiveness of proposed method is shown. This algorithm gives us the reductive property.

Fuzzy reasoning methods have demonstrated their ability to solve different kinds of problems in various applications domains. Currently, there are various fuzzy reasoning methods and applications. This paper points out a kind of new recursive reasoning method which is based on move rate of fuzzy membership functions and it's application. To reduce the time cost by fuzzy reasoning, concepts of move rate and move action are proposed. In recursive fuzzy reasoning, generally, recursion is for consequent fuzzy sets, therefore fuzzy reasoning time is long and then practically programming workings is very difficult for us. Using new method, the designed system is composed of a block of PID operation, block of characteristic sampling, block of characteristic determine, block of PID parametric setpoint, block of fading factor calculation and control object. To determine PID parameters, fuzzy rules is made and proposed recursive fuzzy reasoning is applied. Finally, past method and proposed method is compared and PID parameter auto-turning simulation experiment results is explained.