Bidirectional Hash Digests for Blockchain 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 a forward and a reverse blockchain hash digest for each data set, using hash algorithms like MD5, SHA-1, SHA-224, SHA-256, SHA-384, SHA-512, and SHA-3, where the reverse hash digest is produced by reversing the data in hexadecimal, byte, bit, or sector order, and combining these to form a total digest that significantly reduces collision occurrence.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a single hash digest is used to identify data sets, then the hashing process is simple and fast, but collisions occur more frequently compromising security
Solution Approach 1:
The patent segments the single hash digest into two separate hash digests: a forward hash digest (hashing data from beginning to end) and a reverse hash digest (hashing data from end to beginning). This segmentation allows the system to maintain simplicity in each individual hashing operation while significantly improving collision resistance through the combination of both digests.
Solution Approach 2:
The patent introduces a new dimension to the hashing process by adding the reverse hashing direction. Instead of processing data in a single forward direction, the system processes data in both forward and reverse directions, creating a two-dimensional hashing approach that dramatically reduces collision probability without requiring more complex cryptographic algorithms.
2Reliability
If traditional single-direction hashing is used, then processing time is minimal, but security vulnerabilities exist due to collision exploits
Solution Approach 1:
The patent divides the security verification process into two independent hashing operations (forward and reverse). By segmenting the security check into these two simpler operations, the system achieves stronger overall security without requiring a single complex hashing algorithm that would consume excessive processing time.
Solution Approach 2:
The patent merges the results of two separate hashing operations (forward hash digest and reverse hash digest) into a combined security verification process. This merging approach allows the system to leverage the strengths of both hashing directions, creating a more robust security mechanism that remains efficient since both operations can be performed in parallel.
3Reliability
If hash digest length is increased to reduce collisions, then collision resistance improves, but computational overhead increases
Solution Approach 1:
Instead of using a single long hash digest that requires extensive computational resources, the patent segments the security verification into two separate hash digest operations. Each individual hash digest maintains a standard length, but their combination provides the equivalent security of a much longer single digest while consuming less computational energy.
Data Source
AI summary
The present specification discloses systems, methods, and a computer tangible medium storing instructions for a collision resistant process for thwarting birthday attacks. A birthday attack is a type of cryptographic attack that exploits mathematical collisions that result when different messages are hashed by a hash algorithm, but produce the same hash digest, which can render computer security systems vulnerable to hacking. By hashing files in different orders with the same hash algorithm, the systems, methods, and mediums disclosed herein can distinguish between identical files and different files that produce a collision when hashed in one order as the collision is not replicated when those different files are hashed in a different order as they are when the files are the same.