摘要
Recently, physical layer security in wireless communication system attracts much attention, and the reconciliation protocol plays an important role in the final secure key distillation, since the secret keys extracted from the realistic characteristics of the wireless channel may not be the same between the transmitter and legitimate receiver. A high efficiency Polar coding key reconciliation scheme is proposed in the paper to correct these errors. In the scheme, the transmitter generates a random stream with the known frozen bits and positions. After that, the transmitter encodes the random bit stream to a code stream by Polar encoding and sends the corrupted version of the code stream and the secret keys to the legitimate receiver. The receiver decodes the received stream with Polar successive cancellation decoding algorithm. With Polar encoding, the receiver obtains a random bit stream, and achieves the final secure key by XOR operator. The results show that the proposed scheme has a higher efficiency and a lower computational complexity, along with a high success rate. The consistency of the keys is very good after the reconciliation.
Recently, physical layer security in wireless communication system attracts much attention, and the reconciliation protocol plays an important role in the final secure key distillation, since the secret keys extracted from the realistic characteristics of the wireless channel may not be the same between the transmitter and legitimate receiver. A high efficiency Polar coding key reconciliation scheme is proposed in the paper to correct these errors. In the scheme, the transmitter generates a random stream with the known frozen bits and positions. After that, the transmitter encodes the random bit stream to a code stream by Polar encoding and sends the corrupted version of the code stream and the secret keys to the legitimate receiver. The receiver decodes the received stream with Polar successive cancellation decoding algorithm. With Polar encoding, the receiver obtains a random bit stream, and achieves the final secure key by XOR operator. The results show that the proposed scheme has a higher efficiency and a lower computational complexity, along with a high success rate. The consistency of the keys is very good after the reconciliation.
基金
supported by the National Natural Science Foundation of China (61871234,61475075)
