# US 2019/0319799 A1 · Message index aware multi-hash acelerator for post quantum cryptography secure hash-based signing and verification

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

- Number: US 2019/0319799 A1
- Document ID: US20190319799A1
- Status: Published application
- Kind: A1
- Application number: 16/455,921
- Filed: 2019-06-28
- Published: 2019-10-17
- Earliest claimed: 2019-06-28
- Assignees: Intel Corporation
- Applicants: Intel Corporation
- Inventors: Vikram Suresh; Sanu Mathew; Manoj Sastry; Santosh Ghosh; Raghavan Kumar; Rafael Misoczki
- Web page: https://patentgrep.com/patent/US20190319799A1

## CPC

- 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/3247: {involving digital signatures}
- G06F 9/3877: {using a secondary processor, e.g. coprocessor (peripheral processor G06F13/12)}
- H04L 9/0643: {Hash functions, e.g. MD5, SHA, HMAC or f9 MAC}
- H04L 9/0861: {Generation of secret information including derivation or calculation of cryptographic keys or passwords}
- H04L 9/3239: {involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD}
- 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
- G09C: CIPHERING OR DECIPHERING APPARATUS FOR CRYPTOGRAPHIC OR OTHER PURPOSES INVOLVING THE NEED FOR SECRECY
- 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

In one example an apparatus comprises a computer readable memory, a signature logic to generate a signature to be transmitted in association with a message, the signature logic to apply a hash-based signature scheme to the message using a private key to generate the signature comprising a public key, or a verification logic to verify a signature received in association with the message, the verification logic to apply the hash-based signature scheme to verify the signature using the public key, and an accelerator logic to apply a structured order to at least one set of inputs to the hash-based signature scheme. Other examples may be described.

## Claims

### Claim 1

An apparatus, comprising:
a computer readable memory;
at least one of:
a signature logic to generate a signature to be transmitted in association with a message, the signature logic to apply a hash-based signature scheme to the message using a private key to generate the signature comprising a public key, or
a verification logic to verify a signature received in association with the message, the verification logic to apply the hash-based signature scheme to verify the signature using the public key; and
an accelerator logic to apply a structured order to at least one set of inputs to the hash-based signature scheme.

### Claim 2 (depends on 1)

The apparatus of claim 1, further comprising logic to:
divide the signature into a plurality of signature components; and
apply a secure hash algorithm (SHA) to the plurality of signature components.

### Claim 3 (depends on 2)

The apparatus of claim 2, the accelerator logic to:
identify a hash chain message length for each signature component in the plurality of signature components; and
sort the plurality of signature components into an indexed hash chain list according to the respective hash chain message length of each signature component in the plurality of signature components.

### Claim 4 (depends on 3)

The apparatus of claim 3, wherein the hash-based signature scheme utilizes a plurality of hash engines to apply the SHA to the plurality of signature components.

### Claim 5 (depends on 4)

The apparatus of claim 4, the accelerator logic to:
assign the plurality of signature components into a plurality of groups according to their respective chain message lengths, the plurality groups corresponding to the plurality of hash engines; and
assign the plurality of groups to the plurality of hash engines to be executed contemporaneously.

### Claim 6 (depends on 5)

The apparatus of claim 5, the accelerator logic to:
alternate between the signature component having a longest chain message length and a signature component having a shortest chain message length to assign the plurality of signature components into the corresponding plurality of groups.

### Claim 7 (depends on 1)

The apparatus of claim 1, wherein the hash-based signature scheme comprises an XMSS signature scheme.

### Claim 8

A computer-implemented method, comprising:
performing at least one of:
generating a signature to be transmitted in association with a message by applying a hash-based signature scheme to the message using a private key to generate the signature comprising a public key, or
verifying a signature received in association with the message, the verification logic to apply the hash-based signature scheme to verify the signature using the public key; and
applying a structured order to at least one set of inputs to the hash-based signature scheme.

### Claim 9 (depends on 8)

The method of claim 8, further comprising:
dividing the signature into a plurality of signature components; and
applying a secure hash algorithm (SHA) to the plurality of signature components.

### Claim 10 (depends on 9)

The method of claim 9, further comprising:
identifying a hash chain message length for each signature component in the plurality of signature components; and
sorting the plurality of signature components into an indexed hash chain list according to the respective hash chain message length of each signature component in the plurality of signature components.

### Claim 11 (depends on 10)

The method of claim 10, wherein the hash-based signature scheme utilizes a plurality of hash engines to apply the SHA to the plurality of signature components.

### Claim 12 (depends on 11)

The method of claim 11, further comprising:
assigning the plurality of signature components into a plurality of groups according to their respective chain message lengths, the plurality groups corresponding to the plurality of hash engines; and
assigning the plurality of groups to the plurality of hash engines to be executed contemporaneously.

### Claim 13 (depends on 12)

The method of claim 12, further comprising:
alternating between the signature component having a longest chain message length and a signature component having a shortest chain message length to assign the plurality of signature components into the corresponding plurality of groups.

### Claim 14 (depends on 8)

The method of claim 8, wherein the hash-based signature scheme comprises an XMSS signature scheme.

### Claim 15

A non-transitory computer-readable medium comprising instructions which, when executed by a processor, configure the processor to perform operations, comprising:
applying a hash-based signature scheme to perform at least one of:
generating a signature using a private key, the signature to be transmitted in association with a message comprising a public key, or
verifying the signature received in association with the message using the public key; and
applying a structured order to at least one set of inputs to the hash-based signature scheme.

### Claim 16 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein the instructions configure the processor to perform operations comprising:
dividing the signature into a plurality of signature components; and
applying a secure hash algorithm (SHA) to the plurality of signature components.

### Claim 17 (depends on 16)

The non-transitory computer-readable medium of claim 16, wherein the instructions configure the processor to perform operations comprising:
identifying a hash chain message length for each signature component in the plurality of signature components; and
sorting the plurality of signature components into an indexed hash chain list according to the respective hash chain message length of each signature component in the plurality of signature components.

### Claim 18 (depends on 17)

The non-transitory computer-readable medium of claim 17, wherein the hash-based signature scheme utilizes a plurality of hash engines to apply the SHA to the plurality of signature components.

### Claim 19 (depends on 18)

The non-transitory computer-readable medium of claim 18, wherein the instructions configure the processor to perform operations comprising:
assigning the plurality of signature components into a plurality of groups according to their respective chain message lengths, the plurality groups corresponding to the plurality of hash engines; and
assigning the plurality of groups to the plurality of hash engines to be executed contemporaneously.

### Claim 20 (depends on 19)

The non-transitory computer-readable medium of claim 19, wherein the instructions configure the processor to perform operations comprising:
alternating between the signature component having a longest chain message length and a signature component having a shortest chain message length to assign the plurality of signature components into the corresponding plurality of groups.

### Claim 21 (depends on 15)

The non-transitory computer-readable medium of claim 15, wherein the hash-based signature scheme comprises an XMSS signature scheme.
