# US 2014/0229517 A1 · Automatic Computer Program Obfuscation System

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

- Number: US 2014/0229517 A1
- Document ID: US20140229517A1
- Status: Published application
- Kind: A1
- Application number: 13/945,264
- Filed: 2013-07-18
- Published: 2014-08-14
- Earliest claimed: 2013-02-14
- Assignees: Cisco Technology, Inc.
- Applicants: Cisco Technology Inc.
- Inventors: Harel Cain; Guy Adini; Nir Moshe
- Web page: https://patentgrep.com/patent/US20140229517A1

## CPC

- G06F 21/14: against software analysis or reverse engineering, e.g. by obfuscation
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A computer program obfuscating system including a processor to provide a computer program including at least one computer program variable, and add an opaque predicate to the computer program to obfuscate the computer program so that the opaque predicate added to the computer program comprises at least one polynomial including a polynomial P, during execution of the obfuscated computer program, the polynomial P is evaluated yielding at least one result including a first result R1, and during execution of the obfuscated computer program, the opaque predicate is evaluated based on the at least one result R1 such that a decision as to whether or not to perform the first command is dependent upon comparing the first result R1 to at least one value in accordance with a predetermined mathematical relationship. Related apparatus and methods are also included.

## Claims

### Claim 1

A computer program obfuscating system comprising a processor to:
provide a computer program performing a plurality of commands including a first command, the computer program including at least one computer program variable used during execution of the computer program; and then
add an opaque predicate to the computer program to obfuscate the computer program so that:
the opaque predicate added to the computer program comprises at least one polynomial including a polynomial P in at least one indeterminate, the polynomial P being a degree two or more polynomial;
during execution of the obfuscated computer program, the polynomial P is evaluated by substituting the value or values of the at least one computer program variable, or a function of the value or values of the at least one computer program variable, into the polynomial P yielding at least one result including a first result R1; and
during execution of the obfuscated computer program, the opaque predicate is evaluated based on the at least one result R1 such that a decision as to whether or not to perform the first command is dependent upon comparing the first result R1 to at least one value in accordance with a predetermined mathematical relationship.

### Claim 2 (depends on 1)

The system according to claim 1, wherein adding the opaque predicate to the computer program does not change the functionality of the computer program regarding the outputs of the computer program.

### Claim 3 (depends on 1)

The system according to claim 1, wherein the processor is operative to add the opaque predicate to the computer program to obfuscate the computer program so that during execution of the computer program, evaluation of the opaque predicate yielding the decision as to whether or not to perform the first command is arranged so that the decision outcome is the same whatever the value or values of the at least one computer program variable.

### Claim 4 (depends on 3)

The system according to claim 3, wherein the decision as to whether or not to perform the first command is arranged, so that the decision outcome is the same whatever the value or values of the at least one computer program variable, by configuring the predetermined mathematical relationship based on at least one property of the polynomial P.

### Claim 5 (depends on 4)

The system according to claim 4, wherein the at least one property of the polynomial includes the roots of the polynomial P.

### Claim 6 (depends on 5)

The system according to claim 5, wherein the at least one property of the polynomial P includes whether the sign of the polynomial P is positive or negative in a certain interval of the polynomial P.

### Claim 7 (depends on 5)

The system according to claim 5, wherein the at least one property of the polynomial includes whether the polynomial P is monotonically increasing or monotonically decreasing in a certain interval of the polynomial P.

### Claim 8 (depends on 4)

The system according to claim 4, wherein the at least one property of the polynomial includes Q divides P where Q is a polynomial.

### Claim 9 (depends on 1)

The system according to claim 1, wherein:
the processor is operative to determine whether the sign of the polynomial P is positive or negative in a certain interval of the polynomial P;
the at least one computer program variable includes a variable b; and
the processor is operative to add the opaque predicate to the computer program such that during execution of the obfuscated computer program:
a value of F(b) is calculated where F is a function which translates b into the certain interval of the polynomial P; and
the polynomial P is evaluated by substituting the value of F(b) into the polynomial P yielding the first result R1.

