Privacy amplification by public discussion
SIAM Journal on Computing - Special issue on cryptography
Elements of information theory
Elements of information theory
Experimental quantum cryptography
Journal of Cryptology - Eurocrypt '90
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
Quantum cryptography in practice
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Construction of rate-compatible LDPC codes utilizing information shortening and parity puncturing
EURASIP Journal on Wireless Communications and Networking
Quantum Cryptography and Secret-Key Distillation
Quantum Cryptography and Secret-Key Distillation
Waterfall performance analysis of finite-length LDPC codes on symmetric channels
IEEE Transactions on Communications
Information reconciliation for quantum key distribution
Quantum Information & Computation
Security of quantum key distribution with imperfect devices
Quantum Information & Computation
Generalized privacy amplification
IEEE Transactions on Information Theory - Part 2
The capacity of low-density parity-check codes under message-passing decoding
IEEE Transactions on Information Theory
Noiseless coding of correlated information sources
IEEE Transactions on Information Theory
Rate-compatible puncturing of low-density parity-check codes
IEEE Transactions on Information Theory
Regular and irregular progressive edge-growth tanner graphs
IEEE Transactions on Information Theory
Rate-compatible punctured low-density parity-check codes with short block lengths
IEEE Transactions on Information Theory
Results on Punctured Low-Density Parity-Check Codes and Improved Iterative Decoding Techniques
IEEE Transactions on Information Theory
A multiparty error-correcting method for quantum secret sharing
Quantum Information Processing
Hi-index | 0.00 |
Information reconciliation is a crucial procedure in the classical post-processing of quantum key distribution (QKD). Poor reconciliation efficiency, revealing more information than strictly needed, may compromise the maximum attainable distance, while poor performance of the algorithm limits the practical throughput in a QKD device. Historically, reconciliation has been mainly done using close to minimal information disclosure but heavily interactive procedures, like Cascade, or using less efficient but also less interactive -- just one message is exchanged -- procedures, like the ones based in low-density parity-check (LDPC) codes. The price to pay in the LDPC case is that good efficiency is only attained for very long codes and in a very narrow range centered around the quantum bit error rate (QBER) that the code was designed to reconcile, thus forcing to have several codes if a broad range of QBER needs to be catered for. Real world implementations of these methods are thus very demanding, either on computational or communication resources or both, to the extent that the last generation of GHz clocked QKD systems are finding a bottleneck in the classical part. In order to produce compact, high performance and reliable QKD systems it would be highly desirable to remove these problems. Here we analyse the use of short-length LDPC codes in the information reconciliation context using a low interactivity, blind, protocol that avoids an a priori error rate estimation. We demonstrate that 2×103 bits length LDPC codes are suitable for blind reconciliation. Such codes are of high interest in practice, since they can be used for hardware implementations with very high throughput.