Stream randomness extraction against quantum side information

• URL: http://arxiv.org/abs/2605.09556v1
• Date: Sun, 10 May 2026 14:16:54 GMT
• Title: Stream randomness extraction against quantum side information
• Abstract summary: We introduce a stream-cipher implementation for the randomness extractor based on the Toeplitz matrix hashing.<n>We shift the computational burden from a time-consuming block-wise post-processing stage into an offline pre-processing stage.<n>We prove that this stream implementation strictly preserves the security guarantees of the original block-wise protocols.
• Score: 7.885462552423597
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• Efficient Quality Estimation of True Random Bit-streams [5.441027708840589]
  This paper reports the implementation and characterization of an on-line procedure for the detection of anomalies in a true random bit stream. The experimental validation of the approach is performed upon the bit streams generated by a quantum, silicon-based entropy source.
  arXiv  Detail & Related papers  (2024-09-09T12:09:17Z)
• Parallel and real-time post-processing for quantum random number generators [5.864108266054829]
  This work explores the parallel and real-time implementation of multiple seed real-time updating toeplitz hash extractors in an FPGA to achieve parallel QRNGs. With the use of higher-performance ADCs, we attained a random number production rate exceeding 20Gbps. This marks a significant step toward chip-based parallel QRNGs, enhancing the practicality of CV QRNGs in trusted, device-independent, and semi-device-independent scenarios.
  arXiv  Detail & Related papers  (2024-03-28T15:05:39Z)
• Sampled sub-block hashing for large input randomness extraction [2.549884936158282]
  Randomness extraction is an essential post-processing step in quantum cryptography systems. Large input data size could heavily penalise the speed and resource consumption of the randomness extraction process. We propose a sampled sub-block hashing approach to circumvent this problem.
  arXiv  Detail & Related papers  (2023-08-05T12:09:05Z)
• A privacy-preserving publicly verifiable quantum random number generator [48.7576911714538]
  We report the implementation of an entanglement-based protocol that allows a third party to publicly perform statistical tests without compromising the privacy of the random bits. limitations on computing power can restrict an end-user's ability to perform such verification.
  arXiv  Detail & Related papers  (2023-05-18T12:13:48Z)
• Improved Real-time Post-Processing for Quantum Random Number Generators [10.453509966841022]
  We propose two novel quantum-proof randomness extractors for reverse block sources that realize real-time block-wise extraction. Our designs achieve a significantly higher extraction speed and a longer output data length with the same seed length. Applying our extractors to the raw data generated by a widely used quantum random number generator, we achieve a simulated extraction speed as high as $300$ Gbps.
  arXiv  Detail & Related papers  (2023-01-20T15:02:37Z)
• Randomized Quantization: A Generic Augmentation for Data Agnostic Self-supervised Learning [89.00646449740606]
  Self-supervised representation learning follows a paradigm of withholding some part of the data and tasking the network to predict it from the remaining part. Data augmentation lies at the core for creating the information gap. In this paper, we explore the channel dimension for generic data augmentation by exploiting precision redundancy.
  arXiv  Detail & Related papers  (2022-12-19T18:59:57Z)
• Entwicklung eines schnellen optischen Quanten-Zufallsgenerators [0.0]
  This work reports on setup, characterisation and data processing of a true quantum random number generator. As a randomness source a pure quantum vacuum state of light is used, which is amplified by a laser beam. The system is able to produce true and unique random numbers at a rate of 25 Gbit/s and thus outperforms previous implementations considerably.
  arXiv  Detail & Related papers  (2022-12-07T22:08:12Z)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)
• Improved, Deterministic Smoothing for L1 Certified Robustness [119.86676998327864]
  We propose a non-additive and deterministic smoothing method, Deterministic Smoothing with Splitting Noise (DSSN) In contrast to uniform additive smoothing, the SSN certification does not require the random noise components used to be independent. This is the first work to provide deterministic "randomized smoothing" for a norm-based adversarial threat model.
  arXiv  Detail & Related papers  (2021-03-17T21:49:53Z)
• Generative Semantic Hashing Enhanced via Boltzmann Machines [61.688380278649056]
  Existing generative-hashing methods mostly assume a factorized form for the posterior distribution. We propose to employ the distribution of Boltzmann machine as the retrievalal posterior. We show that by effectively modeling correlations among different bits within a hash code, our model can achieve significant performance gains.
  arXiv  Detail & Related papers  (2020-06-16T01:23:39Z)
• RAIN: A Simple Approach for Robust and Accurate Image Classification Networks [156.09526491791772]
  It has been shown that the majority of existing adversarial defense methods achieve robustness at the cost of sacrificing prediction accuracy. This paper proposes a novel preprocessing framework, which we term Robust and Accurate Image classificatioN(RAIN) RAIN applies randomization over inputs to break the ties between the model forward prediction path and the backward gradient path, thus improving the model robustness. We conduct extensive experiments on the STL10 and ImageNet datasets to verify the effectiveness of RAIN against various types of adversarial attacks.
  arXiv  Detail & Related papers  (2020-04-24T02:03:56Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.