# US 2024/0267212 A1 · Post-Quantum Cryptography Key Encapsulation Mechanism System

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

- Number: US 2024/0267212 A1
- Document ID: US20240267212A1
- Status: Published application
- Kind: A1
- Application number: 18/164,487
- Filed: 2023-02-03
- Published: 2024-08-08
- Earliest claimed: 2023-02-03
- Assignees: Intel Corporation
- Applicants: Intel Corporation
- Inventors: Santosh Ghosh; Manoj Sastry
- Web page: https://patentgrep.com/patent/US20240267212A1

## CPC

- H04L 9/0869: {involving random numbers or seeds}
- 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)

## Abstract

Key encapsulation implemented by random sample generator circuitry to generate a plurality of pseudorandom bitstreams; polynomial multiplier circuitry to multiply a plurality of polynomial coefficients; and a controller to power off the polynomial multiplier circuitry and power on the random sample generator circuitry to generate the plurality of pseudorandom bitstreams, and power off the random sample generator circuitry and power on the polynomial multiplier circuitry to multiple the plurality of polynomial coefficients.

## Claims

### Claim 1

An apparatus comprising:
random sample generator circuitry to generate a plurality of pseudorandom bitstreams;
polynomial multiplier circuitry to multiply a plurality of polynomial coefficients; and
a controller to power off the polynomial multiplier circuitry and power on the random sample generator circuitry to generate the plurality of pseudorandom bitstreams, and power off the random sample generator circuitry and power on the polynomial multiplier circuitry to multiple the plurality of polynomial coefficients.

### Claim 2 (depends on 1)

The apparatus of claim 1, comprising a memory including a plurality of independently readable and writable memory units, the random sample generator circuitry and the polynomial multiplier circuitry to independently read from and write to the plurality of independently readable and writable memory units.

### Claim 3 (depends on 2)

The apparatus of claim 2, wherein a number of the plurality of independently readable and writable memory units is 8 and a bandwidth of the memory is 192 bits per cycle.

### Claim 4 (depends on 1)

The apparatus of claim 1, wherein the random sample generator circuitry and the polynomial multiplier circuitry execute a Cryptographic Suite for Algebraic Lattices (CRYSTALS) Kyber process for key encapsulation.

### Claim 5 (depends on 1)

The apparatus of claim 1, wherein the random sample generator circuitry generates the plurality of pseudorandom bitstreams using a Keccak mathematical function.

### Claim 6 (depends on 2)

The apparatus of claim 2, wherein the random sample generator circuitry comprises:
Keccak generator circuitry to read seed data from the memory and execute a plurality of Keccak operations to generate the plurality of pseudorandom bitstreams; and
parser circuitry to generate the plurality of polynomial coefficients in parallel from the plurality of pseudorandom bitstreams and write the plurality of polynomial coefficients to the memory.

### Claim 7 (depends on 6)

The apparatus of claim 6, wherein the Keccak generator circuitry generates one pseudorandom bitstream every seven cycles and parser circuitry generates the plurality of polynomial coefficients every seven cycles, in parallel.

### Claim 8 (depends on 2)

The apparatus of claim 2, wherein the polynomial multiplier circuitry comprises:
a plurality of butterfly units to execute a selected one of number theoretic transform (NTT) operations and inverse NTT operations in parallel on the plurality of polynomial coefficients.

### Claim 9 (depends on 8)

The apparatus of claim 8, wherein the polynomial multiplier circuitry comprises:
data flow controller circuitry to read polynomial coefficients from the memory and write polynomial coefficients updated by the plurality of butterfly units to the memory in parallel.

### Claim 10 (depends on 9)

The apparatus of claim 9, wherein a number of the plurality of butterfly units is 8 and the data flow controller circuitry writes 16 polynomial coefficients to the memory in parallel.

### Claim 11 (depends on 1)

The apparatus of claim 1, comprising the controller to configure the polynomial multiplier circuitry for a selected one of NTT operations and inverse NTT operations.

### Claim 12

A method comprising:
generating, by a random sample generator, a plurality of pseudorandom bitstreams;
multiplying, by a polynomial multiplier, a plurality of polynomial coefficients; and
powering off the polynomial multiplier and powering on the random sample generator to generate the plurality of pseudorandom bitstreams, and powering off the random sample generator and powering on the polynomial multiplier to multiple the plurality of polynomial coefficients.

### Claim 13 (depends on 12)

The method of claim 12, comprising independently reading from and writing to a plurality of independently readable and writable memory units of a memory by random sample generator and the polynomial multiplier.

### Claim 14 (depends on 12)

The method of claim 12, wherein the random sample generator and the polynomial multiplier execute a Cryptographic Suite for Algebraic Lattices (CRYSTALS) Kyber process for key encapsulation.

### Claim 15 (depends on 12)

The method of claim 12, comprising generating the plurality of pseudorandom bitstreams using a Keccak mathematical function.

### Claim 16 (depends on 13)

The method of claim 13, comprising:
reading seed data from the memory and executing a plurality of Keccak operations by a Keccak generator of the random sample generator to generate the plurality of pseudorandom bitstreams; and
generating the plurality of polynomial coefficients in parallel by a parser of the random sample generator from the plurality of pseudorandom bitstreams and writing the plurality of polynomial coefficients to the memory.

### Claim 17

A system comprising:
a memory to store a key; and
key encapsulation mechanism circuitry to generate the key including:
random sample generator circuitry to generate a plurality of pseudorandom bitstreams;
polynomial multiplier circuitry to multiply a plurality of polynomial coefficients; and
a controller to power off the polynomial multiplier circuitry and power on the random sample generator circuitry to generate the plurality of pseudorandom bitstreams, and power off the random sample generator circuitry and power on the polynomial multiplier circuitry to multiple the plurality of polynomial coefficients.

### Claim 18 (depends on 17)

The system of claim 17, wherein the key encapsulation mechanism circuitry comprise a memory including a plurality of independently readable and writable memory units, the random sample generator circuitry and the polynomial multiplier circuitry to independently read from and write to the plurality of independently readable and writable memory units.

### Claim 19 (depends on 17)

The system of claim 17, wherein the random sample generator circuitry comprises:
Keccak generator circuitry to read seed data from the memory and execute a plurality of Keccak operations to generate the plurality of pseudorandom bitstreams; and
parser circuitry to generate the plurality of polynomial coefficients in parallel from the plurality of pseudorandom bitstreams and write the plurality of polynomial coefficients to the memory.

### Claim 20 (depends on 17)

The system of claim 17, wherein the polynomial multiplier circuitry comprises:
a plurality of butterfly units to execute a selected one of number theoretic transform (NTT) operations and inverse NTT operations in parallel on the plurality of polynomial coefficients.
