A WSN Layer-Cluster Key Management Scheme Based on Quadratic Polynomial and Lagrange Interpolation Polynomial

Abstract

Since current key management schemes are mainly designed for static and planar networks, they are not very suitable for the layer-cluster wireless sensor networks (WSNs), a WSN layer-cluster key management scheme based on quadratic polynomial and Lagrange interpolation polynomial is proposed, in which the main idea of this scheme along the research line of broadcast identity authentication, session key, group key, network key and personal key. Specifically, authentication key can be established on the basis of Fourier series for identity authentication; session key is established by a multiple asymmetric quadratic polynomial, in which session key information is encrypted by the authentication key to ensure the security of intermediate interactive information; based on the former two keys, group key is established on the basis of Lagrange interpolation polynomial, in which the nodes of the cluster are not directly involved; the generation and management of network key is similar to the group key, in which the establishment idea is to regard the BS and all cluster heads as a group; the generation and management of personal key is also similar to the group key, the difference is that the personal key can be obtained by cluster nodes through getting the Lagrange interpolation polynomial coefficients based on their own random key information. It is analyzed that the proposed layer-cluster key management scheme can guarantee the identity of network nodes firstly through forward authentication and reverse authentication, and session key, group key and network key will guarantee the independence of the keys’ management and avoids the problem of single point failure compared with LEAP protocol, and personal key will guarantee the privacy of network.

Research on polynomial key management algorithm for 5G cellular-connected drone sensor network

“…As can be seen from Figure 2, the increase of the polynomial order is accompanied by the increase of the calculation amount, and at the same time, the increase of the number of nodes in the network is accompanied by the increase of the calculation amount of each cluster head. Therefore, if an excess number of cluster head nodes are captured, the security will be compromised [33,34]. As shown in Figure 3, since the computing performance is allocated to more cluster head nodes, the increase in the number of cluster head nodes can improve the performance of the network.…”

Dynamic coefficient symmetric polynomial-based secure key management scheme for Internet of Things (IoT) networks

“…The key distribution protocol only needs logical XOR operation, which is much faster than other schemes. Wang et al (2020) proposed a WSN layer-cluster key management scheme based on quadratic polynomial and Lagrange interpolation polynomial is proposed. Nafi, Bouzefrane & Omar (2020) proposed a new lightweight matrix-based key management protocol for IoT network.…”

A Cryptographic Algorithm using Polynomial Interpolations for Mitigating Key-Size Based Attacks

“…Most innovators used Lagrange Interpolation for key management [8,9]. Due to its irreversible and confusing property, interpolation is quite popular in cryptography [10,11]. The Interpolation method integrated with the ECC algorithm led to the modification of that algorithm [12]; its incorporation led to a tradeoff between time and space.…”

“…) = ∑ (𝑁 𝑖 − 𝑁) ̅̅̅̅2 𝑗 𝑖=1(11) Where, M and N are two data points whose values are taken randomly through the generator. j is the number of data points taken.…”