An efficient construction of Raz's two-source randomness extractor with improved parameters

πŸ“… 2025-06-18
πŸ“ˆ Citations: 1
✨ Influential: 0
πŸ“„ PDF
πŸ€– AI Summary
Raz’s two-source extractor originally incurred quartic-polynomial computational complexity, severely limiting practicality. To address this, we propose the first efficient variant supporting a combination of linear-entropy and logarithmic-entropy sources, reducing time complexity to quasi-linear. Leveraging a novel analytic theorem, we lower entropy requirements and achieve, for the first time, both quantum security and strong security guarantees. Our construction integrates algebraic geometry codes, finite-field polynomial evaluation, and information-theoretic analysis to establish robust quantum randomness extraction. Experiments demonstrate over three orders-of-magnitude improvement in computational efficiency and significantly reduced entropy requirements. Theoretically and empirically, our extractor outperforms all existing mainstream two-source extractors. The implementation is fully open-sourced, including automated parameter computation and industrial-grade configuration tools.

Technology Category

Application Category

πŸ“ Abstract
Randomness extractors are algorithms that distill weak random sources into near-perfect random numbers. Two-source extractors enable this distillation process by combining two independent weak random sources. Raz's extractor (STOC '05) was the first to achieve this in a setting where one source has linear min-entropy (i.e., proportional to its length), while the other has only logarithmic min-entropy in its length. However, Raz's original construction is impractical due to a polynomial computation time of at least degree 4. Our work solves this problem by presenting an improved version of Raz's extractor with quasi-linear computation time, as well as a new analytic theorem with reduced entropy requirements. We provide comprehensive analytical and numerical comparisons of our construction with others in the literature, and we derive strong and quantum-proof versions of our efficient Raz extractor. Additionally, we offer an easy-to-use, open-source code implementation of the extractor and a numerical parameter calculation module.
Problem

Research questions and friction points this paper is trying to address.

Improve Raz's two-source randomness extractor efficiency
Reduce entropy requirements for randomness extraction
Provide practical implementation of efficient extractor
Innovation

Methods, ideas, or system contributions that make the work stand out.

Quasi-linear computation time extractor
Reduced entropy requirements theorem
Open-source code implementation provided
C
Cameron Foreman
Quantinuum, Partnership House, Carlisle Place, London SW1P 1BX, United Kingdom; Department of Computer Science, University College London, London, United Kingdom
L
Lewis Wooltorton
Quantinuum, Terrington House, 13–15 Hills Road, Cambridge CB2 1NL, United Kingdom; Department of Mathematics, University of York, Heslington, York, YO10 5DD, United Kingdom; Quantum Engineering Centre for Doctoral Training, H. H. Wills Physics Laboratory and Department of Electrical & Electronic Engineering, University of Bristol, Bristol BS8 1FD, United Kingdom
K
Kevin Milner
Quantinuum, Partnership House, Carlisle Place, London SW1P 1BX, United Kingdom
F
Florian J. Curchod
Quantinuum, Terrington House, 13–15 Hills Road, Cambridge CB2 1NL, United Kingdom