论文部分内容阅读
The efficiency of reconciliation in the continuous key distribution is the main factor which limits the ratio of secret key distribution. However,the efficiency depends on the computational complexity of the algorithm. This paper optimizes the two main aspects of the reconciliation process of the continuous key distribution:the partition of interval and the estimation of bit. We use Gaussian approximation to effectively speed up the convergence of algorithm. We design the estimation function as the estimator of the SEC(sliced error correction) algorithm. Therefore,we lower the computational complexity and simplify the core problem of the reconciliation algorithm. Thus we increase the efficiency of the reconciliation process in the continuous key distribution and then the ratio of the secret key distribution is also increased.
The efficiency of reconciliation in the continuous key distribution is the main factor which limits the ratio of secret key distribution. However, the efficiency depends on the computational complexity of the algorithm. This paper optimizes the two main aspects of the reconciliation process of the continuous key We use the Gaussian approximation to effectively speed up the convergence of algorithm. We design the estimation function as the estimator of the SEC (sliced error correction) algorithm. Therefore, we lower the computational complexity Thus we increase the efficiency of the reconciliation process in the continuous key distribution and then the ratio of the secret key distribution is also increased.