基于二分法和Polar码的联合密钥协商算法  

Joint Secret Key Reconciliation Algorithm Based on BINARY and Polar Codes

作　　者：郭福星 于大鹏[1] 辛刚 GUO Fuxing;YU Dapeng;XIN Gang(Information Engineering University,Zhengzhou 450001,China)

机构地区：[1]信息工程大学,河南郑州450001

出　　处：《信息工程大学学报》2018年第3期338-342,共5页Journal of Information Engineering University

基　　金：国家863计划资助项目(2015AA01A708)

摘　　要：针对密钥协商算法在码字长度较短时纠错能力低、在初始错误率较高时容易产生错误扩散的问题,提出基于二分法和Polar码的联合密钥协商算法。该算法通过分析二分法和Polar码的特点,采用先二分法纠错,降低初始错误率,利用Polar码协商的方式协商密钥。其中,为提升协商算法的纠错性能,也对Polar码的协商过程进行了设计。通过仿真可知,基于Polar码的协商算法在初始错误率小于0. 17时能纠正错误,相比于LDPC码的0. 14,纠错能力提升了21%,但基于二分法和Polar码的联合协商算法具有更强的协商性能,在初始错误率为0. 21时,它的纠错能力比基于Polar码的协商算法又提升了24%。In order to solve the problem that the key negotiation algorithm has low error correction capability when the code length is short and error diffusion may occur when the initial error rate is high, a joint reconciliation algorithm based on BINARY and Polar codes is proposed. The algorithm analyzes the characteristics of BINARY and Polar codes, using the BINARY first to reduce the initial error rate and then Polar code to reconcile with the key.In order to improve the error correction performance of the negotiation algorithm, the negotiation process of Polar code is also designed. The simulation shows that Polar code can correct the error when the initial error rate is less than 0.17, and compared with the rate 0.14 of LDPC code, the reconciliation performance is improved by 21%. However, the joint algorithm based on BINARY and Polar codes has stronger negotiation performance, and its error correction capability increases by 24% compared with that based on Polar code when the initial error rate is 0.21.

关 键 词：密钥协商 错误扩散 Polar码 SCL 二分法 

分 类 号：TN918.1[电子电信—通信与信息系统]