Data Compression Authentication Using Check-Sums and Collision Detection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing data compression methods face challenges in representing longer digital data codes in shorter codes while ensuring recoverability, and they struggle with differentiating additional information from original data entries, especially when re-compression is involved.
Innovation Solution
The method employs a computer-implemented technique that uses counting and expressing techniques, check-sum generation, collision detection, and data authentication to enable lossless compression and decompression of digital information, regardless of its distribution pattern or type.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If data compression is applied to represent longer digital data codes in shorter codes, then data storage efficiency is improved, but data recoverability becomes difficult to ensure
Solution Approach 1:
The patent applies preliminary action by generating check-sums and authentication data before the compression process. The original data is processed to create cryptographic hash values and authentication tags that are stored alongside the compressed data. This preliminary preparation ensures that when decompression occurs, the authenticity and integrity of the recovered data can be verified without compromising the compression ratio achieved.
Solution Approach 2:
The patent introduces check-sums and authentication data as intermediary elements between the original data and the compressed representation. These intermediaries serve as mediators that carry verification information through the compression and storage process, enabling reliable data recovery and authentication without requiring the full original data to be preserved in its uncompressed form.
2Reliability
If additional information is added to compressed data to enable recovery, then data recoverability is improved, but compression efficiency deteriorates
Solution Approach 1:
The patent applies parameter changes by utilizing cryptographic hash functions that transform variable-length input data into fixed-length hash values. This parameter transformation allows the verification data to maintain a consistent, compact size regardless of the original data length, thereby minimizing the overhead added to the compressed representation while ensuring robust data recoverability and authentication.
3Productivity
If conventional compression methods are used without data authentication, then compression speed is improved, but data integrity cannot be verified
Solution Approach 1:
The patent applies the taking out principle by separating the authentication function from the compression process. The compression algorithm itself remains unchanged and operates at full speed, while the authentication data is extracted and generated as a distinct process. This separation allows the compression operation to maintain its original performance characteristics while adding verification capability through the appended authentication tags and check-sums.
Data Source
AI summary
Methods and techniques for processing digital data whether random or not, within the scope of processing designed, through encoding and decoding losslessly and correctly for purposes of compression/decompression or both, using counted information and check-sum(s) with or without check-sum index or indices. A method includes encoding digital information composed of binary bits made up of one or both of bit 1 and bit 0, using header indicators, size of digital information under processing, one or more check-sums with or without check-sum index or indices where and when appropriate for data identification and authentication.