Polynomial Key Agreement for Resource-Constrained IoT Security
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current key agreement protocols, such as the Diffie-Hellman method, are resource-heavy and less suitable for low-resource devices like those in the Internet of Things, as they require extensive mathematical operations, making them inefficient for secure communication in resource-restrained environments.
Innovation Solution
A key agreement protocol using polynomials instead of matrices, where a shared polynomial is obtained and scaled to reduce computation and communication overhead, with private key polynomials having bounded coefficients and public key polynomials scaled down to a smaller modulus, allowing for efficient key derivation between network nodes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If Diffie-Hellman key agreement method is used, then secure key agreement is achieved, but computational resource consumption increases
Solution Approach 1:
The patent changes the mathematical parameters from traditional Diffie-Hellman exponentiation over finite fields to polynomial multiplication over rings with bounded coefficients. This parameter transformation reduces computational complexity from O(log exponent) to O(n) where n is the polynomial degree, making key agreement feasible for resource-constrained devices while maintaining security
Solution Approach 2:
The patent substitutes the mathematical mechanism of modular exponentiation with polynomial multiplication followed by modular reduction. This substitution replaces computationally intensive operations with simpler arithmetic operations that are more efficient on low-resource hardware, achieving the same cryptographic goal with reduced energy consumption
2Productivity
If polynomial scaling is applied to reduce computation overhead, then computational efficiency improves, but precision of key derivation may be affected
Solution Approach 1:
The patent introduces scaling factors and rounding operations as cushioning mechanisms before final key derivation. By pre-scaling polynomial coefficients to bounded ranges and incorporating rounding in the key derivation process, the system compensates for potential precision losses while maintaining computational efficiency. This cushioning ensures that even with scaled-down representations, the final derived keys remain secure and accurate
Data Source
AI summary
A first electronic network node (110) is provided configured for a key exchange (KEX) protocol, the first network node is configured to obtain a shared polynomial (a) shared with a second network node, coefficients of the shared polynomial a being selected modulo a first modulus q, generate a private key polynomial (skI), coefficients of the private key polynomial being bounded in absolute value by a bound (s) generate a public key polynomial (pkI) by computing a polynomial product between the shared polynomial (a) and the private key polynomial (skI) modulo the first modulus (q) and scaling the coefficients of the polynomial product down to a second modulus (p).