Computational Analysis of Modified Bloms Scheme

📝 Original Info

• Title: Computational Analysis of Modified Bloms Scheme
• ArXiv ID: 1303.7457
• Date: 2013-04-01
• Authors: Researchers from original ArXiv paper

📝 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.

💡 Deep Analysis

Deep Dive into Computational Analysis of Modified Bloms Scheme.

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.

📄 Full Content

Reference