Dynamic Encryption Using Random Seed Keys and Pattern Indicators
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing encryption algorithms, such as DES and AES, consistently encrypt equivalent messages in the same way, making them vulnerable to brute-force attacks and pattern recognition, which can expose sensitive information.
Innovation Solution
The use of randomly determined patterns and seed keys for each block of text data, with dynamic mathematical offsets and metadata inclusion to ensure secure encryption and decryption, thwarting frequency analysis and allowing user-defined conditions for decryption.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional encryption algorithms (DES, AES) are used, then encryption consistency is maintained, but security is weakened due to pattern recognition and brute-force vulnerability
Solution Approach 1:
The patent implements dynamic encryption by randomly selecting encryption patterns and seed keys for each block of text. The encryption process is no longer static but changes with each encryption operation, making pattern recognition ineffective. Specifically, for each block of plaintext, a random pattern indicator is generated that determines the encryption transformation, ensuring that identical plaintext blocks produce different ciphertext blocks each time.
Solution Approach 2:
The patent changes the encryption parameters dynamically by using random seed keys of varying sizes and compositions for each encryption operation. The pattern indicators and mathematical offsets are randomly determined, causing the encryption parameters to change with each execution. This parameter variability prevents attackers from using consistent patterns to break the encryption through brute-force or pattern analysis methods.
2Object-affected harmful factors
If random patterns and seed keys are used for each block of text, then security against pattern recognition is improved, but encryption complexity increases
Solution Approach 1:
The patent divides the plaintext into multiple blocks and applies different encryption patterns to each block independently. By segmenting the encryption process into block-level operations with unique pattern indicators, the system manages complexity through modular design. Each block can be encrypted and processed separately, making the overall complex process more manageable and implementable through systematic segmentation of the data and encryption operations.
Solution Approach 2:
The patent introduces pattern indicators as intermediary elements that mediate between the random seed keys and the actual encryption transformation. The pattern indicators serve as intermediate representations that encode the encryption pattern information in a structured format, simplifying the implementation of complex random encryption patterns. This intermediary layer organizes the randomness into usable encryption instructions, reducing implementation complexity.
3Object-affected harmful factors
If dynamic mathematical offsets are applied to encryption parameters, then brute-force attack resistance is enhanced, but computational overhead increases
Solution Approach 1:
The patent performs preliminary actions by pre-generating random seed keys and determining pattern indicators before the actual encryption transformation. The mathematical offsets are calculated in advance based on the random parameters, so that during the encryption process, the system only needs to apply pre-computed transformations. This preliminary preparation reduces the computational burden during active encryption while maintaining the security benefits of dynamic parameter changes.
Data Source
AI summary
A method, system, and computer program product encrypt data. A processor(s) obtains plaintext (plaintext data) and randomly generates multiple seed keys and obtains a user-defined password. The processor(s) randomly generates encryption parameters (pattern indicators, end pointers, pattern indicator pointers, and component sizes) and encrypts the plaintext by converting the plaintext data to shuffle-transform encrypted text and generating, from the shuffle-transform encrypted text and based on the encryption parameters, a plurality of encrypted blocks. The processor(s) implements a dynamic mathematical offset, to a portion of mathematical functions underlying the encryption parameters. The processor(s) generates an encrypted chunk for each encrypted block of the plurality of encrypted blocks, wherein the encrypted chunk for each encrypted block contains a portion of the shuffle-transform encrypted text.