Some Constructions Of Key Distribution Scheme And Its Application

With the rapid development of modern communication technology, computer networks have become a common communication tool. In this network world, it is very convenient for users to share and exchange information resource, but at the same time, network security has become more and more serious problem. Key management is the first core of the network security issues. In addition, the key storage and key distribution are two of the most important and the most difficult links. Based on the symplectic geometry, combination design, multiple key distribution patterns are proposed in this paper. Based on the symplectic geometry over finite field, a key pre-distribution scheme for wireless sensor network?WSN? which has the high connectivity and security is constructed. The main results of the thesis are as follows:Firstly, based on the colsed connection between resolvable designs and key distribution patterns, the constructions of KDPs are convertd into the constructions of resolvable designs.Resolvable designs with q2,q3 points are proposed, and then generalize them to constructions of resolvable design withnq?n?Z, n?2? points by mathematical induction.Secondly, based on combinatorial design theory, a new?G*,F*? KDP acrroding to?G,F?-KDP is proposed, and then combines two ?-KDPs?? >1? to get new??-1?-KDPs,which provide secure communication in a large network and minimize the amount of key storage.Thirdly, based on 2-dimensional subspace and subspaces of type?2s,s? in symplectic space F_q^2u, a key pre-distribution scheme is proposed, which guarantees every pair of nodes has shared key, so as to improve the networks connectivity.