# US 2010/0115620 A1 · Structural recognition of malicious code patterns

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2010/0115620 A1
- Document ID: US20100115620A1
- Status: Published application
- Kind: A1
- Application number: 12/477,619
- Filed: 2009-06-03
- Published: 2010-05-06
- Earliest claimed: 2008-10-30
- Assignees: Secure Computing Corporation
- Inventors: Christoph Alme
- Web page: https://patentgrep.com/patent/US20100115620A1

## CPC

- H04L 63/1416: {Event detection, e.g. attack signature detection}
- G06F 16/9027: {Trees}
- G06F 21/563: {by source code analysis}
- H04L 63/145: {the attack involving the propagation of malware through the network, e.g. viruses, trojans or worms}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Various embodiments include an apparatus comprising a detection database including a tree structure of descriptor parts including one or more root nodes and one or more child nodes linked to from one or more parent descriptor parts chains, each of the root nodes representing a descriptor part, and each root node linked to at least one of the child nodes, each root node and each child node linked to any possible additional child nodes, wherein the possible additional child nodes include any possible successor child nodes and a descriptor comparator coupled to the detection database, the descriptor comparator operable to receive data including a plurality of logic entities, once or successively, and to continuously compare logic entities provided to the tree structure of descriptor parts stored in detection database, and to provide an output based on the comparison.

## Claims

### Claim 1

An apparatus comprising:
a detection database including a tree structure of descriptor parts including one or more root nodes and one or more child nodes linked to from one or more parent descriptor parts chains, each of the root nodes representing a descriptor part, and each root node linked to at least one of the child nodes, each root node and each child node linked to any possible additional child nodes, wherein the possible additional child nodes include any possible successor child nodes; and
a descriptor comparator coupled to the detection database, the descriptor comparator operable to receive data including a plurality of logic entities, once or successively, and to continuously compare logic entities provided to the tree structure of descriptor parts stored in detection database, and to provide an output based on the comparison.

### Claim 2 (depends on 1)

The apparatus of claim 1, wherein the output includes a single bit having a bit value indicative of whether or not malicious code has been detected in the received data based on whether any part of the given sequence of logic entities matches at least one of the descriptor parts chains in the tree structure.

### Claim 3 (depends on 1)

The apparatus of claim 1, wherein the output includes:
a probability value, the probability value indicative of a degree of certainty that malicious code has been detected.

### Claim 4 (depends on 1)

The apparatus of claim 1, wherein the output includes:
a malware name that can be assigned to the input file and represents the type or family of detected malicious code.

### Claim 5 (depends on 1)

The apparatus of claim 1, further including a code logic identifier coupled to the descriptor comparator, the code logic identifier operable to receive a sequence of input code, and to determine if any particular logic entities included in the input code are to be provided to the descriptor comparator as the data including the plurality of logic entities, and once or successively, to continuously emulate, extract, and normalize the plurality of logic entities and provide them to a descriptor comparator, one at a time.

### Claim 6 (depends on 5)

The apparatus of claim 5, wherein the code logic identifier is operable to determine that a particular logic entity included in the input code is to be provided to the descriptor comparator, to provide the particular logic entity to the descriptor comparator, and to provide to the descriptor comparator one or more sequential logic entities included in the input code following the particular logic entity, one at a time.

### Claim 7 (depends on 6)

The apparatus of claim 6, wherein the descriptor comparator is operable to provide feedback to the code logic identifier to indicate that the particular logic entity provided to the descriptor comparator matches at least one node of in a descriptor parts chain in the tree structure, to continue to send the sequential logic entities from the input code to the descriptor comparator.

### Claim 8 (depends on 6)

The apparatus of claim 6, wherein the descriptor comparator is operable to provide feedback to the code logic identifier to indicate that for the particular logic entity and the sequential logic entities provided to the descriptor comparator, has not resulted in a match, and to discontinue sending to the descriptor comparator the sequential logic entities associated with the particular logic entity.

### Claim 9 (depends on 1)

The apparatus of claim 1, wherein at least one of the descriptor parts chains included in the tree structure includes no more than a single root node linked to no more than one child node.

### Claim 10 (depends on 1)

The apparatus of claim 1, wherein at least one child node is directly linked to two or more different child nodes.

### Claim 11 (depends on 1)

