Concurrent Data Compression with Frequency Vector Encryption
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current data compression and encryption methods require separate processes, leading to increased computational resources and latency, especially in real-time transmission of multimedia content.
Innovation Solution
A concurrent encryption and lossless compression system that uses the Burrows-Wheeler Transformation followed by an inversion ranking transformation, and then encrypts only the frequency vector for transmission, reducing computational overhead.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If separate compression and encryption processes are used in sequence, then security and compression efficiency are maintained, but computational resources and latency increase
Solution Approach 1:
The patent merges compression and encryption into a single concurrent process. The Burrows-Wheeler Transformation is applied to compress the data, and simultaneously, a chaotic encryption function is applied to encrypt the transformed data. This concurrent execution eliminates the sequential overhead of traditional CtE or EtC approaches, reducing computational resources and latency while maintaining both compression efficiency and security.
Solution Approach 2:
The patent applies the Burrows-Wheeler Transformation as a preliminary step before encryption. By transforming the data into a more compressible format first, the system enables better compression ratios to be achieved during the concurrent encryption process. The transformation prepares the data structure in advance, making it more amenable to both compression and subsequent encryption operations.
2Reliability
If AES encryption is applied to large files, then security is ensured, but overhead and latency increase
Solution Approach 1:
The patent replaces the traditional AES encryption mechanism with a chaotic encryption system based on chaotic dynamical systems. This substitution allows for parallel and concurrent encryption operations that can be performed more efficiently on large files. The chaotic encryption function operates differently from standard AES, enabling reduced overhead and latency while maintaining cryptographic security through the inherent unpredictability and sensitivity to initial conditions of chaotic systems.
3Productivity
If compression is performed before encryption, then compression efficiency is optimized, but the entire compressed file must be encrypted increasing computational cost
Solution Approach 1:
The patent applies partial encryption action by encrypting the Burrows-Wheeler transformed data concurrently with compression rather than encrypting the entire compressed file afterward. The chaotic encryption function is applied selectively during the compression process itself, encrypting portions of the data as they are transformed. This partial concurrent encryption reduces the total computational cost compared to full post-compression encryption while maintaining security.
Data Source
AI summary
A system and method for concurrent encryption and lossless compression of data with an algorithm executing on a computer platform. The lossless compression component of the algorithm consists of preprocessing the data with a Burrows-Wheeler transformation followed by an inversion ranking transformation in advance of employing an entropy coder, such as binary arithmetic coder. The frequency vector of the Inversion Ranking transformation is then encrypted and transmitted along with the compressed data with only the frequency vector encrypted. Since the frequency vector is required for decompression, no further encryption of the compressed data is necessary to secure the compressed file.