LU Decomposition Key Distribution for Sensor Networks

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Conventional key distribution methods for sensor networks are inadequate due to limited energy and calculation resources in sensor nodes, particularly failing to efficiently search for a common private key between nodes, leading to security vulnerabilities and high overhead in path establishment.

Innovation Solution

A system and method utilizing an LU decomposition of a symmetric key pool to distribute keys among sensor nodes, allowing them to search for a common private key through matrix multiplication, thereby enhancing security authentication with reduced resource requirements.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Ease of operation

If a random key pre-distribution scheme is used, then key distribution is simplified, but the ability to search for a common private key between sensor nodes is not guaranteed

Engineering Contradiction:
Improvekey distributionVSAvoidcommon private key search
Core Design Contradiction:
Ease of operationVSReliability

Solution Approach 1:

The key pool is divided into multiple matrices (first matrix, second matrix, third matrix) with different dimensionalities. Each sensor node is assigned a specific subset of these matrices, allowing efficient key search through matrix multiplication operations. This segmentation ensures that every pair of sensor nodes has a guaranteed common key while reducing the search space complexity.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The key pool is pre-organized into multiple matrices before sensor nodes are deployed. The matrices are pre-configured with specific dimensional relationships such that when sensor nodes perform matrix multiplication using their assigned matrices, a common private key is guaranteed to exist. This preliminary structuring eliminates the need for complex key search operations during communication establishment.

Inventive Principle:
Principle #10Preliminary action

2Reliability

If a public key encryption scheme is used, then security is improved, but the calculation requirements become too high for sensor nodes with limited resources

Engineering Contradiction:
ImprovesecurityVSAvoidcalculation resources
Core Design Contradiction:
ReliabilityVSUse of energy by moving object

Solution Approach 1:

The patent replaces complex public key encryption operations with simplified matrix multiplication operations. Instead of using computationally intensive asymmetric encryption algorithms, the system uses linear algebra operations (matrix multiplication) that are much lighter on computational resources. This substitution maintains security through the mathematical properties of matrix operations while dramatically reducing the energy and calculation requirements for sensor nodes.

Inventive Principle:
Principle #28Mechanics substitution (Replace mechanical system)

3Reliability

If a pair-wise key scheme is used, then security between nodes is improved, but the memory requirements become too high for sensor nodes with limited storage

Engineering Contradiction:
ImprovesecurityVSAvoidkey storage
Core Design Contradiction:
ReliabilityVSQuantity of substance

Solution Approach 1:

Each matrix assigned to sensor nodes serves multiple functions simultaneously. A single matrix can provide keys for multiple different sensor node pairs through its dimensional relationships. For example, a matrix with dimensions compatible with both node A and node B can serve as the common key for their communication. This multi-functionality reduces the total number of keys that need to be stored while maintaining comprehensive security coverage.

Inventive Principle:
Principle #6Universality (Multi-functionality)

Solution Approach 2:

The patent introduces multiple matrix dimensions to the key distribution system. Instead of using a single-dimensional key pool or simple pair-wise keys, the system uses matrices with different row and column dimensions. This dimensional approach allows a single matrix to serve multiple key pairs through appropriate dimension matching, thereby reducing storage requirements while maintaining security.

Inventive Principle:
Principle #17Another dimension (Dimensionality change)

Data Source

PatentUS7873167B2System and method for effectively pre-distributing key for distributed sensor network
Publication Date: 2011.01.18 INTELLECTUAL DISCOVERY CO LTD
  • US7873167B2 patent drawing
  • US7873167B2 patent drawing
  • US7873167B2 patent drawing

AI summary

A system for effectively pre-distributing keys for a distributed sensor network is disclosed, The system includes: a plurality of sensor nodes, each of which has a sensing function, a calculation function, and a wireless communication function; and a base station which is connected to the sensor nodes over a wireless network, receives data from the sensor nodes, acts as a data central station, and distributes keys for inter-sensornode security authentication to the sensor nodes. A key management unit contained in the base station, generates a set of the sensor nodes used for security authentication between the sensor nodes, decomposes the set of the sensor nodes into a plurality of matrices, distributes the matrices to the sensor nodes, and allows the sensor nodes to search for a common private key required for the security authentication using the received matrices. Therefore, the system can always search for a common private key between the sensor nodes.