Mutating Entropy Tables for Secure End-to-End Communication
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing security systems that utilize pseudorandom number generators are vulnerable to breaches when the seed value is known, allowing unauthorized access and compromising the security of the system.
Innovation Solution
Utilizing a privately shared table of entropy with morphing capabilities, where each entry is dynamically updated using a predefined hashing algorithm, and distributing a morph agreement to ensure secure encryption and decryption across devices.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If pseudorandom number generators are used for encryption, then encryption can be performed efficiently, but security is compromised when the seed value is known
Solution Approach 1:
The patent uses a table of entropy that is copied and distributed to multiple devices. Each device has a copy of the entropy table, allowing independent encryption operations without requiring continuous access to a central seed source. This copying mechanism enables efficient local encryption while maintaining security through distributed true random numbers.
Solution Approach 2:
The patent transforms the encryption approach by changing from using a single seed parameter to using a table of true random numbers as the encryption parameter. This parameter change fundamentally alters the security model, making it impossible to reproduce the random sequence even if part of the table is compromised, while maintaining efficient encryption through direct use of the random number table.
2Reliability
If a table of entropy is shared between devices, then secure communication is enabled, but the table becomes vulnerable to theft and reverse-engineering
Solution Approach 1:
The patent implements dynamic morphing of the entropy table using a morph agreement (hashing algorithm). The table is not static but continuously transforms into a new version based on a counter or timestamp. This dynamic characteristic prevents reverse-engineering because the table structure changes over time, making it impossible to predict or reproduce future table states even if past versions are compromised.
Solution Approach 2:
The patent prepares multiple versions of the entropy table in advance using the morph agreement. Instead of generating tables on-demand, pre-computed morphed versions are available, allowing rapid switching between table versions. This preliminary preparation enables secure communication while reducing real-time processing requirements and preventing table theft through versioned distribution.
3Reliability
If the entropy table is morphed frequently to prevent reverse-engineering, then security is improved, but real-time processing requirements increase
Solution Approach 1:
The patent pre-computes and stores multiple morphed versions of the entropy table using the morph agreement. Instead of generating new tables in real-time during communication, the system retrieves pre-prepared versions from storage. This preliminary action eliminates real-time processing requirements for table generation while maintaining continuous security through frequent morphing.
Solution Approach 2:
The patent creates copies of the entropy table in various morphed states and stores them for rapid access. These copied versions are distributed to devices in advance, allowing immediate use without real-time computation. The copying mechanism enables secure frequent morphing while eliminating processing delays through pre-computed table versions.
4Reliability
If true random numbers are used instead of pseudorandom numbers, then security is enhanced, but the complexity of the system increases
Solution Approach 1:
The patent distributes copies of the true random number table to multiple devices, allowing each device to perform encryption independently using its local copy. This copying approach eliminates the need for complex centralized random number generation and distribution systems, reducing overall system complexity while maintaining high security through true random numbers.
Solution Approach 2:
The patent segments the true random number table into discrete, manageable versions that can be independently stored and processed. Each segment (table version) can be distributed to individual devices, allowing decentralized encryption operations. This segmentation reduces system complexity by breaking down the complex task of managing large-scale true random number distribution into simpler, manageable units.
Data Source
AI summary
The various implementations described herein include methods and systems for using mutatable privacy tables to secure electronic communications. A first electronic device obtains a first version of a privacy table and applies a predefined hashing algorithm to the first version of the privacy table to generate a second version of the privacy table. The first electronic device obtains a first message for transmission to a second electronic device that (i) has a copy of the first version of the privacy table and (ii) has access to the predefined hashing algorithm. The first electronic device generates a primary key based on the second version of the privacy table. The first electronic device encrypts the first message using the primary key to form an encrypted first message and transmits the encrypted first message and a version identifier for the second version of the privacy table to the second electronic device.