Asymmetric to Symmetric Key Agreement via Matrix Obfuscation

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Asymmetric key encryption methods are computationally costly and resource-intensive, making them inefficient for secure communication, especially when compared to symmetric key approaches, and they require prior secrets for key establishment, which can be a security vulnerability.

Innovation Solution

A system and method for generating public codes using secret keys, including interior and summing matrices, to enable secure communication between computing nodes without prior secrets, allowing for symmetric key utilization over insecure mediums, reducing costs and enhancing security through obfuscation and symmetric code generation.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If asymmetric key encryption is used, then security is improved, but computational cost and resource consumption increase significantly

Engineering Contradiction:
ImprovesecurityVSAvoidcomputational cost
Core Design Contradiction:
ReliabilityVSUse of energy by moving object

Solution Approach 1:

The patent segments the encryption process into two distinct phases: an asymmetric key exchange phase for establishing security, and a symmetric encryption phase for actual data transmission. This segmentation allows the system to use computationally expensive asymmetric operations only when necessary (key establishment) and cheaper symmetric operations for the bulk of communication, resolving the contradiction between security and computational cost.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent introduces a symmetric key as an intermediary that bridges asymmetric key exchange and data encryption. The asymmetric protocol establishes this symmetric key through matrix operations, which then serves as the foundation for efficient symmetric encryption. This intermediary allows the system to leverage the security benefits of asymmetric encryption while avoiding its high computational cost for actual data transmission.

Inventive Principle:
Principle #24Intermediary (Mediator)

2Reliability

If asymmetric key encryption is used, then key privacy is maintained, but communication efficiency decreases

Engineering Contradiction:
Improvekey privacyVSAvoidcommunication efficiency
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The patent divides communication into key establishment (asymmetric) and data transmission (symmetric) segments. The asymmetric protocol ensures key privacy during establishment, while the symmetric protocol ensures communication efficiency during data transmission, resolving the contradiction between key privacy and communication efficiency.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent changes the encryption parameter from asymmetric keys to symmetric keys after the initial exchange. By transitioning from asymmetric to symmetric encryption parameters, the system maintains the security benefits of asymmetric key privacy while achieving the efficiency of symmetric communication.

Inventive Principle:
Principle #35Parameter changes

3Use of energy by moving object

If symmetric key encryption is used, then computational cost is reduced, but key distribution security becomes vulnerable

Engineering Contradiction:
Improvecomputational costVSAvoidkey distribution security
Core Design Contradiction:
Use of energy by moving objectVSReliability

Solution Approach 1:

The patent uses asymmetric key exchange as an intermediary mechanism to securely distribute symmetric keys. The asymmetric protocol acts as a trusted channel that enables secure key distribution without requiring prior shared secrets, thereby maintaining key distribution security while allowing the use of computationally efficient symmetric encryption.

Inventive Principle:
Principle #24Intermediary (Mediator)

Solution Approach 2:

The patent performs preliminary asymmetric key exchange and symmetric key derivation before actual data transmission begins. This preliminary action establishes secure communication parameters in advance, allowing subsequent data transmission to use efficient symmetric encryption without compromising key distribution security.

Inventive Principle:
Principle #10Preliminary action

4Ease of operation

If asymmetric encryption is used without prior secrets, then key establishment is simplified, but computational resources required increase

Engineering Contradiction:
Improvekey establishmentVSAvoidinformation resources
Core Design Contradiction:
Ease of operationVSUse of energy by stationary object

Solution Approach 1:

The patent segments key establishment operations into asymmetric matrix-based key exchange and subsequent symmetric encryption. This segmentation allows the system to use computationally intensive asymmetric operations only for initial key establishment and switch to resource-efficient symmetric operations for ongoing communication, resolving the contradiction between ease of key establishment and information resource consumption.

Inventive Principle:
Principle #1Segmentation

Data Source

PatentUS10432596B2Systems and methods for cryptography having asymmetric to symmetric key agreement
Publication Date: 2019.10.01 ANDERSSON KARE L
  • US10432596B2 patent drawing
  • US10432596B2 patent drawing
  • US10432596B2 patent drawing

AI summary

A system and method for generating data for use in cryptography or secure modulation is provided. The method may include randomly generating a public code using a secret key, wherein the public code includes an interior matrix and a summing matrix, both having a predetermined dimension of rows and columns. After receipt of the public code and the rule of obfuscation by a receiving computer node, the method may further include generating an obfuscated matrix pattern from the interior matrix, based upon the rule of obfuscation. For symmetric key utilization, the receiving computing node can generate a symmetric code from the summing matrix, based upon the rule of obfuscation, which can be for use in communication between computing nodes. Alternatively, a server node can retrieve or generate the public code and the rule of obfuscation to the computing node. Thereby, each node is enabled to communicate privately with each other.