Secret-key reconciliation by public discussion
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
A Practical Protocol for Advantage Distillation and Information Reconciliation
Designs, Codes and Cryptography
Performance and construction of polar codes on symmetric binary-input memoryless channels
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Efficient reconciliation protocol for discrete-variable quantum key distribution
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
We study the use of polar codes for both discrete and continuous variables Quantum Key Distribution (QKD). Although very large blocks must be used to obtain the efficiency required by quantum key distribution, and especially continuous variables quantum key distribution, their implementation on generic ×86 Central Processing Units (CPUs) is practical. Thanks to recursive decoding, they exhibit excellent decoding speed, much higher than large, irregular Low Density Parity Check (LDPC) codes implemented on similar hardware, and competitive with implementations of the same codes on high-end Graphic Processing Units (GPUs).