Hybrid Network-Coding Cryptosystem for Post-Quantum Security

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Existing cryptographic systems face challenges in achieving post-quantum security while maintaining high communication rates, especially in scenarios where public-key encryption cannot be applied over all network links.

Innovation Solution

The Hybrid Universal Network-Coding Cryptosystem (HUNCC) combines computational security with information-theoretic security, using a public-key cryptosystem on a subset of links and individually secure codes on others, to ensure both strong computational security and high communication rates.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If public-key encryption is applied over all network links to ensure computational security, then security level is improved, but communication rate deteriorates

Engineering Contradiction:
Improvecomputational securityVSAvoidcommunication rate
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The network links are segmented into two categories: some links use public-key encryption for computational security, while other links use individually secure codes for information-theoretic security. This segmentation allows the system to achieve both security types without applying public-key encryption to all links, thereby maintaining higher communication rates overall.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

Different security mechanisms are applied to different parts of the network based on local requirements. Links where computational security is prioritized receive public-key encryption, while links where communication efficiency is prioritized use individually secure codes. This local differentiation resolves the contradiction by allowing high communication rates in non-critical paths while maintaining security in critical paths.

Inventive Principle:
Principle #3Local quality

2Reliability

If public-key cryptosystem is used to achieve post-quantum security, then security against quantum attacks is improved, but key size and communication overhead increase

Engineering Contradiction:
Improvepost-quantum securityVSAvoidkey size
Core Design Contradiction:
ReliabilityVSQuantity of substance

Solution Approach 1:

The system merges two cryptographic approaches: public-key cryptosystems for post-quantum security and individually secure codes for efficient communication. By combining these approaches, the system achieves post-quantum security without requiring all communication to use large public-key structures, thus reducing overall key size and communication overhead while maintaining security guarantees.

Inventive Principle:
Principle #5Merging (Combining)

3Reliability

If one-time pad is used to achieve perfect secrecy, then secrecy is improved, but key distribution complexity increases

Engineering Contradiction:
Improveperfect secrecyVSAvoidkey distribution
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

Instead of requiring full one-time pad key distribution across all network paths, the system applies individually secure codes only where needed to achieve the desired secrecy level. This partial application reduces key distribution complexity while maintaining perfect secrecy for the portions of communication that require it, avoiding the excessive overhead of universal one-time pad implementation.

Inventive Principle:
Principle #16Partial or excessive action

Data Source

PatentUS20250192998A1Network coding-based post-quantum cryptography
Publication Date: 2025.06.12 MASSACHUSETTS INST OF TECH
  • US20250192998A1 patent drawing
  • US20250192998A1 patent drawing
  • US20250192998A1 patent drawing

AI summary

A system and method provide a hybrid communication scheme that achieves high communication rates with post-quantum computational security guarantees. Messages to be securely communicated are first mixed using an individually secure encoding, such as a linear network code, and some of the encoded messages are further encrypted. The encrypted and unencrypted messages are sent via different communications channels. Each unencrypted message becomes almost as secure as the encrypted messages because of the pre-mixing, since decoding any one of the messages requires all of the messages, including the encrypted messages. Thus, a very few encrypted messages may be used, allowing the rate of communication to approach one as the number of channels increases. This is particularly beneficial when a classical public-key cryptosystem can only be used in part of the data transmitted or stored, in the presence of noisy channels, in distributed data storage, and other applications.