### Claim 10 (depends on 9)

The system according to claim 9, wherein the processor is operative to add the opaque predicate to the computer program such that during execution of the obfuscated computer program, the opaque predicate is evaluated based on the first result R1 such that the decision as to whether or not to perform the first command is dependent upon whether the sign of the first result R1 is positive or negative.

### Claim 11 (depends on 1)

The system according to claim 1, wherein:
the at least one computer program variable includes a variable b and a variable c;
the processor is operative to determine whether the polynomial P is monotonically increasing or monotonically decreasing in a certain interval of the polynomial P; and
the processor is operative to add the opaque predicate to the computer program such that during execution of the obfuscated computer program:
a value of F(b) is calculated where F is a function which translates an input into the certain interval of the polynomial P;
a value of F(c) is calculated;
the polynomial P is evaluated by substituting the value of F(b) into the polynomial P yielding the first result R1;
the polynomial P is evaluated by substituting the value of F(c) into the polynomial P yielding a second result R2; and
the opaque predicate is evaluated based on the first result R1 and the second result R2 such that the decision as to whether or not to perform the first command is dependent upon comparing the first result R1 and the second result R2 to the at least one value in accordance with the predetermined mathematical relationship.

### Claim 12 (depends on 11)

The system according to claim 11, wherein the processor is operative to add the opaque predicate to the computer program such that during execution of the obfuscated computer program, the opaque predicate is evaluated based on the first result R1 and the second result R2 such that the decision as to whether or not to perform the first command is dependent upon whether the sign of
{
R


1
-
R


2
}
/
{
F

(
b
)
-
F

(
c
)
}

R


1
-
R


2
F

(
b
)
-
F

(
c
)
is positive or negative.

### Claim 13 (depends on 1)

The system according to claim 1, wherein:
the processor is operative to add the opaque predicate to the computer program such that the at least one polynomial added to the computer program includes a polynomial Q in at least one indeterminate such that Q divides P; and
the processor is operative to add the opaque predicate to the computer program such that during execution of the obfuscated computer program:
the polynomial P is evaluated by substituting the value or values of the at least one computer program variable, or a function of the value or values of the at least one computer program variable, into the polynomial P yielding the first result R1;
the polynomial Q is evaluated by substituting the value or values of the at least one computer program variable, or a function of the value or values of the at least one computer program variable, into the polynomial Q yielding a second result R2; and
the opaque predicate is evaluated based on the first result R1 and the second result R2 such that the decision as to whether or not to perform the first command is dependent upon comparing the first result R1 and the second result R2 to the at least one value in accordance with the predetermined mathematical relationship.

### Claim 14 (depends on 13)

The system according to claim 13, wherein the processor is operative to add the opaque predicate to the computer program such that during execution of the obfuscated computer program the opaque predicate is evaluated based on the first result R1 and the second result R2 such that the decision as to whether or not to perform the first command is dependent upon whether R2 divides R1 or not.

### Claim 15

An obfuscating method comprising:
providing a computer program performing a plurality of commands including a first command, the computer program including at least one computer program variable used during execution of the computer program; and then
adding an opaque predicate to the computer program to obfuscate the computer program so that:
the opaque predicate added to the computer program comprises at least one polynomial including a polynomial P in at least one indeterminate, the polynomial P being a degree two or more polynomial;
during execution of the obfuscated computer program, the polynomial P is evaluated by substituting the value or values of the at least one computer program variable, or a function of the value or values of the at least one computer program variable, into the polynomial P yielding at least one result including a first result R1; and
during execution of the obfuscated computer program, the opaque predicate is evaluated based on the at least one result R1 such that a decision as to whether or not to perform the first command is dependent upon comparing the first result R1 to at least one value in accordance with a predetermined mathematical relationship.
