aiqbench analysis
This research generalizes stream-cipher implementations to a broader class of randomness extractors, shifting computational load to an offline pre-processing stage to enable real-time processing of quantum data. By preserving the security guarantees of block-wise protocols while eliminating latency and buffering overheads, the proposed framework offers a practical path toward more efficient quantum cryptographic systems. The work validates these improvements through benchmarks using realistic quantum experimental data across three standard matrix constructions.
Stream randomness extraction against quantum side information
arXiv:2605.09556v2 Announce Type: replace Abstract: Randomness extraction is indispensable for quantum random number generators, serving to eliminate bias and potential information leakage from raw measurement data. Conventional extractors operate in a block-wise fashion, requiring the complete accumulation of raw data before processing. To circumvent the latency and buffering overheads that hinder real-time random number generation, recent work introduced a stream-cipher implementation for the randomness extractor based on the Toeplitz matrix hashing. In this work, we generalize this stream-processing paradigm to the broader family of randomness extractors based on (almost dual) universal$_2$ random hashing. Specifically, we shift the computational burden from a time-consuming block-wise post-processing stage into an offline pre-processing stage that generates a pseudo-random mask. This allows the raw data to be processed by the mask on the fly using a simple bitwise exclusive-OR operation. Crucially, we prove that this stream implementation strictly preserves the security guarantees of the original block-wise protocols. We detail the transformation of three typical constructions -- based on standard Toeplitz, circulant, and modified Toeplitz matrices -- from block to stream implementations, and benchmark their practical performance using realistic quantum experimental data. We anticipate our framework will enhance the efficiency of real-time quantum cryptographic systems.
Abstract:Randomness extraction is indispensable for quantum random number generators, serving to eliminate bias and potential information leakage from raw measurement data. Conventional extractors operate in a block-wise fashion, requiring the complete accumulation of raw data before processing. To circumvent the latency and buffering overheads that hinder real-time random number generation, recent work introduced a stream-cipher implementation for the randomness extractor based on the Toeplitz matrix hashing. In this work, we generalize this stream-processing paradigm to the broader family of randomness extractors based on (almost dual) universal$_2$ random hashing. Specifically, we shift the computational burden from a time-consuming block-wise post-processing stage into an offline pre-processing stage that generates a pseudo-random mask. This allows the raw data to be processed by the mask on the fly using a simple bitwise exclusive-OR operation. Crucially, we prove that this stream implementation strictly preserves the security guarantees of the original block-wise protocols. We detail the transformation of three typical constructions -- based on standard Toeplitz, circulant, and modified Toeplitz matrices -- from block to stream implementations, and benchmark their practical performance using realistic quantum experimental data. We anticipate our framework will enhance the efficiency of real-time quantum cryptographic systems.
arXiv:2605.09556 [quant-ph]
(or arXiv:2605.09556v2 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2605.09556 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 283 words
Related coverage

The Alignment Problem: Computer Science Meets Analytic Philosophy
LessWrong · Oct 18, 2026

Lattice-Based Cryptography Explained
Quantum Zeitgeist · Aug 15, 2026
Researchers Certify High-Speed Randomness from Semiconductor Noise
Quantum Zeitgeist · Sep 10, 2026
A Solution to Cryptographic Boxes for Unfriendly AI
LessWrong · Jul 19, 2026