Efficient Key Generation for Dynamic Blom's Scheme

Abstract

The need for totally secure communication between the nodes in a network has led to many key distribution schemes. Blom's scheme is a prominent key exchange protocol used for sensor and wireless networks, but its shortcomings include large computation overhead and memory cost. The main goal of our work is to find ways to overcome the shortcomings of the existing Blom Scheme and make it more efficient. In this thesis, we propose an efficient key management scheme by generating new public and private keys. We also focus on making Blom's scheme, dynamic by randomly changing the secret key that is generated by the base station and also using mesh array for matrix multiplication for reducing the computation overhead.