Dynamic Algorithm Generation for Secure Communication
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing communication systems face challenges in maintaining the security of encrypted data, as once the encryption algorithm and key are known, they can be easily compromised, allowing third parties to decrypt the data.
Innovation Solution
The system employs a method where both communication apparatuses generate and update algorithms and keys sequentially, using past solutions to create new ones, and erasing old solutions to prevent prediction of future changes, ensuring that even if past solutions are known, the route to generating new ones is unknown, thereby reducing the likelihood of data being broken by a third party.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a predetermined algorithm and key are used for encryption, then the encryption process is simple and efficient, but the security is compromised because once the algorithm and key are known, the encrypted data can be easily broken
Solution Approach 1:
The patent applies dynamics by making the encryption algorithm and key change over time rather than remaining static. The system dynamically generates new algorithms and keys based on previous states, ensuring that even if an attacker obtains current encryption parameters, they cannot decrypt past or future communications. This temporal variability directly addresses the security vulnerability of predetermined algorithms.
Solution Approach 2:
The patent implements parameter changes by continuously modifying the encryption algorithm and key parameters. Instead of using fixed parameters, the system generates new parameters based on previous algorithm states and shared secret information. This parameter evolution ensures that the encryption characteristics change over time, preventing attackers from using static analysis to break the encryption.
2Reliability
If the algorithm is rendered very complicated to prevent decryption, then security improves, but the system becomes complex and harder to implement
Solution Approach 1:
The patent applies self-service by enabling the encryption system to automatically generate its own algorithms and keys without external intervention. Each communication apparatus independently generates the necessary encryption parameters based on shared secret information and previous algorithm states. This self-generating capability provides strong security through complex, ever-changing algorithms while keeping the system implementation relatively simple.
3Reliability
If the key is changed in predetermined timing, then security is improved, but predictability increases making the system more vulnerable to attacks
Solution Approach 1:
The patent applies preliminary action by pre-establishing a shared secret between communication apparatuses before communication begins. This shared secret serves as the foundation for generating all subsequent algorithms and keys. Because the key generation is based on this predetermined secret combined with evolving algorithm states, the system achieves secure key rotation without predictable timing patterns, as the key changes depend on the evolving algorithm rather than fixed time intervals.
Data Source
AI summary
To improve a communication system including two communication apparatuses so as to reduce a possibility of having communication decrypted by a third party. The communication system includes a first communication apparatus and a second communication apparatus, where one of the communication apparatuses encrypts transmission subject data and transmits generated encrypted data to the other communication apparatus which decrypts received encrypted data. Each of the communication apparatuses generates an algorithm used for encryption each time it performs the encryption or decryption. In this case, each of the communication apparatuses generates the algorithm by assigning past solutions to a solution generating algorithm capable of having the past solutions assigned thereto and thereby generating a new algorithm. The past solutions are erased when they are no longer used.