Randomized Partitioned Permutation Cipher for Dynamic Encryption

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Conventional encryption techniques are vulnerable to cryptanalysis attacks due to the use of static parameters, which can be compromised if a symmetric key or other parameters are determined by an attacker, leading to the exposure of past or future communications.

Innovation Solution

Implementing dynamic secure communication techniques that update encryption parameters randomly and probabilistically, using a randomized partitioned permutation cipher (RPPC) to enhance security by changing the state of the encryption device and synchronizing it with the decryption device, and applying transformations to reduce correlation between ciphertext and plaintext.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Use of energy by moving object

If symmetric cryptography is used to protect confidentiality, then computational efficiency is improved, but security becomes vulnerable to cryptanalysis attacks when the same key is repeatedly used

Engineering Contradiction:
Improvecomputational efficiencyVSAvoidsecurity
Core Design Contradiction:
Use of energy by moving objectVSReliability

Solution Approach 1:

The patent applies dynamics by making the encryption system adaptive through state changes. The encryption device maintains a state that evolves over time, where the state determines which operations are performed and how data is processed. This dynamic behavior prevents static analysis attacks while maintaining symmetric cryptography efficiency.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent changes parameters by using different operations from a plurality of available operations based on the current state. Each operation may involve different cryptographic functions, data transformations, or processing modes. By varying these parameters dynamically, the system maintains security without sacrificing the computational efficiency of symmetric cryptography.

Inventive Principle:
Principle #35Parameter changes

2Productivity

If the same symmetric key is repeatedly used to encrypt messages, then productivity is improved, but the system becomes vulnerable to pattern detection and key recovery attacks

Engineering Contradiction:
Improveencryption throughputVSAvoidcryptanalysis attacks
Core Design Contradiction:
ProductivityVSObject-affected harmful factors

Solution Approach 1:

The system uses dynamic state changes to vary encryption operations while maintaining high throughput. The state evolves through operations that can include key mixing, permutation, or other transformations that prevent pattern detection without requiring full re-encryption or key changes that would reduce productivity.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The patent implements periodic state changes where the encryption device periodically performs operations that alter its state. This periodic action introduces variability into the encryption process at regular intervals, preventing attackers from detecting patterns while maintaining continuous high-speed encryption operations between state changes.

Inventive Principle:
Principle #19Periodic action

3Reliability

If encryption parameters are updated dynamically using probabilistic methods, then security against cryptanalysis attacks is improved, but device complexity increases

Engineering Contradiction:
Improvesecurity against cryptanalysisVSAvoidencryption system complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The encryption device serves itself by automatically managing its own state based on probabilistic transitions. The device independently determines when and how to change state without requiring complex external control systems. This self-service approach enhances security through dynamic parameter updates while limiting complexity growth by using simple, repeatable state transition rules.

Inventive Principle:
Principle #25Self-service

Solution Approach 2:

The system uses feedback mechanisms where the current state influences future operations and state transitions. The probabilistic state changes are based on feedback from previous operations, creating an adaptive system that responds to its own operational history. This feedback loop provides security through unpredictability while managing complexity by using straightforward state transition logic.

Inventive Principle:
Principle #23Feedback

4Reliability

If transformations are applied to reduce correlation between ciphertext and plaintext, then security is improved, but processing time increases

Engineering Contradiction:
ImprovesecurityVSAvoidprocessing time
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The patent applies transformations dynamically based on the current state rather than applying fixed transformations to all data. The state determines which transformations are applied and in what sequence, allowing the system to optimize processing time by selecting efficient transformations while maintaining security through the dynamic, unpredictable nature of the transformation sequence.

Inventive Principle:
Principle #15Dynamics

Data Source

PatentUS11316835B2Systems and methods for securing communications
Publication Date: 2022.04.26 VIRTUAL SOFTWARE SYST
  • US11316835B2 patent drawing
  • US11316835B2 patent drawing
  • US11316835B2 patent drawing

AI summary

Techniques for securing communication. The techniques include using at least one device to perform method for encrypting input data using a cipher associated with a plurality of languages including a first language, the first language associated with a first set of ciphertext symbols, a first permutation for the first set, and a first partition for the first permutation. The method includes obtaining, from the input data, a first plaintext symbol; mapping the first plaintext symbol to a first ciphertext symbol using the cipher, the mapping including: identifying a first set of candidate ciphertext symbols using the first plaintext symbol, the first permutation, and the first partition; and identifying, at random, the first ciphertext symbol from the first set of candidate ciphertext symbols; and outputting the first ciphertext symbol.