论文部分内容阅读
信息调和是量子密钥分配及无条件安全密钥分配中的一个重要步骤,其目的是通过公开可认证信道交换纠错信息把两个不相同的比特串变成相同的串。目前已知的方案都存在信息调和过程不能及时终止的问题。提出了一个终止信息调和过程的方案,其主要思想是先根据已有的试验结果所确定的轮数r对比特串进行r轮信息调和,然后再利用纠错码来检查剩余的两个比特串是否相同,并在不相同的情况下进行纠错。该方案具有轮数确定、效率高的特点,尤其是在比特对信息调和的情况下,通信双方每一轮交换的信息,不论是纠错码的纠错信息还是二分法的校验和信息,都可以一次发送给对方,这样可以减少双方在公开信道上交换信息的次数。还基于比特对信息调和协议,利用Hamming码和(24,12)Golay码进行一致性验证,按此方法进行了模拟。
Information reconciliation is an important step in quantum key distribution and unconditional security key distribution. The purpose of information reconciliation is to exchange two different bit strings into the same string through publicly verifiable channel exchange error correction information. At present, there is a problem that the information reconciliation process can not be terminated timely in the known solutions. Proposed a termination of information reconciliation process scheme, the main idea is based on the number of rounds r determined by the experimental results of the r-bit information on the bit string reconciliation, and then use the error correction code to check the remaining two bit string Are the same, and in the case of different error correction. The scheme has the characteristics of round number determination and high efficiency. Especially in the case of bit-to-message reconciliation, the information exchanged by each of the two parties in the round, whether error correction information of the error correction code or the binary sum check information, Can be sent to each other at one time, which reduces the number of times parties exchange information on open channels. Based on the bit-to-message reconciliation protocol, the Hamming code and the (24,12) Golay code are used to verify the consistency. The simulation is performed in this way.