Font Size: a A A

Research And Implementation Of WSN Key Management Scheme With Dynamic Coefficient Symmetric Polynomial

Posted on:2021-05-23Degree:MasterType:Thesis
Country:ChinaCandidate:Z Y LiuFull Text:PDF
GTID:2428330614958536Subject:Control engineering
Abstract/Summary:PDF Full Text Request
As the basis of wireless sensor network security mechanisms,the key management is of great significance in the research of wireless sensor network security.Owing to the nodes' hardware resources not much rich,wireless sensor nodes have certain limits and are vulnerable to various attacks.The thesis' s purpose is to design a key management scheme with strong anti-attack ability,high key connectivity rate,and strong network expansibility.The main research work in the thesis is as follows:(1)With the clustered wireless sensor network,a pair key management scheme with the dynamic coefficient symmetric polynomial is proposed,which is combined with the symmetric polynomial pair key management scheme.The pair key scheme maps the head-cluster and intra-cluster nodes' IDs to the row and column coordinates of the shared matrix M through the ID mapping algorithm.According to the row and column coordinates,it gets the elements of the shared matrix M which act as coefficients of the symmetric polynomial.The scheme realizes a coefficients' dynamic allocation of the symmetric polynomial key management scheme,and overcomes the security threshold problem of the symmetric polynomial key management scheme.Theoretical analysis shows that the scheme can effectively resist collusion attacks,replay attacks,brute force attacks,and man-in-the-middle attacks.It can guarantee the forward/backward security of the network,and has a high connectivity rate and good network scalability.The scheme effectively reduces the communication and storage overhead,compared with other key management schemes.(2)A group key management scheme with matrix element combination algorithm is proposed,which is combined with the identity mapping algorithm.The scheme maps the group-key-root factor to the row and column coordinates of the shared matrix M through the identity mapping algorithm.Then the shared matrix M elements are used to generate a group key through a one-way hash algorithm,which are obtained according to the row and column coordinates.Theoretical analysis shows that the scheme can effectively resist collusion attacks,replay attacks,brute force attacks,and man-in-the-middle attacks.It can guarantee the forward/backward security of the network,and has a high connectivity rate and good network scalability.The scheme effectively reduces the communication,calculation and storage overhead,compared with other key management schemes.(3)The code design is developed on the STM32F103 chip,and a test verification system is builded to perform functional verification,performance test,and security verification.Through performing the scheme's function verification,it shows that the key management scheme can generate the pair key,group key and complete the update of the pair key and group key;Through carrying out the performance test,it shows that it is very low on the communication overhead,calculation overhead and storage overhead of the key and group key management schemes;Through performing security verification,it shows that the pair key and group key management schemes proposed in the thesis can resist replay attacks and man-in-the-middle attacks.
Keywords/Search Tags:WSNs, key management, pair key, group key, key update
PDF Full Text Request
Related items