Information Coordination Protocol Based On RS Code

A typical quantum key distribution process is divided into three phases, including initialization, information reconciliation, and privacy amplification. Before the reconcili-ation, both Alice and Bob have acquired equilong but not completely same original keys, then the two sides exchange information over a public channel to reconciliate in order to eliminate the error and carry on privacy amplification, at last, they end up with a highly-secret key string. In this paper, We mainly discuss error correction techniques used in the information reconciliation stage. Using the idea of cascade, we combine the RS code and exchange of parity to achieve the effect of error correction. The main work in this article is as follows:(1) RS code related decoding algorithms are analyzed, and put forward the RS code table lookup decoding algorithm, the algorithm has simple structure and can detect some errors beyond correction capability.(2) Based on the RS code and exchange of parity, we put forward a new protocol. It is important to use a random permutation to get even distribution of errors for other protocols, the protocol applies the idea of cascade to the process of error correction for the first time in order to get errors together. Then using RS code for error correc-tion. At first, we compare parity and check out the number of errors, using RS code for error correction when the number in the range of error correction capability. And we delete the date carefully to maintain the privacy of data. At last, the results of simulation are presented. To consider the error correction rounds and the length of remaining data, the protocol is practical when the error rate ranges from 0.01 to 0.1.