Parallel Hashing for Post-Quantum Sphincs+ Signatures
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current digital signature schemes, such as RSA, are vulnerable to quantum computers due to the existence of Shor's algorithm, and there is a need for post-quantum cryptography solutions that are resilient against both quantum and physical attacks, with efficient computation and storage requirements similar to classical counterparts.
Innovation Solution
A method and system for computing digital signatures using two hash computing engines that perform hashing operations in parallel to generate a randomness parameter and a signature, reducing the overall signature generation time by half compared to sequential processes, suitable for large messages and implemented on devices like FPGAs.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If two hashing operations are performed sequentially to generate a digital signature, then the security requirements are met, but the signature generation time is doubled
Solution Approach 1:
The patent divides the signature generation process into two independent parallel hashing operations (first function and second function), each handling one of the required hash computations. This segmentation allows both operations to execute simultaneously rather than sequentially, reducing the total time from 2T to approximately T while maintaining the security requirements of computing both hashes.
2Reliability
If post-quantum cryptography solutions are implemented, then resistance against quantum attacks is achieved, but computation time increases
Solution Approach 1:
The patent segments the computationally intensive post-quantum signature generation into two parallel hashing operations. By executing the first function (generating randomness parameter) and second function (computing message hash) simultaneously using separate hash computing engines, the computation time is reduced while maintaining quantum resistance through the use of hash-based signature schemes.
3Productivity
If two hash computing engines are used in parallel, then signature generation is accelerated, but device complexity increases
Solution Approach 1:
The patent employs two separate hash computing engines (first hash computing engine and second hash computing engine) that operate in parallel to compute the two required hashes simultaneously. This segmentation of computational resources enables signature generation acceleration while keeping each individual engine relatively simple, with the overall system complexity managed through clear functional separation.
Data Source
Figure 1
Figure 2
AI summary
The present relates to a method for computing a signature of a message (M) with a signature computing engine configured to execute a first function and a second function. The signature computing engine comprises a first hash computing engine used for the first function and a second hash computing engine used for the second function. The method comprising the following steps : i) in a first step, the first hash computing engine and the second hash computing engine execute the message (M) simultaneously so that the first function generates a randomness parameter (R) whereas the second function computes a hash of the message (Mhash), and ii) in a second step, the second function uses the randomness parameter (R) and the hash of the message (Mhash) to generate the signature of the message (M). The invention further relates to a system for executing the method according to the invention.