Mixed-Hash Data Verification for Quantum-Resistant Authentication
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing hashing techniques are vulnerable to attacks by quantum computers and can be bypassed easily, leading to potential data substitution and identity verification errors, especially for electronic communications.
Innovation Solution
A method involving mixing a dataset with a randomly generated mixer number using a mixing function, followed by hashing, and comparing the resulting hash with a similarly processed dataset, enhances security by making it improbable for similar data to have the same hash, thereby ensuring data integrity and sender authentication.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional hash functions (MD5, SHA1, SHA256) are used for data verification, then the verification process is simple and fast, but the security is vulnerable to quantum computer attacks and hash collision attacks
Solution Approach 1:
The verification process is segmented into multiple independent steps: mixing data with a mixer number, hashing the mixed data, and comparing the resulting hash with a stored hash. This segmentation allows each step to be optimized independently while collectively providing enhanced security against quantum attacks.
Solution Approach 2:
A mixer number is generated and applied to the data before hashing occurs. This preliminary action transforms the original data into mixed data that is then hashed, creating an additional layer of security that prevents quantum computers from directly attacking the hash function with the original data.
2Reliability
If data is encrypted entirely with a one-time pad key, then the security is maximized, but the key management becomes difficult and the key size must equal the data size
Solution Approach 1:
The security-critical mixer number is extracted and separated from the main data transmission. Only the mixer number (not the entire key) needs to be securely managed and transmitted, while the actual data can be transmitted separately. This extraction reduces key management complexity while maintaining security.
Solution Approach 2:
The approach changes from using a key size equal to data size (one-time pad) to using a small mixer number that is combined with the data. This parameter change in key size, combined with the mixing function, provides comparable security with dramatically reduced key management complexity.
3Productivity
If hash functions are used to verify data integrity, then the verification is fast and efficient, but it is possible to create similar data with the same hash (hash collision)
Solution Approach 1:
The mixer number serves as an intermediary between the original data and the hash function. By mixing the data with this intermediary value before hashing, the system maintains the speed of hash verification while significantly reducing the probability of hash collisions, as the mixer number adds an additional layer of uniqueness to each hashing operation.
Data Source
AI summary
Cryptographic method for verifying data method, implemented by at least one apparatus, for comparing a first dataset and a second dataset, in particular with a view to determining whether these two datasets are identical, this method not requiring the presence of these two datasets in the apparatus, and comprising the following steps: a) mixing a number, called the mixer number, with the first dataset, using a mixing function in order to obtain mixed data, b) hashing the mixed data using a hash function, and c) comparing the hash thus obtained in step b) with a third dataset assumed to be the hash of the second dataset mixed with the same mixer number as that used in step a) and with the same mixing function. The method can be used for broadcasts and transmissions using digital signatures.