Computational Analysis of Modified Blom's Scheme

TL;DR

This paper proposes a modified version of Blom's scheme to enhance security in wireless sensor networks by reducing computational complexity and memory requirements for key management.

Contribution

It introduces a new key pre-distribution scheme based on modifying Blom's scheme, improving efficiency for resource-constrained sensor networks.

Findings

Reduced computational complexity

Lower memory usage

Maintains security in wireless sensor networks

Abstract

To achieve security in wireless networks, it is important to be able to encrypt and authenticate messages sent among sensor nodes. Due to resource constraints, achieving such key agreement in wireless sensor networks in nontrivial. Blom's scheme is a symmetric key exchange protocol used in cryptography. In this paper, we propose a new key pre-distribution scheme by modifying Blom's scheme which reduces the computational complexity as well as memory usage.