Encryption Key Generation via Local Data Comparison
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing cryptographic systems face challenges in key distribution and management, particularly for symmetric and asymmetric encryption, where keys need to be securely shared between communicating parties, and their validity is limited due to the risk of exposure, with quantum cryptography having a restricted range of distribution.
Innovation Solution
A method where nodes generate their own encryption/decryption keys by processing key generating files received from a central server, comparing intermediate data sets to create unique keys, eliminating the need for key distribution and ensuring secure communication without exposing the key generation process.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If keys are distributed from a central server to communicating parties, then key availability is improved, but security risk increases due to potential exposure during distribution and storage
Solution Approach 1:
The secret key material is extracted from the distributed key generating files. Each party receives a key generating file containing only public information and instructions, but the actual secret key is generated locally by executing the file, thus taking the secret out of the distribution channel and keeping it only at the destination
Solution Approach 2:
A central server acts as an intermediary to distribute key generating files to multiple parties. The server facilitates key generation for many parties without ever possessing the secret keys themselves, mediating the process while maintaining security by never handling the sensitive key material
2Reliability
If keys are kept secret by communicating parties, then security is maintained, but key management complexity increases especially for parties communicating with many different parties
Solution Approach 1:
Each party generates their own secret key locally by executing the key generating file on their own system. The key is created and stored only in that party's system, requiring no distribution or management by other parties. Each party independently manages their own key without needing to coordinate with others
Solution Approach 2:
The key generation process is segmented into independent components distributed to each party. Each party receives their own key generating file and generates their own key independently, dividing the overall key management task into separate autonomous units rather than requiring centralized management
3Reliability
If keys are used for limited time periods, then security risk from key exposure is reduced, but communication efficiency decreases due to frequent key redistribution
Solution Approach 1:
Key generating files are prepared and distributed in advance to all potential communicating parties. When communication is needed, parties simply execute their pre-distributed files to generate keys instantly, eliminating the need for last-minute key distribution and enabling immediate communication
4Reliability
If quantum cryptography is used to produce shared random bit strings, then key security is improved with eavesdropping detection, but distribution range is limited to about 100 kilometers
Solution Approach 1:
The patent replaces the quantum mechanical key distribution system with a classical computational system. Instead of using quantum key distribution protocols that are limited by distance, the invention uses classical key generating files that can be distributed globally through conventional communication channels while maintaining security through local key generation
Data Source
Figure 1
Figure 2~5
Figure 6
AI summary
The present invention relates to a method for generating an encryption/decryption key, and especially for generating a one-time encryption/decryption key used for symmetric encryption, i.e. where the same key is used both for encryption and decryption. In order to stait key generation a first node (A) sends a request to a central server (2) for setting up communication with a second node (B). The central server (2) sends a key generating file both the nodes (A and B) Each node generates a different intermediate data set, i.e a first and second data set. The first data set generated by the first node (A) is sent to the second node (B), which based on this data set generates a third data set which is sent back to the fust node. The generating of a first cryptogiaphic key in node (A) is based on bit by bit comparison between the third and the first intermediate data set and the generation of a second cryptographic key is based on bit by bit comparison between the first and the second intermediate data set. The first and second cryptographic key being the same.