Key Encapsulation Protocols for Resource-Constrained IoT Devices
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current key agreement protocols, such as Diffie-Hellman, are resource-heavy and less suitable for low-resource devices like those in IoT and ad-hoc wireless networks, requiring efficient and secure key exchange methods that reduce communication burden and provide forward-secrecy.
Innovation Solution
A cryptographic method involving a communication interface and processor for generating public and private keys, applying error correction and reliable bit functions to reconcile differences in shared keys between devices, and encapsulating data with reconciliation data and indices to achieve active security and reduced failure probability.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If Diffie-Hellman key agreement protocol is used, then security is achieved, but resource consumption increases and bandwidth requirements rise
Solution Approach 1:
The patent changes the mathematical parameters from traditional Diffie-Hellman exponentiation over finite fields to polynomial arithmetic over rings with errors (RLWE problem). This parameter transformation maintains security while reducing computational complexity and resource consumption, making the protocol suitable for resource-constrained devices.
Solution Approach 2:
The patent replaces the traditional mechanical/mathematical operation of modular exponentiation with polynomial multiplication and error term manipulation. This substitution fundamentally changes the computational mechanism from resource-intensive exponentiation to more efficient polynomial arithmetic, reducing both computational power and memory requirements.
2Reliability
If traditional key agreement protocols are used, then security is provided, but communication bandwidth requirements increase
Solution Approach 1:
The patent extracts and transmits only the essential error term information rather than complete key material. By separating the error correction component from the full key exchange process, the protocol reduces the amount of data that needs to be communicated while maintaining security and enabling key reconciliation.
Solution Approach 2:
The patent transforms the key exchange parameters into a compact error term representation. Instead of exchanging large key materials, parties exchange smaller error terms that can be efficiently transmitted over bandwidth-constrained channels while still enabling secure key derivation through error correction.
3Reliability
If key agreement protocols are implemented on resource-constrained devices, then security is needed, but computational resources are limited
Solution Approach 1:
The patent changes the computational parameters from large-number exponentiation to polynomial multiplication with error terms. This parameter transformation reduces the computational complexity from O(n^3) for exponentiation to O(n^2) for polynomial multiplication, making the protocol feasible for devices with limited processing power.
Solution Approach 2:
The patent segments the key agreement process into distinct phases: key generation, error term computation, and error correction. This segmentation allows resource-constrained devices to perform only the necessary computational steps rather than executing the entire traditional Diffie-Hellman protocol, reducing overall computational burden while maintaining security.
Data Source
AI summary
Some embodiments are directed to a cryptographic device (20). A reliable bit function may be applied to a raw shared key (k*) to obtain reliable indices, indicating coefficients of a raw shared key, and reliable bits derived from the indicated coefficients. Reconciliation data (h) may be generated for the indicated coefficients of the raw shared key. A code word may be encapsulated using the reliable bits by applying an encapsulation function, obtaining encapsulated data (c) which may be transferred.