Abstract: Computer based method for generation of a graph representation of a rule set for searching data transiting a network using a graph-based search model. A set of rules that describe strings or patterns of data to be identified in the data set, is expressed as a graph. As blocks of the data set are obtained for processing, the state of the graph is updated based upon the value of the received data block. The transition to the next state depends upon both the current state and the received data block. As blocks of data are received and processed, the graph is traversed until one of the rules is identified.

Abstract: Computer based method for generation of a graph representation of a rule set for searching data transiting a network using a graph-based search model. A set of rules that describe strings or patterns of data to be identified in the data set, is expressed as a graph. As blocks of the data set are obtained for processing, the state of the graph is updated based upon the value of the received data block. The transition to the next state depends upon both the current state and the received data block. As blocks of data are received and processed, the graph is traversed until one of the rules is identified.

Abstract: Computer based systems and methods for searching data transiting a network using a graph-based search model. A set of rules that describe strings or patterns of data to be identified in the data set, is expressed as a graph. As blocks of the data set are obtained for processing, the state of the graph is updated based upon the value of the received data block. The transition to the next state depends upon both the current state and the received data block. As blocks of data are received and processed, the graph is traversed until one of the rules is identified.

Abstract: Computer based systems and methods for searching data transiting a network using a graph-based search model. A set of rules that describe strings or patterns of data to be identified in the data set, is expressed as a graph. As blocks of the data set are obtained for processing, the state of the graph is updated based upon the value of the received data block. The transition to the next state depends upon both the current state and the received data block. As blocks of data are received and processed, the graph is traversed until one of the rules is identified.

Abstract: A computer-based method for scanning data using string filtering includes compressing a data string using a hashing algorithm to obtain a data-string signature, and then determining that the data-string signature matches a known data-string signatures stored in a lookup table if the signature is determined to have a match in the lookup table.

Abstract: A computer-based method and system for performing header filtering of data is presented The method comprises compressing the header of a data packet to obtain a header signature and determining if the header signature matches a known header signature. If the header signature is determined to have a match, then the header signature is identified as a known header signature. A header signature may be generated using a multidimensional data compression algorithm. A compression algorithm comprises obtaining the data bits contained in each field of a typical header. Then, a header-field group that corresponds uniquely to each field is determined. Each field is replaced with the header-field group of the corresponding data bits of the field and concatenated to create a header signature.

Abstract: A system and method for receiving data packets at a computer system are presented. The method and system comprise receiving at a buffer, at least two data packets. Once received, an ending portion of the first data packet is stored in a buffer, wherein the ending portion comprises at least the last data bit in the first data packet. Next the method and system concatenates the ending portion of the first data packet with a beginning portion of the second data packet so a string search engine can determine if the concatenated data contains a known string of malicious data bits.

Abstract: A computer-based method and system for performing header filtering of data is presented The method comprises compressing the header of a data packet to obtain a header signature and determining if the header signature matches a known header signature. If the header signature is determined to have a match, then the header signature is identified as a known header signature. A header signature may be generated using a multidimensional data compression algorithm. A compression algorithm comprises obtaining the data bits contained in each field of a typical header. Then, a header-field group that corresponds uniquely to each field is determined. Each field is replaced with the header-field group of the corresponding data bits of the field and concatenated to create a header signature.

Abstract: A computer-based method for scanning data using string filtering includes compressing a data string using a hashing algorithm to obtain a data-string signature, and then determining that the data-string signature matches a known data-string signatures stored in a lookup table if the signature is determined to have a match in the lookup table.

Abstract: A system and method for receiving data packets at a computer system are presented. The method and system comprise receiving at a buffer, at least two data packets. Once received, an ending portion of the first data packet is stored in a buffer, wherein the ending portion comprises at least the last data bit in the first data packet. Next the method and system concatenates the ending portion of the first data packet with a beginning portion of the second data packet so a string search engine can determine if the concatenated data contains a known string of malicious data bits.