Next-Generation Systems and Secure Computing
by Subhabrata Barman, Santanu Koley, Subhankar Joardar
8Generation of Key Predistribution Scheme Applying Quasi-Symmetric Designs and Bent Functions in the Wireless Sensor Network
Debashis Ghosh
Department of Mathematics, School of Engineering (SoE), UPES, Bidholi, Dehradun, Uttarakhand, India
Abstract
Due to various restrictions in wireless sensor networks (WSN), the unilateral pair-up, and the security of self-configured and infrastructure-free communication among the nodes, key predistribution techniques have lately become a leading research area. Across all other best practices, the implementation of a combinatorial tool provides a premier foundation for key distribution within terminals. The purpose of this study is to design a key distribution technique by utilizing a combinatorial design to effectively address not only the operational performance but also the security needs of the network. In our scheme, we use the attributes of triangle-free quasi-symmetric 2-designs (TFQSD) in key allocation across sensor nodes to minimize the storage capacity. The scheme is represented by a block graph known to be the strongly regular graph connected to TFQSD. The confidentiality of the designed network is investigated by analyzing the parameters of the graph based on Bent Boolean functions.
Keywords: Key predistribution scheme, wireless sensor node, quasi-symmetric 2-designs, strongly regular graph, bent function, symmetric key cryptography
8.1 Introduction
8.1.1 Motivation
In the past few decades, the connections between mathematics ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access