Accelerators for Post-Quantum Cryptography Secure Hash-Based Signing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing public-key digital signature algorithms like RSA and ECDSA are not secure against brute-force attacks from quantum computers, necessitating the development of post-quantum cryptography solutions such as XMSS and LMS hash-based signature schemes to protect against quantum attacks.
Innovation Solution
The implementation of accelerators for post-quantum cryptography secure hash-based signature algorithms, specifically for XMSS and LMS schemes, using pre-computation techniques to optimize hash operations and reduce computational complexity, including pre-computing intermediate hash values and using pseudo-random functions to accelerate signature generation and verification processes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional public-key algorithms (RSA, ECDSA) are used for digital signatures, then implementation is simple and widely supported, but security against quantum computer brute-force attacks deteriorates
Solution Approach 1:
The patent applies preliminary action by pre-computing and storing hash values of common strings in a lookup table before actual signature operations. This pre-computation phase prepares cryptographic materials in advance, reducing the computational burden during signature generation and verification when quantum threats are considered, thereby maintaining security without proportionally increasing operational complexity
Solution Approach 2:
The patent changes the parameter approach by switching from traditional public-key algorithms to hash-based algorithms (XMSS, LMS) that use different cryptographic parameters - specifically hash functions and Merkle trees instead of factorization or discrete logarithm problems. This parameter change fundamentally alters the security basis to be resistant to quantum attacks while managing complexity through structured algorithm design
2Reliability
If hash-based signature schemes (XMSS, LMS) are implemented for post-quantum security, then quantum resistance is improved, but computational complexity and processing time increase
Solution Approach 1:
The patent implements preliminary action by pre-computing hash values of frequently used strings and storing them in lookup tables. During signature generation, these pre-computed values are retrieved rather than computing hashes from scratch, significantly reducing the number of cryptographic operations required and thereby improving signature generation speed while maintaining quantum resistance
Solution Approach 2:
The patent applies segmentation by dividing the signature operation into distinct phases: a pre-computation phase where hash values are calculated and stored, and an execution phase where pre-computed values are retrieved and combined. This segmentation separates the computationally intensive hash computations from the signature generation process, improving overall productivity without compromising security
3Productivity
If pre-computation techniques are used to accelerate hash operations, then signature verification efficiency is improved, but memory requirements and pre-computation overhead increase
Solution Approach 1:
The patent applies local quality by creating a lookup table that stores pre-computed hash values for specific local patterns or common strings rather than pre-computing everything globally. This selective pre-computation approach optimizes memory usage by only storing hash values where they provide the most benefit, improving verification efficiency for frequently occurring patterns while minimizing overall memory requirements
Data Source
AI summary
In one example an apparatus comprises a computer readable memory, hash logic to generate a message hash value based on an input message, signature logic to generate a signature to be transmitted in association with the message, the signature logic to apply a hash-based signature scheme to a private key to generate the signature comprising a public key, and accelerator logic to pre-compute at least one set of inputs to the signature logic. Other examples may be described.