# US 2019/0319796 A1 · Low latency post-quantum signature verification for fast secure-boot

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

- Number: US 2019/0319796 A1
- Document ID: US20190319796A1
- Status: Published application
- Kind: A1
- Application number: 16/456,034
- Filed: 2019-06-28
- Published: 2019-10-17
- Earliest claimed: 2019-06-28
- Assignees: Intel Corporation
- Applicants: Intel Corporation
- Inventors: SANTOSH GHOSH; Vikram Suresh; Sanu Mathew; Manoj Sastry; Andrew H. Reinders; Raghavan Kumar; Rafael Misoczki
- Web page: https://patentgrep.com/patent/US20190319796A1

## CPC

- H04L 9/3236: {using cryptographic hash functions}
- H04L 9/3239: {involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD}
- G09C 1/00: Apparatus or methods whereby a given sequence of signs, e.g. an intelligible text, is transformed into an unintelligible sequence of signs by transposing the signs or groups of signs or by replacing them by others according to a predetermined system (cryptographic typewriters G09C3/00)
- H04L 9/0643: {Hash functions, e.g. MD5, SHA, HMAC or f9 MAC}
- H04L 9/0852: {Quantum cryptography (transmission systems employing electromagnetic waves other than radio waves, e.g. light, infrared H04B10/00; wavelength-division multiplex systems H04J14/02; WDM arrangements H04J14/03)}
- H04L 9/0877: {using additional device, e.g. trusted platform module [TPM], smartcard, USB or hardware security module [HSM]}
- H04L 9/30: Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy
- H04L 9/3247: {involving digital signatures}
- H04L 9/50: {using hash chains, e.g. blockchains or hash trees}
- H04L 2209/125: Parallelization or pipelining, e.g. for accelerating processing of cryptographic operations
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G09C: CIPHERING OR DECIPHERING APPARATUS FOR CRYPTOGRAPHIC OR OTHER PURPOSES INVOLVING THE NEED FOR SECRECY

## Abstract

In one example an apparatus comprises a computer readable memory, an XMSS verification manager logic to manage XMSS verification functions, a one-time signature and public key generator logic, a chain function logic to implement chain function algorithms, a low latency SHA3 hardware engine, and a register bank communicatively coupled to the XMSS verification manager logic. Other examples may be described.

## Claims

### Claim 1

An apparatus, comprising:
a computer readable memory;
an XMSS verification manager logic to manage XMSS verification functions;
a one-time signature and public key generator logic;
a chain function logic to implement chain function algorithms;
a low latency SHA3 hardware engine; and
a register bank communicatively coupled to the XMSS verification manager logic.

### Claim 2 (depends on 1)

The apparatus of claim 1, further comprising logic to:
receive, in the computer readable memory, a set of XMSS inputs for an XMSS operation; and
apply the set of XMSS inputs to an XMSS verification manager logic.

### Claim 3 (depends on 2)

The apparatus of claim 2, further comprising logic to:
assert a busy signal on a communication bus; and
switch to a protected mode in which external read/write operations are disregarded.

### Claim 4 (depends on 3)

The apparatus of claim 3, further comprising logic to:
apply a one-time signature function process to the set of XMSS inputs; and
invoke the chain function logic to apply a chain function to facilitate the one-time signature function.

### Claim 5 (depends on 1)

The apparatus of claim 1, wherein the SHA3 hardware engine is capable to perform a SHAKE-128 function or to perform a SHAKE-256 operation.

### Claim 6 (depends on 5)

The apparatus of claim 5, wherein the SHA3 hardware engine comprises a 1600 bit state register to receive a first set of inputs for each WOTS chain function, a second set of inputs for hashes involved in an L-Tree computation, a third set of inputs for a Merkle tree root node computation, and a 256 bit message input.

### Claim 7 (depends on 6)

The apparatus of claim 6, wherein the SHA3 hardware engine comprises logic to:
perform a first set of 24 SHA3 rounds using the first set of inputs; and
generate a first 128 bit output.

### Claim 8 (depends on 7)

The apparatus of claim 7, wherein the SHA3 hardware engine comprises logic to:
perform a second set of 24 SHA3 rounds using no inputs; and
generate a second 128 bit output.

### Claim 9 (depends on 6)

The apparatus of claim 6, wherein the SHA3 hardware engine comprises logic to:
perform a first set of 24 SHA3 rounds using the first set of inputs; and
generate a first 256 bit output.

### Claim 10 (depends on 9)

The apparatus of claim 9, wherein the SHA3 hardware engine comprises logic to:
perform a second set of 24 SHA3 rounds using no inputs; and
generate a second 256 bit output.

### Claim 11

An electronic device, comprising:
a processor; and
a hardware accelerator for an authentication logic, the hardware accelerator comprising:
a computer readable memory;
an XMSS verification manager logic to manage XMSS verification functions;
a one-time signature and public key generator logic;
a chain function logic to implement chain function algorithms;
a low latency SHA3 hardware engine; and
a register bank communicatively coupled to the XMSS verification manager logic.

### Claim 12 (depends on 11)

The electronic device of claim 11, the hardware accelerator further comprising logic to:
receive, in the computer readable memory, a set of XMSS inputs for an XMSS operation; and
apply the set of XMSS inputs to an XMSS verification manager logic.

### Claim 13 (depends on 12)

The electronic device of claim 12, the hardware accelerator further comprising logic to:
assert a busy signal on a communication bus; and
switch to a protected mode in which external read/write operations are disregarded.

### Claim 14 (depends on 13)

The electronic device of claim 13, the hardware accelerator further comprising logic to:
apply a one-time signature function process to the set of XMSS inputs; and
invoke the chain function logic to apply a chain function to facilitate the one-time signature function.

### Claim 15 (depends on 11)

The electronic device of claim 11, wherein the SHA3 hardware engine is capable to perform a SHAKE-128 function or to perform a SHAKE-256 operation.

### Claim 16 (depends on 15)

The electronic device of claim 15, wherein the SHA3 hardware engine comprises a 1600 bit state register to receive a first set of inputs for each WOTS chain function, a second set of inputs for hashes involved in an L-Tree computation, a third set of inputs for a Merkle tree root node computation, and a 256 bit message input.

### Claim 17 (depends on 16)

The electronic device of claim 16, wherein the SHA3 hardware engine comprises logic to:
perform a first set of 24 SHA3 rounds using the first set of inputs; and
generate a first 128 bit output.

### Claim 18 (depends on 17)

The electronic device of claim 17, wherein the SHA3 hardware engine comprises logic to:
perform a second set of 24 SHA3 rounds using no inputs; and
generate a second 128 bit output.

### Claim 19 (depends on 16)

The electronic device of claim 16, wherein the SHA3 hardware engine comprises logic to: perform a first set of 24 SHA3 rounds using the first set of inputs; and
generate a first 256 bit output.

### Claim 20 (depends on 19)

The electronic device of claim 19, wherein the SHA3 hardware engine comprises logic to:
perform a second set of 24 SHA3 rounds using no inputs; and
generate a second 256 bit output.
