Bidirectional Hash Digest Collision Resistance
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing blockchain hash algorithms, such as MD5 and SHA-1, suffer from collisions, which compromise cryptographic security by allowing different data sets to produce the same hash digest, making them vulnerable to exploitation.
Innovation Solution
A collision-resistant blockchain is created by generating both forward and reverse hash digests for each data set using known hash algorithms like MD5, SHA-1, SHA-224, SHA-256, SHA-384, SHA-512, and SHA-3, where the forward hash digest is produced by hashing data from front-to-back and the reverse hash digest from back-to-front, and both are combined to form a total digest, significantly reducing the occurrence of collisions.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional hash algorithms (MD5, SHA-1) are used for blockchain, then processing speed is maintained, but collision vulnerability increases
Solution Approach 1:
The patent segments the hashing process into two independent directional components: forward hashing (original data sequence) and reverse hashing (reversed data sequence). Each direction produces a separate hash digest, and both are stored together. This segmentation allows the system to maintain compatibility with traditional hash algorithms while significantly reducing collision vulnerability, as an attacker would need to find collisions in both directions simultaneously.
Solution Approach 2:
The patent applies inversion by processing the same data in reverse order to generate an additional hash digest. Instead of only hashing data from beginning to end, the system also hashes the reversed data sequence. This inverted approach creates a second layer of security where collisions would need to occur in both the forward and reverse directions, effectively doubling the collision resistance without requiring new hash algorithms.
2Reliability
If bidirectional hashing is implemented, then collision resistance is improved, but computing time increases
Solution Approach 1:
The patent applies preliminary action by reversing the data sequence before hashing in the reverse direction. Rather than attempting to find collisions after they occur, the system proactively prevents collisions by ensuring data is processed in both forward and reverse directions during the initial hashing phase. This preliminary bidirectional processing eliminates the need for subsequent collision detection and resolution, saving time in the long run.
3Measurement precision
If multiple hash digests are stored, then data uniqueness is verified more accurately, but storage requirements increase
Solution Approach 1:
The patent uses copying by creating a reverse copy of the data sequence and hashing it separately. Instead of storing multiple independent hash digests of the original data, the system creates a mirrored copy of the data in reverse order and generates a hash from that copy. This copying approach provides enhanced collision resistance while maintaining a straightforward storage structure, as the reverse copy is as compact as the original data representation.
Data Source
AI summary
A data deduplication process for storage based on collision resistant hash digests is disclosed. The process accesses a first data message from a data storage appliance and accesses a second data message from the data storage appliance. The process then compares the hash digests of the first and second data messages. If the hash digests match, the process determines if the first and second data messages are the same message or if there is a collision between the compared hash digests by forming additional hash digests based on the first and second data messages by hashing the first and second data messages differently. If this new set of hash digests do not result in a collision, then the first and second data messages are different. If this new set of hash digests result in a collision, the first and second data messages are the same message.