# US 11,121,855 B2 · System and method for secure exchange

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

- Number: US 11,121,855 B2
- Document ID: US11121855B2
- Status: Granted
- Kind: B2
- Application number: 16/784,647
- Filed: 2020-02-07
- Published: 2020-06-04
- Granted: 2021-09-14
- Earliest claimed: 2018-01-31
- Assignees: Rankin Labs, LLC
- Applicants: John Rankin
- Inventors: John Rankin; Phillip Wayne Coffelt; Wilberto Nemrod Salazar
- Web page: https://patentgrep.com/patent/US11121855B2

## CPC

- H04L 9/0625: {with splitting of the data block into left and right halves, e.g. Feistel based algorithms, DES, FEAL, IDEA or KASUMI}
- H04L 9/0656: {Pseudorandom key sequence combined element-for-element with data sequence, e.g. one-time-pad [OTP] or Vernam's cipher}
- H04L 9/0869: {involving random numbers or seeds}
- G06F 7/582: {Pseudo-random number generators}
- 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

Systems and methods for secure communication are provided. A sender encrypts a first starting block with one of a number of random blocks. The encrypted first starting block is sent to a receiver, which expands it by a random amount. The expanded block is divided into a first expanded block and a second expanded block. A source data block is encrypted with the second expanded block and transmitted to the receiver, where it is decrypted with the decrypted first starting block. The first expanded block replaces the starting block for subsequent transmission.

## Claims

### Claim 1

A method of using a relatively small block of random numbers to secure a relatively large area of storage, said method comprising the steps of:
providing a plurality of receiving processes with access to a common area of storage memory;
providing a starting block of random numbers with access to the common area of storage memory, wherein the starting block of random numbers is smaller in size than the common area of storage memory;
providing a source of random blocks comprising a plurality of blocks of random numbers, wherein each of the plurality of blocks of random numbers are equal in size to the starting block of random numbers, and wherein the source of random blocks is managed by a sending process that is exchanging information;
encrypting, at the sending process, a first one of the plurality of blocks of random numbers (“the first block”), with the starting block of random numbers;
transmitting the encrypted first block to each of the plurality of receiving processes;
decrypting, at each of the plurality of receiving processes, the encrypted first block with the starting block of random numbers;
expanding a second one of the plurality of blocks of random numbers (“the second block”) with a formula, wherein said formula utilizes a random number of random numbers to increase the number of random numbers contained within the second block;
dividing the expanded second block into:
a first subblock for subsequent exchanges of new random numbers; and
a second subblock for encryption and decryption of some or all of the common area of storage memory.

### Claim 2 (depends on 1)

The method of claim 1, wherein:
said sending process and each of said plurality of receiving processes are located within a single machine.

### Claim 3 (depends on 1)

The method of claim 1, wherein:
said sending process is located at a first machine and at least one of the said plurality of receiving processes are located at a second machine, wherein each of said first and second machines have access to the common area of storage memory.

### Claim 4 (depends on 1)

The method of claim 1, wherein:
the common area of storage memory is provided at a long-term external device.

### Claim 5 (depends on 4)

The method of claim 4 wherein:
the long-term external device comprises a disk drive.

### Claim 6

A method of using a relatively small block of random numbers to secure a relatively large transmission comprising the steps of:
providing a sending process and a receiving process;
creating a first block of random numbers at the sending process;
encrypting the first block of random numbers;
transmitting the first block of random numbers to the receiving process;
decrypting the first block of random numbers at the receiving process to create a second block of random numbers of equal size to the first block;
expanding the second block of random numbers with a formula that uses a random number of random numbers to increase the number of random numbers contained with the second block;
dividing the expanded second block into:
a first expanded block configured for use in subsequent transmissions of new random numbers, and
a second expanded block configured for use in data transmission of source data.

### Claim 7 (depends on 6)

The method of claim 6, wherein:
the sending process and the receiving process are located at a common machine.

### Claim 8 (depends on 6)

The method of claim 6, wherein:
the sending process and the receiving process are located at different machines.

### Claim 9 (depends on 6)

The method of claim 6, wherein:
the sending process is located at a first machine; and
the receiving process is located at a second machine.

### Claim 10 (depends on 9)

The method of claim 9, wherein:
the sending process and the receiving process are connected to one another by way of a network.

### Claim 11 (depends on 10)

The method of claim 10, wherein:
the network comprises an IP network.

### Claim 12

A method for secure communication comprising the steps of:
providing a common storage area comprising a first starting block, a first random block, and a first source data block;
providing a sender, wherein said sender has access to said common storage area;
providing one or more receivers, wherein each of said one or more receivers has access to said common storage area;
encrypting the first starting block with the first random block;
transmitting the encrypted first starting block to each of the one or more receivers;
decrypting the encrypted first starting block;
expanding the encrypted first starting block by a random amount greater than or equal to the size of the first source data block;
dividing the expanded first starting block into:
a first expanded block; and
a second expanded block sized to accommodate the first source data block;
encrypting the first source data block with the second expanded block;
transmitting the encrypted first source data block to each of the one or more receivers; and
decrypting the encrypted source data block with the decrypted first starting block.

### Claim 13 (depends on 12)

The method of claim 12, further comprising the steps of:
replacing the first starting block with the first expanded block.

### Claim 14 (depends on 12)

The method of claim 12, wherein:
the first expanded block is configured to be used with subsequent transmissions.

### Claim 15 (depends on 12)

The method of claim 12, wherein:
the sender and each of the one or more receivers are located at a common machine.

### Claim 16 (depends on 12)

The method of claim 12, wherein:
the sender is located at a first computing machine;
each of the one or more receivers are located at respective remote computing machines; and
each of the respective remote computing machines are in electronic communication with the first computing machine.

### Claim 17 (depends on 16)

The method of claim 16, wherein:
the sender comprises a sending device; and
each of the one or more receivers comprise a respective receiving device.

### Claim 18 (depends on 16)

The method of claim 16, wherein:
the sender comprises a sending process; and
each of the one or more receivers comprise a respective receiving process.

### Claim 19 (depends on 16)

The method of claim 16, wherein:
the common storage area is located at a third computing machine remote from the first computing machine and each of the respective remote computing machines; and
the first computing machine and each of the respective remote computing machines are in electronic communication with the third computing machine.

### Claim 20 (depends on 19)

The method of claim 19, wherein:
electronic communication between the first computing machine, each of the respective remote computing machines, and the third computing machine is accomplished by way of an IP network.