An efficient method for the key distillation without computational complexity
Xiang‐Bin Wang · arXiv (Cornell University) · 2004
In quantum key distribution(QKD), there are two main methods for the final key distillation: classical CSS code and random hashing method. Neither of them is efficiently computable. For the method of CSS code, it is unknown how to construct a large CSS code efficiently. The random hashing method, in its present form, has a drawback of decoding complexity. The existing efficiently decodable error correction code does not apply to the random hashing method directly since the method combines the error correction and privacy amplification together and one must consider the backward action. Here we show that the random hashing method can be modified therefore can be decoded efficiently. We also apply the method to the case of imperfect source where a small fraction of signals are tagged by Eve.