Multi-Checksum Data Compression for Collision-Resistant Recovery
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current data compression methods are limited by the amount of redundancy that can be removed, and existing checksum algorithms face issues with collisions, which affect the uniqueness and efficiency of data compression and integrity verification.
Innovation Solution
The system employs multiple checksum algorithms to generate unique checksum values for data blocks, utilizing processors to create and store data entries with attributes in a computer-readable medium, and uses XML or other markup languages to describe compressed files, enabling improved compression and security through mutual exclusion and variable length hashes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If statistical compression methods are used to remove redundancy, then file size is reduced, but compression capacity is limited by the amount of redundancy available
Solution Approach 1:
The patent changes the fundamental parameter from statistical redundancy to cryptographic uniqueness by using hash functions. Instead of compressing based on frequent pattern reduction, the system generates unique checksums for each data block, enabling compression beyond traditional redundancy limits by leveraging the mathematical properties of hash functions to represent data uniquely.
Solution Approach 2:
The patent replaces the mechanical/statistical compression system with a cryptographic system. Rather than using statistical analysis and redundancy removal, the invention uses hash function generation and verification to achieve compression, substituting the entire compression mechanism with a mathematically different approach based on cryptographic principles.
2Reliability
If traditional checksum algorithms (MD5, SHA) are used for data verification, then data integrity is ensured, but collisions occur reducing uniqueness
Solution Approach 1:
The patent combines multiple hash function algorithms (MD5, SHA-1, SHA-256, etc.) into a composite verification system. By using multiple different hash functions simultaneously, the system maintains data integrity verification while significantly reducing collision probability, as the composite checksum requires all individual hash functions to produce matching results.
Solution Approach 2:
The patent segments the verification process into multiple independent hash function evaluations. Instead of relying on a single checksum algorithm, the system divides verification into multiple stages, each using a different hash function, thereby distributing the uniqueness requirement across multiple mathematical transformations and reducing overall collision risk.
3Measurement precision
If multiple checksum algorithms are used to minimize collisions, then uniqueness is improved, but computational complexity increases
Solution Approach 1:
The patent performs preliminary hashing operations during the compression phase, generating multiple checksums in advance and storing them with the compressed data. This preliminary action eliminates the need for complex real-time verification computations, as the heavy lifting of multiple hash generations is completed during compression rather than during verification or decompression.
Solution Approach 2:
The patent creates copies of the data through multiple hash function transformations, generating parallel checksum representations. These copied checksums are stored alongside the original compressed data, allowing verification to proceed by simple comparison rather than re-computation, thereby reducing the computational complexity of the verification process.
Data Source
AI summary
In one aspect, the present invention comprises one or more processors that generate a first checksum value for a data block and a second checksum value for the data block, wherein the first checksum value is generated by applying a first checksum algorithm to the data block and the second checksum value is generated by applying a second checksum algorithm, different from the first checksum algorithm, to the data block; one or more processors operable to create a data entry comprising data identifying: the first and second checksum values, the first and second checksum algorithms, and at least one of the identified attributes of the data block, the data entry not comprising the data block, and wherein the data block can be recovered using the data entry; and one or more processors that store the data entry in a computer-readable medium. Other aspects comprise related systems, methods, and software.