Wide-Block Encryption for Data Deduplication
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional data deduplication methods face challenges due to the compute-intensive process of calculating cryptographic hash values, which either increases costs with dedicated hardware or reduces system efficiency by consuming significant processing overhead in existing compute components.
Innovation Solution
The method involves compressing data and using wide-block encryption to create a ciphertext string, where a predetermined subset of the encrypted data is used for deduplication, thereby avoiding the need for hash value calculations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If cryptographic hash values are used for data deduplication, then data integrity is maintained, but computational overhead increases significantly
Solution Approach 1:
The patent segments the encrypted data into fixed-size chunks and uses only a predetermined subset (e.g., first 16 bytes) of each chunk for deduplication comparison. This segmentation approach allows the system to maintain data integrity through encryption while reducing the computational overhead by comparing only portions of the encrypted data rather than processing entire datasets or computing hash values.
2Productivity
If dedicated hardware is used to calculate hash values, then deduplication performance improves, but implementation costs increase significantly
Solution Approach 1:
The patent makes the encryption component perform multiple functions: it encrypts data for security and simultaneously enables deduplication by using subsets of the encrypted data for comparison. This multi-functionality eliminates the need for dedicated hash calculation hardware, improving deduplication performance while avoiding increased implementation costs.
3Ease of manufacture
If hash value calculations are performed in existing compute components, then implementation cost is avoided, but system efficiency decreases significantly
Solution Approach 1:
The encryption component serves itself by generating encrypted data that inherently contains information usable for deduplication. The predetermined subset of encrypted data acts as a self-generated identifier that enables deduplication without requiring separate hash calculation processes, thereby maintaining system efficiency while avoiding additional implementation costs.
4Volume of stationary object
If compression is applied to data before storage, then storage capacity is improved, but data size variability increases
Solution Approach 1:
The patent changes the parameter of data representation by encrypting compressed data with wide-block encryption. This transformation produces ciphertext of consistent size regardless of the original compressed data size, thereby maintaining storage capacity improvements from compression while eliminating data size variability. The encryption process standardizes the output size to match the block size.
Data Source
AI summary
A computer-implemented method, according to one embodiment, includes: compressing an uncompressed instance of data to create a compressed instance of data. In response to determining that a size of the compressed instance of data is outside a predetermined range, the uncompressed instance of the data is encrypted utilizing wide-block encryption to create a ciphertext string. Moreover, a predetermined subset of the encrypted uncompressed instance of data in the ciphertext string is used to perform deduplication at a data storage server.


