Hash-Based PQC Verification Timing for Consistent Secure Boot
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Hash-based post-quantum cryptography (PQC) algorithms experience variable verification times due to varying input data, which can affect the quality of service (QoS) in secure boot processes, particularly in terms of boot time.
Innovation Solution
A verification method and apparatus that generate random nonces to bind with signing data, calculate signatures using a hash-based PQC algorithm, and determine verification times to ensure they meet quality of service (QoS) conditions, adjusting if necessary by generating new nonces until the desired time is achieved.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If hash-based PQC algorithm is used for secure boot verification, then security against quantum computer attacks is improved, but verification time becomes variable and may exceed QoS requirements
Solution Approach 1:
The patent applies preliminary action by pre-calculating and storing multiple candidate signatures corresponding to different random nonces before the actual verification process. During verification, the system selects from these pre-computed candidates rather than performing full PQC verification from scratch, thereby reducing verification time while maintaining security against quantum attacks
Solution Approach 2:
The patent implements dynamics by making the verification process adaptive - the system dynamically selects which pre-computed signature to use based on the specific verification context and QoS requirements. This allows the system to adjust verification behavior based on real-time conditions, balancing security and performance
2Reliability
If random nonce is generated and bound to signing data for each verification, then verification reliability is improved, but verification time increases due to additional computational steps
Solution Approach 1:
The patent applies preliminary action by pre-generating multiple random nonces and their corresponding signatures in advance, storing them in a lookup structure. During actual verification, the system retrieves the appropriate pre-computed signature based on the data being verified, eliminating the need for time-consuming real-time nonce generation and signature computation while maintaining verification reliability
Solution Approach 2:
The patent uses copying by creating multiple copies of the verification process with different random nonces in advance. Instead of performing the full verification algorithm once with a single nonce, the system pre-computes multiple variant signatures that can be quickly retrieved and applied as needed, reducing computational overhead
3Productivity
If multiple random nonces are generated until QoS condition is met, then QoS requirement is satisfied, but device complexity increases due to iterative verification process
Solution Approach 1:
The patent applies preliminary action by pre-computing multiple candidate signatures with different random nonces and storing them in an organized data structure before the verification process begins. This eliminates the need for iterative generation and verification loops during actual boot time, reducing both complexity and time required while ensuring QoS requirements are met
Solution Approach 2:
The patent implements feedback by establishing clear QoS criteria and validation rules that determine when a pre-computed signature is suitable for use. The system feedback-mechanism evaluates verification results against predefined thresholds and automatically selects appropriate signatures, simplifying the decision-making process and reducing operational complexity
Data Source
AI summary
A verification method is provided. The verification method may be applied to an apparatus. The verification method may include the following steps. The apparatus may generate a first random nonce. Then, the apparatus may bind the first random nonce to the signing data. Then, the apparatus may calculate the first signature according to the hash-based post-quantum cryptography (PQC) algorithm and the signing data bound to the first random nonce to obtain the first verification time. Then, the apparatus may determine whether the first verification time meets the quality of service (QOS) condition. The apparatus may adopt the first signature for a verification process in response to the first verification time meeting the QoS condition.