# US 2003/0210781 A1 · Method for encrypting and decrypting messages based on boolean matrices, and data communication system

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

- Number: US 2003/0210781 A1
- Document ID: US20030210781A1
- Status: Published application
- Kind: A1
- Application number: 10/353,810
- Filed: 2003-01-29
- Published: 2003-11-13
- Earliest claimed: 2002-01-29
- Assignees: Sony Corporation
- Inventors: Miodrag Mihaljevic; Ryuji Kohno
- Web page: https://patentgrep.com/patent/US20030210781A1

## CPC

- H04L 9/0618: {Block ciphers, i.e. encrypting groups of characters of a plain text message using fixed encryption transformation}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

This invention provides a method for executing an improved Boolean matrices based encryption, and a data communication system. In a data communication system, a server generates a series of encrypted data message blocks C1, C2, . . . , Cn from plain data blocks P1, P2, . . . , Pn, by computing Ci=K(Pi+KVKi)Kn+i+KVKi. A client receives the encrypted data and generates a series of plain data message blocks P1, P2, . . . , Pn; by computing Pi=K−1(Ci+KVKi)K−(n+i)+KVKi.

## Claims

### Claim 1

A method of encrypting a data message, comprising the steps of:
(a) dividing a data message into a series of blocks P1, P2, . . . , Pn, wherein block number is n;
(b) generating a series of encrypted data message blocks C1, C2, . . . , Cn; by computing the following equation,
Ci=K(Pi+KVKi)Kn+1+KVKi
K: Session key in form of an n×n binary matrix
V: initial n×n binary matrix.

### Claim 2 (depends on 1)

The method according to claim 1,
said session key K is generated from a master secret key in form of an n×n binary matrix K0.

### Claim 3 (depends on 2)

The method according to claim 2,
said method further comprising the steps of:
generating a value K* by computing the following equation,
K*=K0K−1K0
K−1: inverse of K.

### Claim 4 (depends on 2)

The method according to claim 2,
said method further comprising the steps of:
generating a value V* by computing the following equation,
V*=K0VK0.

### Claim 5

A method of decrypting an encrypted data message, comprising the steps of:
(a) generating a series of plain data message blocks P1, P2, . . . , Pn; by computing the following equation,
Pi=K−1(Ci+KVKi)K−(n+1)+KVKi.
K: Session key in form of an n×n binary matrix
V: initial n×n binary matrix
K−1: inverse of K.

### Claim 6 (depends on 5)

The method according to claim 5,
said session key K is generated from a master secret key in form of an n×n binary matrix K0.

### Claim 7 (depends on 6)

The method according to claim 6,
said method further comprising the steps of:
+P2
generating a value K−1 from K* by computing the following equation,
K−1=K0−1K*K0−1.

### Claim 8 (depends on 6)

The method according to claim 6,
said method further comprising the steps of:
generating a value V from V* by computing the following equation,
V=K0−1V*K0−1.

### Claim 9

A data communication-system comprising a server device and a client device wherein:
said server device comprises a data enciphering means which executes a process of dividing a data message into a series of blocks P1, P2, . . . , Pn, wherein block number is n; and a process of generating a series of encrypted data message blocks C1, C2, . . . , Cn; by computing the following equation,
Ci=K(Pi+KVKi)Kn+i+KVKi
K: Session key in form of an n×n binary matrix
V: initial n×n binary matrix;
Said client device comprises a data deciphering means which executes a process of generating a series of plain data message blocks P1, P2, . . . , Pn; by computing the following equation,
Pi=K−1(Ci+KVKi)K−(n+i)+KVKi.
K: Session key in form of an n×n binary matrix
V: initial n×n binary matrix
K−1: inverse of K.

### Claim 10 (depends on 9)

The data communication system according to claim 9,
said session key K is generated from a master secret key in form of an n×n binary matrix K0.

### Claim 11 (depends on 10)

The data communication system according to claim 10,
said data enciphering means further executes a process of generating a value K* by computing the following equation,
K*=K0K−1K0
K−1: inverse of K.

### Claim 12 (depends on 10)

The data communication system according to claim 10,
said data enciphering means further executes a process of generating a value V* by computing the following equation,
V*=K0VK0.

### Claim 13 (depends on 10)

The data communication system according to claim 10,
said data deciphering means further executes a process of generating a value K−1 from K* received from the server device, by computing the following equation.
K−1=K0−1K*K0−1

### Claim 14 (depends on 10)

The data communication system according to claim 10, said data deciphering means further executes a process of generating a value V from V* received from the server device, by computing the following equation,
V=K0−1V*K0−1.
