# US 2014/0192980 A1 · Data Encryption System and Method

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

- Number: US 2014/0192980 A1
- Document ID: US20140192980A1
- Status: Published application
- Kind: A1
- Application number: 14/203,309
- Filed: 2014-03-10
- Published: 2014-07-10
- Earliest claimed: 2006-08-14
- Assignees: Key Holdings, LLC
- Applicants: Key Holdings, LLC
- Inventors: Ray Clayton; Eliel J. Mendoza
- Web page: https://patentgrep.com/patent/US20140192980A1

## CPC

- H04L 9/0816: {Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use}
- H04L 9/0841: {involving Diffie-Hellman or related key agreement protocols}
- H04L 9/3013: {involving the discrete logarithm problem, e.g. ElGamal or Diffie-Hellman systems}
- H04L 9/3236: {using cryptographic hash functions}
- H04L 2209/16: Obfuscation or hiding, e.g. involving white box
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

An improved method for data encryption has been developed. The method includes storing data, multiple prime numbers and random numbers within an electronic memory storage device. Next, calculating a public number using the multiple prime numbers and providing a public number to a recipient apparatus that has knowledge of the multiple prime numbers. The method then encrypts the stored data with a randomly generated key and deletes the randomly generated key after use. Next, the method calculates a common shared secret between the sender and recipient using the prime numbers, a recipient public number and the second random number. The sender and recipient calculate parameters using a key equation based on the randomly generated key and random numbers and a common shared secret. Finally, the recipient calculates the randomly generated key for decryption using the common shared secret, one of the prime numbers, the parameters and the simultaneous equations for decryption of the data.

## Claims

### Claim 1

A method data encryption, comprising:
a. storing data, a first prime number (P), a second prime number (G), a third prime number (C), a first private prime number (Ps), a first random number (M), and a second random number (R), within an electronic memory storage device;
b. calculating a sender public number (PUBs) with a processing element according to an equation PUBs=GPsmodP, using the first private prime number (Ps), the first prime number (P), and the second prime number (G);
c. providing the sender public number (PUBs) to a recipient apparatus having knowledge of the first prime number (P), the second prime number (G), and the third prime number (C);
d. encrypting the stored data with the processing element using encryption logic and a randomly generated key;
e. deleting the randomly generated key from the processing element after encryption of the data;
f. calculating a common shared secret (S) with the processing element using the first prime number (P), the first private prime number (Ps), a recipient public number (PUBr), and the second random number (R);
g. calculating a plurality of parameters with the processing element using a key equation based on the randomly generated key and the first random number (M),
i. where the first parameter (Y1) is calculated using the third prime number (C) in the key equation, and
ii. where the second parameter (Y2) is calculated using the common shared secret (S) in the key equation;
h. transmitting the encrypted data, the second random number (R), and the plurality of parameters (Y1,Y2) to a recipient apparatus;
i. calculating the common shared secret (S) with the recipient apparatus in accordance with a second shared secret equation using the first prime number (P), a recipient private prime number (Pr), the sender public number (PUBs), and the second random number (R);
j. calculating the randomly generated key with the recipient apparatus using the common shared secret (S), the third prime number (C), the plurality of parameters (Y1,Y2) and the simultaneous equations; and
k. decrypting the encrypted data with the recipient apparatus using encryption logic and a randomly generated key.

### Claim 2 (depends on 1)

The method of claim 1, where the sender public number (PUBs) is equal to a dividend modulo a divisor, wherein the dividend is the second prime number (G) raised to the power of the first private prime number (Ps) and the divisor is the first prime number (P).

### Claim 3 (depends on 1)

The method of claim 1, where the first one of the plurality of parameters (Y1) is equal to the randomly generated key plus the second random number (M) multiplied by the third prime number (C).

### Claim 4 (depends on 1)

The method of claim 1, where the second one of the plurality of parameters (Y2) is equal to the randomly generated key plus the second random number (M) multiplied by the common shared secret (S).