Sampled sub-block hashing for large input randomness extraction

Abstract

Randomness extraction is an essential post-processing step in practical quantum cryptography systems. When statistical fluctuations are taken into consideration, the requirement of large input data size could heavily penalise the speed and resource consumption of the randomness extraction process, thereby limiting the overall system performance. In this work, we propose a sampled sub-block hashing approach to circumvent this problem by randomly dividing the large input block into multiple sub-blocks and processing them individually. Through simulations and experiments, we demonstrate that our method achieves an order-of-magnitude improvement in system throughput while keeping the resource utilisation low. Furthermore, our proposed approach is applicable to a generic class of quantum cryptographic protocols that satisfy the generalised entropy accumulation framework, presenting a highly promising and general solution for high-speed post-processing in quantum cryptographic applications such as quantum key distribution and quantum random number generation.

arXiv comment15 pages, 8 figures. All comments are welcome

References in corpus (24)

• Device-independent security of quantum cryptography against collective attacks
• The Uncertainty Principle in the Presence of Quantum Memory
• Entropic Uncertainty Relations and their Applications
• Device-independent quantum key distribution secure against collective attacks
• Finite-size analysis of continuous-variable quantum key distribution
• Finite-key analysis for measurement-device-independent quantum key distribution
• Concise Security Bounds for Practical Decoy-State Quantum Key Distribution
• Quantum cryptography with finite resources: unconditional security bound for discrete-variable protocols with one-way post-processing
• Quantum Information Processing with Finite Resources -- Mathematical Foundations
• Leftover Hashing Against Quantum Side Information
• Experimental device-independent quantum key distribution between distant users
• Device-independent randomness expansion against quantum side information
• A largely self-contained and complete security proof for quantum key distribution
• Optical Quantum Random Number Generator
• Chain Rules for Smooth Min- and Max-Entropies
• Entanglement sampling and applications
• Device-Independent Quantum Key Distribution with Random Key Basis
• Experimental measurement-device-independent quantum random number generation
• Entropy accumulation with improved second-order term
• Sampling of min-entropy relative to quantum knowledge
• Security of quantum key distribution from generalised entropy accumulation
• Certified Quantum Random Numbers from Untrusted Light
• Provably-secure quantum randomness expansion with uncharacterised homodyne detection
• Entangled Quantum Key Distribution with a Biased Basis Choice