Shared Secret Derivation Using Entropy-Reduced Data Subsets
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing secure communication techniques, such as the one-time pad, face challenges in distributing shared secret information between Alice and Bob without it becoming known to Eve, especially when the amount of secret information required is comparable to the plaintext message data, and the security relies on computational complexity that may be vulnerable to quantum computers.
Innovation Solution
Devices A and B obtain non-identical data sets, apply entropy-reducing or statistical functions to subsets of these data sets, and exchange messages to identify and discard non-matching subsets, ultimately deriving reduced data sets with a higher proportion of matching elements, thereby increasing information overlap and securing the shared secret information.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If conditionally secure cryptographic techniques are used, then message transmission can be achieved with computational feasibility, but security reliability deteriorates due to vulnerability against quantum computers and unproven mathematical assumptions
Solution Approach 1:
The patent replaces computational cryptography (mechanical/system-based security) with physics-based quantum key distribution. Instead of relying on computational difficulty of mathematical problems, the system uses quantum mechanical principles (Heisenberg uncertainty principle, no-cloning theorem) to provide information-theoretic security that is fundamentally secure against both classical and quantum attacks.
Solution Approach 2:
The patent transitions from classical computational security parameters to quantum physical security parameters. By changing the basis of security from mathematical complexity to quantum physical laws, the system achieves unconditional security while maintaining practical key distribution rates through optimized quantum state preparation and measurement protocols.
2Reliability
If one-time pad encryption is used, then unconditional security is achieved, but the amount of secret information required becomes comparable to the plaintext message data
Solution Approach 1:
The patent performs preliminary quantum key distribution to establish shared secret keys before actual message transmission. By pre-distributing compact quantum-generated keys through quantum channels, the system enables subsequent use of one-time pad encryption without requiring the full message-length key material to be transmitted in advance, thus reducing the initial secret information burden.
Solution Approach 2:
The patent introduces quantum-generated random keys as an intermediary between the communication parties. These quantum keys serve as a compact bridge that enables secure communication with much less pre-shared secret material than traditional one-time pad requirements, as the quantum key distribution protocol efficiently generates and distributes these intermediary keys over the quantum channel.
3Reliability
If quantum key distribution is implemented, then security against quantum computers is achieved, but system complexity increases due to quantum hardware requirements
Solution Approach 1:
The patent segments the quantum communication system into distinct functional modules: quantum key generation unit, quantum state preparation unit, measurement unit, and classical post-processing unit. This modular segmentation allows each component to be optimized independently and facilitates integration with existing classical cryptographic infrastructure, thereby managing overall system complexity while maintaining quantum security benefits.
Data Source
AI summary
“There is disclosed a method for deriving shared secret information between a first device (A) and a second device (B). The method comprises: obtaining, by device A, a data set DA; and obtaining, by device B, a data set DB. Then, for each of N subsets, DAi and DBi, respectively of DA and DB (i=1, 2, . . . , N; N>1) the following steps are carried out: determining, by device A, a first value, VAi=MA(DAi) based on DAi, wherein MA comprises an entropy-reducing function and/or a statistical function; determining, by device B, a second value, VBi=MB(DBi) based on DBi, wherein MB comprises an entropy-reducing function and/or a statistical function; and exchanging one or more messages between devices A and B to determine whether a condition based on the first and second values, VAi and VBi, is satisfied.”