FAST XMSS SIGNATURE VERIFICATION AND NONCE SAMPLING PROCESS WITHOUT SIGNATURE EXPANSION

• US 20190319800A1
• Filed: 06/28/2019
• Published: 10/17/2019
• Est. Priority Date: 06/28/2019
• Status: Active Grant

• Current Assignee: Intel Corporation
• Original Assignee: Intel Corporation
• Inventors: MISOCZKI, RAFAEL, SURESH, VIKRAM, WHEELER, DAVID, GHOSH, SANTOSH, SASTRY, MANOJJ
• Granted Patent: US 11,575,521 B2
• Time in Patent Office: Days
• CPC Class Codes: H04L 9/0643 Hash functions, e.g. MD5, SHA, HMAC or f9 MAC
• CPC Class Codes: H04L 9/0662 with particular pseudorandom sequence generator
• CPC Class Codes: H04L 9/3239 involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD
• CPC Class Codes: H04L 9/3247 involving digital signatures

Abstract

In one example an apparatus comprises accelerator logic to pre-compute at least a portion of a message representative, hash logic to generate the message representative based on an input message, and signature logic to generate a signature to be transmitted in association with the message representative, the signature logic to apply a hash-based signature scheme to a private key to generate the signature comprising a public key, and determine whether the message representative satisfies a target threshold allocation of computational costs between a cost to generate the signature and a cost to verify the signature. Other examples may be described.

Claims

1. An apparatus, comprising:

accelerator logic to pre-compute at least a portion of a message representative;

hash logic to generate the message representative based on an input message; and

signature logic to;

generate a signature to be transmitted in association with the message representative, the signature logic to apply a hash-based signature scheme to a private key to generate the signature comprising a public key; and

determine whether the message representative satisfies a target threshold allocation of computational costs between a cost to generate the signature and a cost to verify the signature.

2. The apparatus of claim 1, the hash logic to:

compute the message representative of the input message using a Winterniz One Time Signature (WOTS) scheme that invokes a secure hash algorithm (SHA) hash function.

3. The apparatus of claim 2, the hash logic to:

generate a first random nonce; and

generate an extended Merkel signature scheme (XMSS) parameter, r, using the first random nonce as a portion of an input to a SHA function.

4. The apparatus of claim 3, the hash logic to:

generate the message representative based at least in part on the XMSS parameter r.

5. The apparatus of claim 4, the accelerator logic to:

precompute a first intermediate hash value based on a predetermined input sequence, a buffer input, and an index input; and

store the first intermediate hash value in a computer-readable memory.

6. The apparatus of claim 5, the accelerator logic to:

precompute a second intermediate hash value based on the predetermined input sequence input and the buffer input; and

store the second intermediate hash value in the computer-readable memory.

7. The apparatus of claim 6, the signature logic to:

use at least one of the first intermediate value or the second intermediate hash value to generate the signature.

8. A computer-implemented method, comprising:

pre-computing at least a portion of a message representative;

generating the message representative based on an input message;

generating a signature to be transmitted in association with the message representative, the signature logic to apply a hash-based signature scheme to a private key to generate the signature comprising a public key; and

determining whether the message representative satisfies a target threshold allocation of computational costs between a cost to generate the signature and a cost to verify the signature.

9. The method of claim 8, further comprising:

computing the message representative of the input message using a Winterniz One Time Signature (WOTS) scheme that invokes a secure hash algorithm (SHA) hash function.

10. The method of claim 9, further comprising:

generating a first random nonce; and

generating an extended Merkel signature scheme (XMSS) parameter, r, using the first random nonce as a portion of an input to a SHA function.

11. The method of claim 10, further comprising:

generating the message representative based at least in part on the XMSS parameter r.

12. The method of claim 11, further comprising:

precomputing a first intermediate hash value based on a predetermined input sequence, a buffer input, and an index input; and

storing the first intermediate hash value in a computer-readable memory.

14. The method of claim 12, further comprising:

using at least one of the first intermediate value or the second intermediate hash value to generate the signature.

15. A non-transitory computer-readable medium comprising instructions which, when executed by a processor, configure the processor to perform operations, comprising:

pre-computing at least a portion of a message representative;

generating the message representative based on an input message;

generating a signature to be transmitted in association with the message representative, the signature logic to apply a hash-based signature scheme to a private key to generate the signature comprising a public key; and

determining whether the message representative satisfies a target threshold allocation of computational costs between a cost to generate the signature and a cost to verify the signature

13. The method of claim 15, further comprising:

precomputing a second intermediate hash value based on the predetermined input sequence and the buffer input; and

storing the second intermediate hash value in the computer-readable memory.

16. The non-transitory computer-readable medium of claim 15, further comprising instructions which, when executed by the processor, configure the processor to perform operations, comprising:

computing the message representative of the input message using a Winterniz One Time Signature (WOTS) scheme that invokes a secure hash algorithm (SHA) hash function.

17. The non-transitory computer-readable medium of claim 16, further comprising instructions which, when executed by the processor, configure the processor to perform operations, comprising:

precomputing a third intermediate hash value based on a portion of an address input; and

applying the third intermediate hash value to the SHA hash function in the series of SHA hash operations in the L-Tree operation.

18. The non-transitory computer-readable medium of claim 17, further comprising instructions which, when executed by the processor, configure the processor to perform operations, comprising:

generating the message representative based at least in part on the XMSS parameter r.

19. The non-transitory computer-readable medium of claim 18, further comprising instructions which, when executed by the processor, configure the processor to perform operations, comprising:

precomputing a first intermediate hash value based on a predetermined input sequence, a buffer input, and an index input; and

storing the first intermediate hash value in a computer-readable memory.

20. The non-transitory computer-readable medium of claim 19, further comprising instructions which, when executed by the processor, configure the processor to perform operations, comprising:

precomputing a second intermediate hash value based on the predetermined input sequence and the buffer input; and

storing the second intermediate hash value in the computer-readable memory.

21. The non-transitory computer-readable medium of claim 20, further comprising instructions which, when executed by the processor, configure the processor to perform operations, comprising:

using at least one of the first intermediate value or the second intermediate hash value to generate the signature.