Secure Compression Algorithm Merging Encryption and Data Reduction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current methods require separate operations for compressing and encrypting data, which are resource-intensive, especially when dealing with large amounts of data, and do not efficiently utilize computational resources.
Innovation Solution
Implementing secure compression algorithms that perform both compression and encryption as a single operation by randomizing dictionary table entries using deterministic pseudo-random generators or functions, allowing for decryption of securely compressed files with the same key used for encryption.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If separate operations are used for compressing and encrypting data, then data security and compression are achieved, but computational resource usage increases significantly
Solution Approach 1:
The patent combines compression and encryption into a single integrated operation called secure compression. The system processes data through one unified algorithm that simultaneously achieves both compression ratios and encryption security, eliminating the need for separate compression and encryption passes. This merging reduces computational overhead and resource consumption while maintaining both security and compression effectiveness.
Solution Approach 2:
The secure compression algorithm serves multiple functions simultaneously: it compresses data to reduce size, encrypts data to ensure security, and produces a single output stream that combines both functions. This multi-functional approach allows the system to achieve compression, encryption, and decryption in a single operation rather than requiring separate specialized operations for each function.
2Reliability
If separate operations are used for compressing and encrypting data, then data security and compression are achieved, but processing time increases
Solution Approach 1:
The patent merges compression and encryption into a single processing pass. The secure compression algorithm processes data through one unified operation that simultaneously achieves both compression and encryption, eliminating the sequential execution of separate compression and encryption operations. This reduces processing time by avoiding multiple passes over the data.
Solution Approach 2:
The system performs preliminary setup of cryptographic keys and parameters before the main processing operation. The deterministic pseudo-random generator is initialized with a key in advance, allowing the secure compression to proceed efficiently without requiring separate key setup or initialization steps during the actual compression-encryption process.
3Ease of operation
If deterministic pseudo-random generators are used for randomization, then decryption is enabled with the same key, but predictability increases
Solution Approach 1:
The system changes the parameter of randomness from being purely stochastic to being deterministic based on a cryptographic key. The pseudo-random generator uses the key as a seed, transforming the randomness parameter into a key-dependent deterministic sequence. This allows the same key to reproduce the exact same randomization pattern for decryption, while the complexity of the pseudo-random function maintains security against prediction.
Data Source
AI summary
In embodiments, secure compression algorithms are provided that may be employed as a single operation on raw data to produce compressed and encrypted data. In embodiments, the algorithms described herein may be performed using any type of dictionary based encryption. In one embodiment, upon adding a new prefix to a dictionary table, the dictionary table may be permuted to randomize the entries into the table. The randomization may be based upon a permutation value generated by a deterministic pseudo-random generator and/or pseudo-random function. Other embodiments of randomization may be employed to provide secure compression. For example, instead of permuting the entire table upon adding a prefix, the prefix may be randomly added to the table.