Bidirectional Hashing for Collision-Resistant Blockchain Signatures
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing blockchain technologies face vulnerabilities due to collisions in hash algorithms like MD5 and SHA-1, which can be exploited for cryptographic security breaches, as they allow different data sets to produce the same hash digest, compromising data integrity.
Innovation Solution
Implementing a collision-resistant blockchain by using known hash algorithms in a bidirectional manner, where data is hashed both front-to-back and back-to-front, generating a forward blockchain hash digest and a reverse blockchain hash digest, which are combined to form a collision-resistant hash digest pair, thereby reducing the occurrence of collisions and enhancing security.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional hash algorithms (MD5, SHA-1) are used to generate hash digests for blockchain, then the hashing process is computationally efficient and fast, but collisions occur where different data sets produce the same hash digest, compromising cryptographic security
Solution Approach 1:
The patent segments the hashing process into two independent directional components: forward hashing (front-to-back) and reverse hashing (back-to-front). Each direction produces a separate hash digest, and both must match for a collision to occur. This segmentation transforms a single vulnerable hashing operation into a multi-component system where collisions become exponentially less likely, as demonstrated by the MD5 collision examples in the patent where forward-hash collisions do not result in reverse-hash collisions.
Solution Approach 2:
The patent adds a dimensional aspect to traditional hashing by introducing bidirectional processing. Instead of a single-dimensional hash digest, the system produces a multi-dimensional hash signature comprising forward hash digest, reverse hash digest, and their combination. This dimensional expansion from scalar to vector output increases the solution space and makes collision attacks computationally infeasible while maintaining compatibility with existing hash algorithms.
2Reliability
If hash digest length is increased to reduce collisions, then collision resistance improves, but computational overhead and processing time increase
Solution Approach 1:
The patent divides the hashing workload into parallel forward and reverse processing streams that can be executed simultaneously. Each stream uses standard-length hash digests (e.g., 128-bit for MD5, 256-bit for SHA-256), maintaining fast processing speeds. The segmentation allows modern multi-core processors to handle both directions concurrently, achieving collision resistance equivalent to longer single-direction hashes without the proportional time penalty.
Solution Approach 2:
The patent performs preliminary forward hashing during the normal blockchain transaction processing flow, and then performs reverse hashing on the already-hashed data rather than on the original data. This preliminary action optimizes processing time by working with already-processed data structures, reducing the overall computational burden while maintaining security.
Data Source
AI summary
The present specification discloses a computer tangible medium storing instructions for a collision resistant process for signing a digital message with a digital signature using different hash digests derived from the same message data with the same hashing algorithm by hashing the message data in different ways. The collision resistant process protects networks from hacking attacks based different files having the same hash digest, commonly referred to as birthday attacks.