Method for pre-distributing wireless sensor network cipher key

Abstract

The invention relate to a wireless sensor network key pre-distribution method, which comprises the following steps: step S001: disposition server generating R upper triangular matrixes G and R diagonal matrixes D at random on the finite field GF (q); step S002: generating R groups of real symmetric matrixes K; step S003: saving the ID of every node, row vector seed gir, column vector; step S004: starting base station, and clustering networking; step S005: discovering the shared secret key pair corresponding to secret key space between nodes by pre-distributing secret key; step S006: distributing cluster secret keys with cluster head towards inner-cluster by the constructed shared secret key pair between nodes; step S007: expanding the secret key space dimension. The invention achieves lower node capacity, communication complexity and calculation complexity while ensuring the network completely is communicated; and has higher node anti-capture capability.

Description

technical field [0001] The invention relates to a key distribution method for information networks, especially wireless sensor networks. Background technique [0002] Wireless Sensor Networks (WSN for short) is a large-scale self-organizing sensor network for sensing the objective world. Compared with traditional wireless networks, WSN is mainly used in military reconnaissance and industrial control, etc., and has high security design requirements; due to the random dense distribution of nodes, limited resources, harsh operating environment and vulnerability to physical damage, it cannot Directly follow the existing security technology of the traditional network. [0003] WSN is vulnerable to various forms of attacks. In order to resist attacks and realize the confidentiality, integrity and validity of data transmitted between nodes, data encryption and identity authentication technologies play an important role. Key management is the basis of encryption authentication, an...

AI Technical Summary

Problems solved by technology

[0014] 1. Each node must save the t+1 item coefficients calculated based on the shared polynomial, and the node storage capacity is large

[0015] 2. When the network scale is dynamically expanded, new nodes can still maintain full connectivity, but the ratio of the safety threshold t to node capacity gradually decreases, and the security of the entire network decreases

To increase the safety threshold t, polynomials with more coefficients must be replaced, and all nodes must be updated, which requires a huge communication overhead

[0016] 3. When the network scale is large, the security threshold t is high, and the calculation overhead required for the connection between nodes is relatively large

[0022] 1. The integer factorization of LU matrix is ​​difficult

Arbitrarily generated symmetric matrix K, the result of LU decomposition is almost two triangular matrices containing decimals, and under the same algorithm, decimal operations are far more complicated than integer operations

[0023] 2. High node storage capacity

[0024] 3. High communication complexity

[0025] 4. High computational complexity

[0026] 5. Insufficient dynamic scalability

Images