Efficient Key Generation for Dynamic Blom's Scheme
Divya Harika Nagabhyrava

TL;DR
This paper introduces an efficient, dynamic key management scheme for Blom's cryptographic system, utilizing mesh array-based matrix multiplication to reduce computational overhead and enhance adaptability.
Contribution
It presents a novel dynamic key generation method for Blom's scheme with optimized matrix multiplication using mesh arrays.
Findings
Reduced computation overhead with mesh array multiplication
Enhanced security through dynamic secret key updates
Improved efficiency in key management processes
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Data Security · Chaos-based Image/Signal Encryption · Security in Wireless Sensor Networks
