Data Verification Mixing Function Hashing Quantum Security
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current hashing techniques are vulnerable to errors and unauthorized modifications, especially with the advent of quantum computers, as they rely on easily bypassable hash functions and require shared keys for one-time pads, making it difficult to verify the integrity and authenticity of data.
Innovation Solution
A method that mixes a dataset with a mixer number using a mixing function before hashing, making it improbable for similar data to have the same hash, thereby enhancing security and authenticity verification, which can be done without simultaneous presence of both datasets and using randomly generated or physically varying mixer numbers.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional hash functions (MD5, SHA1, SHA256) are used to verify data integrity, then the verification process is simple and efficient, but the security is vulnerable to quantum computers and hash collision attacks
Solution Approach 1:
The verification process is segmented into multiple independent components: a mixer number generation step, a mixing function application step, and a hash function application step. This segmentation allows each component to be optimized independently, using simple functions that are computationally efficient while collectively providing quantum-resistant security through the combination of multiple transformation layers.
Solution Approach 2:
The patent creates a composite verification mechanism by combining a mixer number (random value), a mixing function (bitwise operations), and a hash function. This composite approach integrates multiple simple cryptographic primitives to achieve security levels that resist quantum attacks, without requiring a single complex cryptographic algorithm.
2Reliability
If one-time pads are used to encrypt all data for secure transmission, then the security is theoretically unbreakable, but the key management becomes difficult and requires shared keys of the same length as the data
Solution Approach 1:
The patent extracts only the essential security function from one-time pad encryption by applying the mixing and hashing operations only to the data integrity verification, rather than encrypting the entire data stream. This allows secure verification without the overhead of managing full-length one-time pad keys for all data transmission.
Solution Approach 2:
The patent changes the parameter being protected from the entire data message to a derived hash value. By transforming the data through mixing and hashing operations, the security requirement shifts from protecting large amounts of data to protecting a small hash value, dramatically reducing key management complexity while maintaining verification security.
3Productivity
If hash functions are used to create data fingerprints for verification, then the verification process is fast and uses minimal data, but it is possible to create similar data with the same hash (hash collision)
Solution Approach 1:
The patent applies a preliminary mixing operation using a mixer number and mixing function before the hash function is applied. This preliminary action transforms the input data in a way that is specific to each verification instance, making it computationally infeasible to pre-compute hash collisions. The mixing step acts as a preprocessing layer that defeats attempts to create fraudulent data with matching hashes.
Solution Approach 2:
The mixer number is dynamically generated or selected for each verification operation, making the mixing transformation variable rather than static. This dynamic element ensures that the same input data will produce different mixed outputs at different times, preventing attackers from pre-computing collision data and maintaining authenticity verification even with fast hash functions.
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.