The apparatus of claim 1, further including:
a malicious code detector coupled to the output of the descriptor comparator, the malicious code detector operable to receive a output signal from the descriptor comparator, the output signal including a probability value indicative of the likelihood that a match found by the descriptor comparator is malicious code, the malicious code detector operable to compare the probability value to a threshold value, and if the value exceeds the threshold value, to provide a single bit output indicative that malicious code has been detected in the received data.

### Claim 12 (depends on 1)

The apparatus of claim 1, wherein each of the descriptor parts chains ends in a terminal child node that has no successor child nodes.

### Claim 13 (depends on 1)

The apparatus of claim 1, wherein the descriptor comparator is operable to perform a comparison of the given sequence of logic entities to the descriptor parts chains in the tree structure by comparing a first received logic entity in the given sequence of logic entities to a set of root nodes included in the tree structure to determine which of the descriptor parts chains to use in the comparison.

### Claim 14 (depends on 13)

The apparatus of claim 13, wherein the descriptor comparator is operable to locate a root node that matches the first received logic entity, and stating at the root node that matches the first received logic entity, to compare the next one or more sequential logic entities in the given sequence of logic entities to one or more child nodes linked to the matching root node to determine if a match exists between the one or more sequential logic entities and the descriptor parts chain that includes the matching root node.

### Claim 15

A method of comparing input code to one or more structural code pattern descriptors to detect malicious code, comprising:
receiving at least some portion of an input file including input code that is to be processed;
identifying a logic entity in the received input code that is to be compared to at least one structural code pattern descriptor included in a tree structure stored in a detection database;
comparing the identified logic entity to one or more structural code pattern descriptors and selecting a particular structural code pattern descriptor to use in the comparison;
determining if the identified logic entity and one or more succeeding logic entities included in the input code matches a chain of nodes including the root node and a path from the root node linking one or more child nodes in the particular structural code pattern descriptor selected for the comparison; and
if a match exists, generating a single bit output indicating the match.

### Claim 16 (depends on 15)

The method of claim 15, wherein generating the single bit output includes:
setting the single bit output to a value that indicates that a match has been found between some portion of the input code at least one structural code pattern descriptor used in the comparison of the input code.

### Claim 17 (depends on 15)

The method of claim 15, further including:
storing the generated single bit output indicating the match;
determining if the end of the input code has been reached; and
if a determination is made that the end of the input code has been reached, generating a final output.

### Claim 18 (depends on 17)

The method of claim 17, wherein generating the final output includes:
determining that more than one indication for a match has been identified; and
determining which of the more than one indications for a matches has a highest match probability.

### Claim 19 (depends on 15)

The method of claim 15, wherein identifying the logic entity that is to be compared includes:
determining if a descriptor part for the logic entity matches any of the descriptor parts included in the root nodes of any structural code pattern descriptors included in the tree structure being used for the comparison.

### Claim 20 (depends on 15)

The method of claim 15, wherein determining if the logic entity and the succeeding logic entities in the input code match the chain of nodes includes the comparison reaching a terminal child node in the path during the comparison.

### Claim 21 (depends on 15)

The method of claim 15, further including:
while determining if the identified logic entity and one or more succeeding logic entities included in the input code matches a chain of nodes, continuing to receive at least some portion of the input file.

### Claim 22

A set of instructions stored on a computer memory that, when executed by a processor, perform a method of comparing input code to one or more structural code pattern descriptors to detect malicious code, the method comprising:
receiving at least some portion of an input file including input code that is to be processed;
identifying a logic entity in the received input code that is to be compared to at least one structural code pattern descriptor included in a tree structure stored in a detection database;
comparing the identified logic entity to one or more structural code pattern descriptors and selecting a particular structural code pattern descriptor to use in the comparison;
determining if the identified logic entity and one or more succeeding logic entities included in the input code matches a chain of nodes including the root node and a path from the root node linking one or more child nodes in the particular structural code pattern descriptor selected for the comparison; and
if a match exists, generating a single bit output indicating the match.

### Claim 23

A detection database comprising:
a plurality of tree structures stored in a detection database, the plurality of tree structures including descriptor parts arranged in one or more descriptor parts chains, each descriptor parts chain including a root node and one or more child nodes linked to the root node, wherein the root node is associated with a compiled descriptor part, and the one or more child nodes each include a different descriptor part that is a possible successor to either the root node or one of the one or more child nodes, and wherein each of the descriptor parts chains represents a structure present in known malware.
