Message Index Aware Multi-Hash Accelerator for Post Quantum Cryptography
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, leading to inefficiencies in performance and energy efficiency in hash-based signature schemes such as XMSS and LMS due to conventional SHA2-256 implementations not leveraging constant or shared message blocks during operations.
Innovation Solution
Implementing message index aware multi-hash accelerators that pre-compute partial hash values for common message blocks and use index-aware hash scheduling to optimize hash operations across multiple SHA2-256 hash engines, reducing overall hash operations and improving performance in XMSS and LMS operations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional SHA2-256 implementations are used for hash-based signature schemes, then security against quantum computers is improved, but performance and energy efficiency deteriorate due to redundant hash operations
Solution Approach 1:
The patent pre-computes and stores partial hash values for common message blocks in a lookup table before signature operations. During signing or verification, these pre-computed values are retrieved and reused, eliminating redundant hash computations and significantly improving performance while maintaining security
Solution Approach 2:
The patent merges multiple hash operations into a single unified hash engine that processes multiple message blocks simultaneously. By combining redundant hash computations into one operation and sharing intermediate results across multiple signature components, the system reduces total hash operations and improves productivity
2Reliability
If conventional SHA2-256 implementations are used for hash-based signature schemes, then security against quantum computers is improved, but energy consumption increases due to redundant hash operations
Solution Approach 1:
The patent pre-computes and stores partial hash values for common message blocks in a lookup table before signature operations. During signing or verification, these pre-computed values are retrieved and reused, eliminating redundant hash computations and significantly reducing energy consumption while maintaining security
Solution Approach 2:
The patent identifies and recovers redundant computations across multiple signature components by sharing intermediate hash results. Instead of discarding these intermediate values, the system recovers and reuses them in subsequent operations, reducing total energy consumption
3Productivity
If message index aware multi-hash accelerators are implemented, then performance is improved, but device complexity increases
Solution Approach 1:
The patent segments the hash-based signature scheme into distinct functional components: a message index generation unit that creates indices based on message block positions, a lookup table storage unit for pre-computed values, and a multi-hash engine that processes multiple components in parallel. This segmentation improves performance through specialization while managing complexity through modular design
Solution Approach 2:
The patent introduces a message index as an intermediary that connects message blocks to their corresponding pre-computed hash values in the lookup table. This index mechanism enables efficient retrieval and coordination of shared inputs without requiring complex direct mapping, simplifying the overall system architecture
Data Source
AI summary
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.