Key agreement method for symmetric key generation and distribution based on wireless channel characteristics

Abstract

The present invention relates to a key negotiation method based on wireless channel characteristics for symmetric key generation and distribution. The method first uses the PEG algorithm to generate a parity check matrix and encodes the key information of both communication parties, and sends the encoding result of communication party A to Communication party B compares the two encoding results. If the two codes are equal, the negotiation succeeds and the processing ends. If the two codes are the same after the first update, the negotiation succeeds and the processing ends. If the two codes are still different after multiple updates, then enter the second round of error correction. If the two codes are the same after multiple updates, the negotiation succeeds and the processing ends. , if the two codes are still different after multiple updates, the negotiation will fail and the process will end. This method realizes the symmetric key generation and distribution based on wireless channel characteristics under the condition of high bit error rate under the condition of ensuring communication security. key negotiation.

Description

technical field [0001] The invention relates to the field of information security, in particular to a key agreement method for generating and distributing a symmetric key based on wireless channel characteristics, and is applicable to the symmetric key generating and distributing mechanism of an existing wireless communication system. Background technique [0002] Key agreement refers to eliminating errors in the original key by exchanging a certain amount of information on a classical secure channel. Information exchanged on classical channels may be leaked to eavesdroppers, so it is required to exchange as little information as possible. Common key agreement methods include BBBSS, Cascade, Winnow, and LDPC algorithms. These algorithms perform differently. The BBBSS algorithm has high efficiency only in the case of low bit error rate (bit error rate below 3%), and the communication parties need to conduct multiple rounds of information interaction, and the number of algor...

AI Technical Summary

Problems solved by technology

The number of iterations of the Winnow algorithm is very low, and it is easy to implement, but the algorithm leaks a lot of information such as parity codes in each iteration, and cannot adapt to the situation of high bit error rate (bit error rate greater than 7%)

The main advantage of the LDPC algorithm is that only one data interaction is required, which greatly reduces information leakage, but it still cannot adapt to the situation of high bit error rate (bit error rate greater than 7%)

To sum up, the main problem faced by the common key agreement algorithm is the poor performance in the case of high bit error rate (bit error rate of 7%)

And most of the current algorithms use to discard the block where the error bit is located, which causes a lot of key waste

Images