# US 2024/0205007 A1 · Identity-based encryption method based on lattices

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

- Number: US 2024/0205007 A1
- Document ID: US20240205007A1
- Status: Published application
- Kind: A1
- Application number: 18/590,797
- Filed: 2024-02-28
- Published: 2024-06-20
- Earliest claimed: 2019-11-28
- Assignees: Seoul National University R&Db Foundation
- Applicants: Seoul National University R&Db Foundation
- Inventors: Jung Hee CHEON; Yongha SON; Duhyeong KIM
- Web page: https://patentgrep.com/patent/US20240205007A1

## CPC

- H04L 9/3073: {involving pairings, e.g. identity based encryption [IBE], bilinear mappings or bilinear pairings, e.g. Weil or Tate pairing}
- G06F 21/6209: {to a single file or object, e.g. in a secure envelope, encrypted and accessed using a key, or with access control rules appended to the object itself}
- H04L 9/0643: {Hash functions, e.g. MD5, SHA, HMAC or f9 MAC}
- H04L 9/3093: {involving Lattices or polynomial equations, e.g. NTRU scheme}
- 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

A calculation device is disclosed. The calculation device includes: a memory storing at least one instruction and identity information; and a processor performing the at least one instruction, wherein the processor may randomly sample small elements, generate a function-processed output value by function-processing the stored identity information, and generate an encrypted text for a message by using a master public key computed using a ring having a dimension (d) represented by a power of 2 and an integer multiplication of 3 or more, the sampled small elements and the function-processed output value.

## Claims

### Claim 1

An identity-based encryption method based on a lattice, comprising: receiving identity information;
randomly sampling small elements;
generating a function-processed output value by function-processing the input identity information; and generating an encrypted text for a message by using the sampled small elements, the function-processed output value and a master public key, wherein the master public key is computed using a ring having a dimension (d) other than a power of two represented by a multiplication of a power of 2 and an integer of 3 or more.

### Claim 2 (depends on 1)

The identity-based encryption method based on a lattice, as claimed in claim 1, further comprising:
computing a trapdoor (T) used for the identity-based encryption method based on a lattice; and
determining the computed trapdoor (T) as a master secret key.

### Claim 3 (depends on 2)

The identity-based encryption method based on a lattice, as claimed in claim 2, further comprising:
computing a first random matrix (S) in which the number of columns is smaller than the dimension by 1 and the number of rows is equal to the number of the dimension by sampling elements ({right arrow over (f)}l) linearly in-dependent from each other in the ring;
computing a second random matrix (A) in which the number of columns is equal to the number of the dimension and the number of rows is 1; and
computing the master public key based on the second random matrix (A).

### Claim 4 (depends on 3)

The identity-based encryption method based on a lattice, as claimed in claim 3,
wherein in the computing of the second random matrix, a d×d matrix (Mi) is computed by excluding an i-th row from a matrix [{right arrow over (f)}1 . . . {right arrow over (fd-1)}]∈Rqd×(d-1), and (−1)i-1·det(Mi) is determined as a determinant (ai), thereby computing a1−1·(a1, a2, . . . , ad) as the second random matrix.

### Claim 5 (depends on 4)

The identity-based encryption method based on a lattice, as claimed in claim 4, wherein the computing of the trapdoor (T) includes sampling of vector ({right arrow over (F)}∈Rqd) that satisfies the relationship of det[{right arrow over (f)}∥ . . . ∥{right arrow over (fd-1)}∥{right arrow over (F)}]=q, in which [{right arrow over (f)}∥ . . . ∥{right arrow over (f)}d-1∥{right arrow over (F)}] is computed as the trapdoor (T).

### Claim 6 (depends on 5)

The identity-based encryption method based on a lattice, as claimed in claim 5, wherein in the sampling of the vector ({right arrow over (F)}∈Rqd), a result vector value is output after reducing elements of the vector by using the elements ({right arrow over (f)}l).

### Claim 7 (depends on 6)

The identity-based encryption method based on a lattice, as claimed in claim 6, wherein in the sampling of the vector ({right arrow over (F)}∈Rqd), the elements of the vector are reduced by removing a direction component of the elements by subtracting a constant multiple of the elements ({right arrow over (f)}l) from the elements ({right arrow over (F)}=(F1, . . . , Fd)) of the vector.

### Claim 8 (depends on 6)

The identity-based encryption method based on a lattice, as claimed in claim 6, wherein in the sampling of the vector ({right arrow over (F)}∈Rqd), the elements of the vector are reduced using an extended Euclidean algorithm.

### Claim 9 (depends on 3)

The identity-based encryption method based on a lattice, as claimed in claim 3, further comprising:
computing a solution having a small size, in which the multiplication of the solution and the second random matrix (A) becomes a hash value, with respect to the function-processed output value; and
determining a user secret key using the computed small solution.

### Claim 10 (depends on 9)

The identity-based encryption method based on a lattice, as claimed in
claim 9, further comprising: decrypting the message from the encrypted text by using the user secret key.

### Claim 11 (depends on 1)

The identity-based encryption method based on a lattice, as claimed in claim 1, wherein the identity information is at least one of a social security number, an email address, a phone number, fingerprint information and iris information.

### Claim 12

A calculation device comprising:
a memory storing at least one instruction and identity information; and a processor performing the at least one instruction,
wherein the processor randomly samples small elements,
generates a function-processed output value by function-processing the stored identity information, and
generates an encrypted text for a message by using a master public key computed using a ring having a dimension (d) other than a power of two represented by a multiplication of a power of 2 and an integer of 3 or more, the sampled small elements and the function-processed output value.

### Claim 13 (depends on 12)

The calculation device as claimed in claim 12, wherein the processor computes a first random matrix (S) in which the number of columns is smaller than the dimension by 1 and the number of rows is equal to the number of the dimension, by sampling elements ({right arrow over (f)}l) linearly independent from each other in the ring,
computes a second random matrix (A) in which the number of columns is equal to the number of the dimension and the number of rows is 1, computes the master public key based on the second random matrix (A), and
computes a trapdoor (T) used for the identity-based encryption method based on a lattice and determines the computed trapdoor (T) as a master secret key.

### Claim 14 (depends on 13)

The calculation device as claimed in claim 13, wherein the processor samples a vector that satisfies a predetermined relationship, in which a result vector obtained by reducing elements of the vector is computed as the trap door.

### Claim 15

A non-transitory computer-readable recording medium including a program performing an identity-based encryption method based on a lattice, wherein the identity-based encryption method based on a lattice includes:
receiving identity information; randomly sampling small elements;
generating a function-processed output value by function-processing the input identity information; and
generating an encrypted text for a message by using the sampled small elements, the function-processed output value and a master public key, wherein the master public key being computed using a ring having a dimension (d) other than a power of two represented by a multiplication of a power of 2 and an integer of 3 or more.
