Odd Index Precomputation for Post-Quantum Authentication Paths
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing public-key digital signature algorithms such as RSA and ECDSA are not secure against brute-force attacks from quantum computers, necessitating the development of post-quantum cryptography solutions like hash-based signature schemes that are computationally expensive and require acceleration for efficient implementation.
Innovation Solution
The implementation of odd index precomputation for authentication path computation in post-quantum cryptography secure hash-based signature algorithms, specifically for XMSS and LMS schemes, using techniques like Merkle trees and hash chain functions to reduce computational overhead and enhance performance.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If hash-based signature schemes are implemented for post-quantum security, then security against quantum computer attacks is improved, but computational cost and processing time increase
Solution Approach 1:
The patent applies preliminary action by precomputing and storing intermediate node values (specifically odd-indexed intermediate nodes) in the authentication path before they are needed for signature verification. This precomputation stores values that would otherwise need to be computed during the verification process, thereby reducing the computational burden at verification time while maintaining the security properties of hash-based signatures
2Reliability
If authentication path computation is performed without optimization, then security is maintained, but processing speed and performance are reduced
Solution Approach 1:
The patent precomputes odd-indexed intermediate node values and stores them in memory during the signature generation phase. During verification, these precomputed values are retrieved and used directly, eliminating the need to recompute them. This preliminary computation significantly accelerates the authentication path computation speed while preserving the cryptographic security of the scheme
Solution Approach 2:
The patent creates and stores copies of intermediate node values (odd-indexed intermediates) in memory during signature generation. These copied values are then reused during verification without recomputation, reducing the computational workload and improving verification speed while maintaining authentication security
Data Source
AI summary
In one example an apparatus comprises a computer-readable memory, signature logic to compute a message hash of an input message using a secure hash algorithm, process the message hash to generate an array of secret key components for the input message, apply a hash chain function to the array of secret key components to generate an array of signature components, the hash chain function comprising a series of even-index hash chains and a series of odd-index hash chains, wherein the even-index hash chains and the odd-index hash chains generate a plurality of intermediate node values and a one-time public key component between the secret key components and the signature components and store at least some of the intermediate node values in the computer-readable memory for use in one or more subsequent signature operations. Other examples may be described.