Permutation Switching Core for Digital Encryption Randomness
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Modern encryption schemes face challenges in achieving high randomness in ciphertext, which is crucial for security, as existing methods may not adequately protect against key discovery by external observers.
Innovation Solution
The proposed solution involves a digital processing method using a switching core with M permutation elements to expand entropy from N-bit input data words to M*log2(2N!) bits, ensuring high randomness through permutation transformations, synchronized across sender and recipient devices for secure encryption and decryption.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional encryption schemes are used, then the encryption process is simple and fast, but the randomness of ciphertext is insufficient making it easier to crack
Solution Approach 1:
The encryption scheme is segmented into multiple independent permutation elements (M permutation elements). Each permutation element processes data independently, and the combination of multiple permutation elements creates a more complex and secure encryption system. The segmentation allows the system to achieve higher randomness through composition while maintaining manageable complexity at each segment level.
Solution Approach 2:
The patent introduces a new dimension to traditional encryption by using multiple permutation elements indexed by k (where k ranges from 0 to M-1). This dimensional expansion from a single permutation to M permutations allows the system to generate ciphertext with significantly enhanced randomness. The dimensionality change transforms the encryption space, making it much harder for observers to infer plaintext from ciphertext.
2Reliability
If multiple permutation elements are used to enhance randomness, then the encryption strength increases, but the processing complexity and computational overhead increase
Solution Approach 1:
The permutation elements are pre-computed and stored before the actual encryption process. By performing the complex permutation calculations in advance and storing the results, the system reduces the computational overhead during real-time encryption. This preliminary action allows the system to achieve high ciphertext randomness without excessive processing complexity during operation.
Solution Approach 2:
The system dynamically selects which permutation element to use based on the input data or encryption requirements. Rather than applying all M permutation elements to every data block, the system can dynamically choose appropriate permutation elements, optimizing the balance between ciphertext randomness and processing complexity. This dynamic approach allows flexibility in adjusting security levels based on specific needs.
Data Source
AI summary
A digital processing method, which comprises obtaining a stream of N-bit input data words; obtaining a value k between 0 and M−1, inclusively, where M>1; processing each of the N-bit input data words at least based on the kth of M permutation elements to produce a corresponding N-bit output data word; and outputting a stream of N-bit output data words on a network or storing the stream of the N-bit output data words in a non-transitory storage medium.