Unified Data Compression and Encryption via Hash Table

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current data security and privacy solutions require separate processes for data compression and encryption, which increase system complexity, points of failure, and operational costs, while also not efficiently reducing data size for transmission and storage.

Innovation Solution

A method and system that combine data compression and encryption into a single process using a hash table generated from an encryption key, where the encryption key is used to create hash table keys and index values, allowing for simultaneous compression and encryption of input data.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If separate processes are used for data compression and encryption, then data can be compressed and encrypted, but system complexity increases and points of failure increase

Engineering Contradiction:
Improvesystem reliabilityVSAvoidsystem complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent combines compression and encryption into a single unified process by integrating the encryption key generation into the compression algorithm itself. The hash table used for compression is populated using hash functions derived from the encryption key, so that compression operations simultaneously perform encryption functions, eliminating the need for separate processing stages.

Inventive Principle:
Principle #5Merging (Combining)

Solution Approach 2:

The compression algorithm is designed to serve multiple functions: it compresses data by identifying patterns and replacing them with shorter codes, while simultaneously encrypting the data by using encryption keys to generate the hash table and modify the compression codes. This multi-functional approach reduces system complexity while maintaining both compression and security capabilities.

Inventive Principle:
Principle #6Universality (Multi-functionality)

2Reliability

If separate processes are used for data compression and encryption, then data can be compressed and encrypted, but operational costs increase

Engineering Contradiction:
Improvedata securityVSAvoidoperational cost
Core Design Contradiction:
ReliabilityVSEase of manufacture

Solution Approach 1:

By merging compression and encryption into one process, the patent eliminates the operational overhead of running two separate systems, maintaining two separate key management infrastructures, and coordinating between two processes. This single unified approach reduces computational resources, energy consumption, and operational complexity while maintaining both compression efficiency and security.

Inventive Principle:
Principle #5Merging (Combining)

3Reliability

If separate processes are used for data compression and encryption, then data can be compressed and encrypted, but data transmission and storage efficiency decreases

Engineering Contradiction:
Improvedata protectionVSAvoiddata size
Core Design Contradiction:
ReliabilityVSQuantity of substance

Solution Approach 1:

The patent performs compression first by identifying patterns and replacing them with shorter codes using the hash table, then applies encryption modifications to the already-compressed data. This preliminary compression reduces the data size before encryption is applied, meaning the encryption process operates on smaller data, resulting in more efficient transmission and storage while maintaining full security protection.

Inventive Principle:
Principle #10Preliminary action

Data Source

PatentUS11533173B2Systems and methods for compression and encryption of data
Publication Date: 2022.12.20 LOGNOVATIONS HOLDINGS LLC
  • US11533173B2 patent drawing
  • US11533173B2 patent drawing
  • US11533173B2 patent drawing

AI summary

A system and method for compression and encryption of data includes creating a plurality of hash table keys by applying a bit mask to an encryption key, applying a hashing function to the encryption key, creating a hash table using the hashing function, the hash table including the plurality of hash table keys and index values, the index values each identifying a location of data in the hash table connected to one of the plurality of hash table keys, receiving input data, and encoding the input data to generate encoded data, the encoding including both compression and encryption of the input data using the encryption key and the hash table.