Coding Tree Secure Messaging Between Computing Components

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing secure messaging systems between computing components face challenges in ensuring message integrity and confidentiality, particularly when messages traverse networks accessible to third parties, as they rely on shared secret data that may be vulnerable to interception and decoding.

Innovation Solution

The implementation of a coding tree-based system where computing components encode and decode messages using a shared coding tree, with tree generation data exchanged to enable independent generation and decoding, allowing for bi-directional secure communication and message compression.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If shared secret data is used for message encoding, then message security is improved, but vulnerability to interception and decoding by third parties worsens

Engineering Contradiction:
Improvemessage securityVSAvoidvulnerability to interception
Core Design Contradiction:
ReliabilityVSObject-affected harmful factors

Solution Approach 1:

The patent extracts the secret data from the message transmission process by using a coding tree structure where the security relies on possession of the tree rather than on secret keys embedded in messages. The secret is separated into the tree structure itself, which remains on authorized devices, while only non-secret encoded messages traverse the network.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The coding tree acts as an intermediary structure that enables secure communication without requiring direct sharing of secret data between communicating parties. The tree structure mediates the encoding/decoding process, allowing authorized devices to communicate securely while third parties intercepting messages gain no useful information.

Inventive Principle:
Principle #24Intermediary (Mediator)

2Reliability

If coding tree structure is implemented, then message security and compression are improved, but system complexity worsens

Engineering Contradiction:
Improvemessage securityVSAvoidsystem complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The coding tree is constructed in advance before message transmission occurs. This preliminary construction of the tree structure allows for efficient encoding and decoding operations during actual message transmission, as the complex structural decisions have already been made during tree generation.

Inventive Principle:
Principle #10Preliminary action

Solution Approach 2:

The patent combines message encoding with compression functionality into a single coding tree structure. The same tree that provides security by enabling encoding also provides compression by efficiently representing message content, thereby achieving multiple benefits through a unified structure rather than separate systems.

Inventive Principle:
Principle #5Merging (Combining)

Data Source

PatentUS11128581B2Secure messaging between computing components
Publication Date: 2021.09.21 SAP SE
  • US11128581B2 patent drawing
  • US11128581B2 patent drawing
  • US11128581B2 patent drawing

AI summary

Various examples are directed to systems and methods for secure messaging between computing components. A first computing device may send tree generation data to a second computing component. The tree generation data may comprise string selection data identifying a set of at least two strings of a string library. The first computing component may generate a coding tree based at least in part on the tree generation data and the string library and encode a first message based at least in part on the coding tree to generate a first encoded message. The first computing component may send the first encoded message to the second computing component.