A modular framework for randomness extraction based on Trevisan's construction
arXiv:1212.0520
Abstract
Informally, an extractor delivers perfect randomness from a source that may be far away from the uniform distribution, yet contains some randomness. This task is a crucial ingredient of any attempt to produce perfectly random numbers---required, for instance, by cryptographic protocols, numerical simulations, or randomised computations. Trevisan's extractor raised considerable theoretical interest not only because of its data parsimony compared to other constructions, but particularly because it is secure against quantum adversaries, making it applicable to quantum key distribution. We discuss a modular, extensible and high-performance implementation of the construction based on various building blocks that can be flexibly combined to satisfy the requirements of a wide range of scenarios. Besides quantitatively analysing the properties of many combinations in practical settings, we improve previous theoretical proofs, and give explicit results for non-asymptotic cases. The self-contained description does not assume familiarity with extractors.
21 pages, 15 figures. Source code is available under GPLv2+. Comments welcome
References in corpus (4)
Cited by in corpus (9)
- Quantum Random Number Generators
- Quantum random number generation
- Security in Quantum Cryptography
- More Efficient Privacy Amplification with Less Random Seeds via Dual Universal Hash Function
- Experimental Low-Latency Device-Independent Quantum Randomness
- Certifying Quantum Randomness by Probability Estimation
- Practical randomness amplification and privatisation with implementations on quantum computers
- Quantum Probability Estimation for Randomness with Quantum Side Information
- Quantum key distribution with entangled photons generated on-demand by a quantum dot