Varying Sized Symbol Sets for Brute Force Resistance
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current symmetric cryptography techniques are susceptible to brute force attacks due to their reliance on fixed-sized symbol sets, which can be exploited by attackers to decrypt encrypted data.
Innovation Solution
Implementing varying sized symbol sets for encryption and decryption, where metadata defining the symbol sets is generated and allocated along with the symmetric key, adding complexity by subdividing data blocks into subblocks of different sizes and sequences, making it difficult for attackers to determine the correct key and symbol sets used.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If fixed-sized symbol sets are used for encryption, then the encryption process is simple and efficient, but the system is vulnerable to brute force attacks
Solution Approach 1:
The patent divides the encryption process into multiple stages, each using different symbol sets of varying sizes. Data is processed through sequential encryption rounds where each round applies a different symbol set configuration, breaking the monolithic encryption process into manageable segments that collectively enhance security
Solution Approach 2:
The patent introduces dynamic variation in symbol set sizes across different encryption rounds. Instead of using a static symbol set, the system dynamically changes the symbol set configuration for each encryption operation, making brute force attacks significantly more difficult while maintaining operational efficiency
2Object-affected harmful factors
If varying sized symbol sets are implemented, then brute force attack resistance increases, but the encryption and decryption process becomes more complex
Solution Approach 1:
The patent changes the parameters of the encryption process by varying the symbol set sizes across different encryption rounds. Each round uses differently sized symbol sets (e.g., 2^8, 2^16, 2^32), transforming the encryption from a single-parameter operation to a multi-parameter process that resists brute force attacks
Solution Approach 2:
The patent implements periodic encryption rounds where different symbol set configurations are applied in a repeating sequence. This periodic variation creates a rhythm of complexity that maintains security while allowing the system to return to known states, facilitating efficient decryption when the correct key is used
3Reliability
If multiple symbol sets of varying sizes are used, then security is enhanced, but the time required for encryption and decryption increases
Solution Approach 1:
The patent performs preliminary setup of multiple symbol sets in advance, storing them in readily accessible memory. This preliminary preparation allows the encryption process to quickly switch between different symbol sets during execution without incurring significant overhead, reducing the time penalty associated with using varying sized symbol sets
Data Source
AI summary
Disclosed are systems, methods, and non-transitory computer-readable media for cryptography using different sized symbol sets. To protect against a brute force or other similar type of attack, multiple symbol sets having different sizes can be used for encrypting/decrypting data. For example, different portions of the data (e.g., data blocks representing multiple symbols, set of bits representing a single symbol) may be encrypted/decrypted using different symbol sets that include different numbers of unique symbols. Using different sized symbol sets adds additional complexity to the encryption process, thereby greatly increasing the difficulty in decrypting the encrypted data with a brute force attack.