Encrypted Logical Data Objects with Chunk Mapping for Efficient Storage
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current storage technologies face challenges in securely and efficiently compressing and encrypting logical data objects while maintaining data accessibility and manageability, as existing solutions often compromise on security or performance.
Innovation Solution
A method and system that encrypt logical data objects by breaking them into chunks, processing each chunk into fixed-size segments, and encrypting them using a secure key with an initialization vector, while maintaining a mapping index for efficient storage and retrieval, allowing for compression and encryption in a way that preserves data integrity and accessibility.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If data is compressed and encrypted for storage, then storage capacity is minimized and transmission time is reduced, but data accessibility and manageability are compromised
Solution Approach 1:
The patent divides data into fixed-size segments or blocks before compression and encryption. Each segment is independently processed, which maintains manageability while enabling compression. The segmentation allows the system to handle data in manageable units that can be efficiently stored and retrieved without compromising overall accessibility.
Solution Approach 2:
The patent introduces mapping indexes as an intermediary structure that bridges encrypted/compressed data and original data locations. These indexes store metadata about data segments including their encrypted forms, locations, and retrieval information, enabling efficient data accessibility without requiring decryption of entire data sets.
2Reliability
If encryption is applied to logical data objects, then data security is enhanced, but processing complexity and time increase
Solution Approach 1:
The patent applies encryption to individual data segments rather than entire data objects. This segmentation reduces processing complexity by allowing parallel encryption operations on smaller units and enabling selective encryption of only necessary portions of data while maintaining security through cryptographic transformation of each segment.
Solution Approach 2:
The patent performs compression before encryption in a predetermined sequence. This preliminary compression reduces the volume of data that subsequently requires encryption processing, thereby reducing the overall computational complexity and time required for the encryption operation while maintaining security standards.
3Quantity of substance
If data is transformed into fixed-size segments, then storage efficiency is improved, but data integrity management becomes more complex
Solution Approach 1:
The patent incorporates mapping indexes that provide feedback mechanisms tracking the location, status, and integrity of each fixed-size data segment. These indexes maintain metadata about original data positions and encrypted segment locations, enabling verification of data integrity through cross-referencing without requiring complex verification protocols for each segment.
Data Source
AI summary
Systems and methods for encrypting a plaintext logical data object for storage in a storage device operable with at least one storage protocol, creating, reading, writing, optimization and restoring thereof. Encrypting the plaintext logical data object comprises creating in the storage device an encrypted logical data object comprising a header and one or more allocated encrypted sections with predefined size; encrypting one or more sequentially obtained chunks of plaintext data corresponding to the plaintext logical data object thus giving rise to the encrypted data chunks; and sequentially accommodating the processed data chunks into said encrypted sections in accordance with an order said chunks received, wherein said encrypted sections serve as atomic elements of encryption/decryption operations during input/output transactions on the logical data object.