CROct 27, 2014

Efficient Key Generation for Dynamic Blom's Scheme

arXiv:1410.7340v1
Originality Synthesis-oriented
AI Analysis

This is an incremental improvement for secure communication systems requiring dynamic key updates.

The paper tackles the problem of computational overhead in dynamic key management by proposing an efficient key generation scheme for Blom's scheme using mesh array matrix multiplication, achieving reduced computation overhead.

In this paper, we propose an efficient key management scheme by generating new public and private keys in the Blom scheme. We also focus on making this scheme dynamic by randomly changing the secret key that is generated by the base station and we propose the use of the mesh array for matrix multiplication for reducing the computation overhead.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes