Pseudo-Random Sequence Encryption Key Generation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing sequence cipher encryption methods face challenges in generating sufficiently chaotic and concealed encryption keys, particularly in ensuring the randomness and unpredictability of the encryption process, which can lead to vulnerabilities in deciphering the cipher text.
Innovation Solution
The introduction of pseudo-random reconstruction methods that generate seed random sequences through pseudo-random construction and multi-frequency XOR operations, using a combination of positioning, length, frequency, and hopping functions to create a chaotic and nonlinear encryption process, ensuring the randomness and concealment of the encryption key.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional sequence cipher encryption is used with a fixed key generation method, then the encryption process is simple and fast, but the chaos degree and randomness of the encryption key are insufficient, making it vulnerable to deciphering
Solution Approach 1:
The patent applies dynamics by making the key generation process adaptive and variable. The system dynamically adjusts the generation of pseudo-random sequences based on chaotic maps and multiple transformation functions, ensuring that the encryption key changes unpredictably for each encryption operation. This dynamic approach enhances the chaos degree and randomness of the key, directly improving security while accepting increased process complexity.
Solution Approach 2:
The patent employs composite materials by combining multiple mathematical components to generate the encryption key. It integrates chaotic maps, multiple pseudo-random sequence generation functions, and transformation operations to create a composite key generation system. This composite approach ensures high randomness and unpredictability, resolving the contradiction between security requirements and process simplicity.
2Reliability
If the encryption key is generated with high randomness and chaos degree, then the probability of acquiring the key is small, but the computation time and complexity of generating the key increases
Solution Approach 1:
The patent applies preliminary action by pre-defining the mathematical frameworks and transformation functions that will be used in key generation. The chaotic maps and pseudo-random sequence generation algorithms are established in advance, allowing the system to quickly generate high-entropy keys without extensive real-time computation. This pre-preparation reduces computation time while maintaining high randomness and security.
Solution Approach 2:
The patent replaces mechanical or brute-force key generation methods with mathematical substitution using chaotic maps and pseudo-random functions. This substitution enables rapid generation of high-entropy keys through efficient mathematical operations rather than time-consuming computational processes, thereby reducing computation time while maintaining strong resistance to deciphering.
3Reliability
If pseudo-random reconstruction with multiple functions is used to generate the encryption key, then the concealment and chaos degree of the key are enhanced, but the structure of the encryption system becomes more complex
Solution Approach 1:
The patent applies segmentation by dividing the key generation process into distinct functional modules: chaotic map generation, pseudo-random sequence generation, and transformation functions. Each module performs a specific operation, and their combination creates the final encryption key. This segmented structure enhances concealment and chaos degree while organizing the system complexity into manageable, modular components.
Solution Approach 2:
The patent employs universality by designing transformation functions that serve multiple purposes within the encryption system. The same mathematical functions are used across different stages of key generation, providing both concealment and chaos enhancement while reducing the need for separate dedicated components. This multi-functionality approach maintains high security while controlling system structural complexity.
Data Source
AI summary
Disclosed is a random binary sequence-based sequence encryption method accompanied with random reconfiguration of a key. The method is mainly characterized in that (1) an existing random sequence is used to dynamically configure a seed random sequence at the beginning of each encryption operation, (2) the seed random sequence is used to pseudo-randomly configure a random key with a fixed-length or variable-length bit field, (3) the pseudo-random configuration of the random key accompanies an encryption process, (4) a transitive property of an exclusive-or operation is used to realize a variable-frequency nonlinear exclusive-or operation on a plaintext using the key, (5) adjustment of key configuration is realized by adjusting a characteristic vector, other operation vectors and a pseudo-random configuration function, such that adjustment of an encryption density can be realized without increasing time complexity, and (6) the characteristic vector are unable to be reversely inducted in polynomial time complexity.