Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Physica Scripta

High-efficiency implementation of Toeplitz Strong Extractor for PRNG and QRNG output on CPU/GPU hardware systems

K S V Anurag, G Raghavan, Kanaka Raju P.

Published Jun 14, 2024• 3 citations
Publisher

Abstract

Abstract Random Number Generators (RNGs) are devices whose utility spans from cryptography to gambling. Depending on the source of the random seed, RNGs are classified as Pseudo-Random Number Generators (PRNGs), which are based on mathematical algorithms, True Random Number Generators (TRNGs) sourced through seemingly random physical processes, and finally, Quantum Random Number Generators (QRNGs) which harness the intrinsic randomness of measured outcomes of quantum states. To ensure that the output of a QRNG is private and nearly uniform, the raw data undergoes a strong extraction process such as Toeplitz or Trevisan Hashing. The extraction process needs to be extremely efficient to achieve high-speed random number generation. The present work demonstrates state-of-the-art methods for performing information-theoretically provable randomness extraction using variations of the Toeplitz Hashing algorithm. These algorithms are implemented on various hardware for comprehensive analysis. Subsequently, these methods are applied to two raw data sets from a PRNG source and a quantum source. A new benchmark of 19.5 Gbps for Randomness Extraction using the Fast Fourier Transform-based Toeplitz Strong Extractor is demonstrated in this work. The implementation of the algorithm on a GPU-based system demonstrates notably enhanced speed, marking a significant leap beyond the existing state-of-the-art implementations.

DOI
10.1088/1402-4896/ad587f

Related papers

FPGA-based Toeplitz Strong Extractor for Quantum Random Number Generators

Shubham Chouhan, K S V Anurag, G. Raghavan +1 more

Quantum Random Number Generators (QRNGs) serve as high entropy sources for Quantum Key Distribution (QKD) systems. The raw data from quantum sources however require post-processing to generate a nearly uniform distribution. This work presents a state-of-the-art implementation of the Toeplitz Strong Extractor on an FPGA, achieving a benchmark extraction speed of 26.57 Gbps. A detailed implementation flow of the post-processing on FPGA is presented along with the various execution speeds obtained based on different randomness extraction ratios. Raw data from an in-house phase noise-based QRNG is processed on the FPGA using the implementation and the output is validated via the NIST STS 2.1.2 statistical randomness tests suite.

arXiv:2505.02868•IEEE India Council International Subsections Conference (INDISCON)•Aug 22, 2024•6 citations

Parallel and real-time post-processing for quantum random number generators

Xiaomin Guo, Lin, Fading, Lin, Jiehong +4 more

Quantum systems are particularly suited for generating true randomness due to their inherent unpredictability, which can be justified on physical principles. However, practical implementations of Quantum RNGs (QRNGs) are always subject to noise, or uncontrollable influences, diminishing the quality of raw randomness produced. This necessitates post-processing to convert raw output into genuine randomness. In current QRNG implementations, the critical issue of seed updating is often overlooked, risking security vulnerabilities due to increased security parameters when seeds are reused in post-processing, and frequent seed updates fail to yield net randomness, while reusing seeds relies on the assumption that the original sequence inputs are independent.In this work, we have provided a specific scheme for seed updates that balances practicality and security, exploring the parallel and real-time implementation of multiple seed real-time updating toeplitz hash extractors in an FPGA to achieve parallel QRNGs, focusing on efficient hardware computation resource use. Through logic optimization, we achieved a greater number of parallel channels and a post-processing matrix size three times larger than previous works on the same FPGA platform, utilizing fewer logic resources. This resulted in a higher rate of random number generation and enhanced security. Furthermore, with the use of higher-performance ADCs, we attained a random number production rate exceeding 20Gbps.High-speed random number transfer and seed updating were achieved using the PCIe high-speed interface.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:2403.19479•Mar 28, 2024•6 citations

Postprocessing for quantum random-number generators: Entropy evaluation and randomness extraction

Xiongfeng Ma, Feihu Xu, He Xu +3 more

Quantum random-number generators (QRNGs) can offer a means to generate information-theoretically provable random numbers, in principle. In practice, unfortunately, the quantum randomness is inevitably mixed with classical randomness due to classical noises. To distill this quantum randomness, one needs to quantify the randomness of the source and apply a randomness extractor. Here, we propose a generic framework for evaluating quantum randomness of real-life QRNGs by min-entropy, and apply it to two different existing quantum random-number systems in the literature. Moreover, we provide a guideline of QRNG data postprocessing for which we implement two information-theoretically provable randomness extractors: Toeplitz-hashing extractor and Trevisan's extractor.

arXiv:1207.1473•Physical Review A•Jun 21, 2013•250 citations

Engineering a Phase-Noise-Based Quantum Random Number Generator for Real-Time Secure Applications: Design, Validation, and Scalability

Anurag K. S. V., Shubham Chouhan, K. Srinivasan +2 more

Random Number Generators (RNGs) are crucial for applications ranging from cryptography to simulations. Depending on the source of randomness, RNGs are classified into Pseudo-Random Number Generators (PRNGs), True Random Number Generators (TRNGs), and Quantum Random Number Generators (QRNGs). This work presents the end-to-end development of a high-speed, high-efficiency, phase-noise-based QRNG system that taps into the quantum phase noise of a single-frequency laser, with randomness originating from spontaneous emission. Using a self-heterodyne measurement with a semiconductor laser (linewidth $\approx$ 5.23 $GHz$) operated near threshold and a $\sim$48 $cm$ fiber delay line, a raw data generation rate of 2.0 $Gbps$ is achieved. To ensure uniform randomness in the QRNG output, robust extraction techniques developed in-house, such as the Toeplitz Strong Extractor (TSE), are used. Randomness validation using the NIST and Diehard test suites confirms that all statistical tests pass at standard confidence levels. The developed system achieves a post-processed generation rate of 1.0 $Gbps$ in operation and attains a Technology Readiness Level (TRL) of 7, approaching TRL 8, making it suitable for real-time secure applications such as cryptographic key generation and stochastic modeling.

quant-pharXiv:2604.00741•International Conference on Optical and Wireless Technologies (OWT)•Apr 2, 2026•0 citations

Seed Renewable Parallel and Real-Time Toeplitz Post-Processing for QRNG

Fading Lin, Wenbo Ge, Zhijie Song +4 more

As a universal-hashing function, Toeplitz hashing is migrated in QRNG from privacy amplification of QKD to execute information-theoretically provable true randomness extraction. Though random seed needed for constructing a Toeplitz matrix is longer than the output string, Toeplitz-hashing extractor is still much more favored in practical implementation of QRNG because its relative simple structure and parallel operation property compared to the other universal-hashing strong extractor, Trevisan's extractor, especially in the booming integration realization of randomness extractor via FPGA. But two origin issues have been put off for long in the random number post-processing in FPGA besides chasing speed: collision probability threaten owing to small matrix and security parameter growth due to seed reuse. In this work, seed update and collision probability are both paid close attention when realize real-time parallel post-processing of CV-QRNG, who has a pretty practical prospect as well as greatest demand on post-processing both because of whose wide detection bandwidth and multibit discretization. We propose a sub-seed generation scheme based on reading and writing between two levels of memories in FPGA, which effectively avoid the consumption of logic resources. One seeds pool is built in storage element of the FPGA and distinct random seed is chosen for each post-processing instance by a random selection process. And the seeds pool is swiftly updated via PCIe interface once security parameter reaches a pre-set threshold. Furthermore, by elaborate layout of Toeplitz matrixes and two-layer parallel pipeline algorithm with TDM designed delicately, four-channel parallel seed renewable Toeplitz post-processing with matrix of about${\mathbf{1700}\mathbf {\, \times \, }\mathbf{2500}}$is realized with a real-time random number yield of 11.3 Gbps in one medium-configuration FPGA. In order to guarantee the robustness of the hardware-based parallel Toeplitz post-processing, timing is optimized by register replication, global clock buffers and data cache. This investigation fills an obvious hole in randomness extraction and provides a referential technique for privacy amplification.

Journal of Lightwave Technology•Aug 19, 2024•9 citations

Stream randomness extraction against quantum side information

Chun-Yang Luan, Cheng-Kang Pan, Xiang Zhang +1 more

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.

quant-pharXiv:2605.09556•May 12, 2026•1 citation
Abstract Random Number Generators (RNGs) are devices whose utility spans from cryptography to gambling. Depending on the source of the random seed, RNGs are classified as Pseudo-Random Number Generators (PRNGs), which are based on mathematical algorithms, True Random Number Generators (TRNGs) sourced through seemingly random physical processes, and finally, Quantum Random Number Generators (QRNGs) which harness the intrinsic randomness of measured outcomes of quantum states. To ensure that the output of a QRNG is private and nearly uniform, the raw data undergoes a strong extraction process such as Toeplitz or Trevisan Hashing. The extraction process needs to be extremely efficient to achieve high-speed random number generation. The present work demonstrates state-of-the-art methods for performing information-theoretically provable randomness extraction using variations of the Toeplitz Hashing algorithm. These algorithms are implemented on various hardware for comprehensive analysis. Subsequently, these methods are applied to two raw data sets from a PRNG source and a quantum source. A new benchmark of 19.5 Gbps for Randomness Extraction using the Fast Fourier Transform-based Toeplitz Strong Extractor is demonstrated in this work. The implementation of the algorithm on a GPU-based system demonstrates notably enhanced speed, marking a significant leap beyond the existing state-of-the-art implementations.
Quantum Random Number Generators (QRNGs) serve as high entropy sources for Quantum Key Distribution (QKD) systems. The raw data from quantum sources however require post-processing to generate a nearly uniform distribution. This work presents a state-of-the-art implementation of the Toeplitz Strong Extractor on an FPGA, achieving a benchmark extraction speed of 26.57 Gbps. A detailed implementation flow of the post-processing on FPGA is presented along with the various execution speeds obtained based on different randomness extraction ratios. Raw data from an in-house phase noise-based QRNG is processed on the FPGA using the implementation and the output is validated via the NIST STS 2.1.2 statistical randomness tests suite.
Quantum systems are particularly suited for generating true randomness due to their inherent unpredictability, which can be justified on physical principles. However, practical implementations of Quantum RNGs (QRNGs) are always subject to noise, or uncontrollable influences, diminishing the quality of raw randomness produced. This necessitates post-processing to convert raw output into genuine randomness. In current QRNG implementations, the critical issue of seed updating is often overlooked, risking security vulnerabilities due to increased security parameters when seeds are reused in post-processing, and frequent seed updates fail to yield net randomness, while reusing seeds relies on the assumption that the original sequence inputs are independent.In this work, we have provided a specific scheme for seed updates that balances practicality and security, exploring the parallel and real-time implementation of multiple seed real-time updating toeplitz hash extractors in an FPGA to achieve parallel QRNGs, focusing on efficient hardware computation resource use. Through logic optimization, we achieved a greater number of parallel channels and a post-processing matrix size three times larger than previous works on the same FPGA platform, utilizing fewer logic resources. This resulted in a higher rate of random number generation and enhanced security. Furthermore, with the use of higher-performance ADCs, we attained a random number production rate exceeding 20Gbps.High-speed random number transfer and seed updating were achieved using the PCIe high-speed interface.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.
Quantum random-number generators (QRNGs) can offer a means to generate information-theoretically provable random numbers, in principle. In practice, unfortunately, the quantum randomness is inevitably mixed with classical randomness due to classical noises. To distill this quantum randomness, one needs to quantify the randomness of the source and apply a randomness extractor. Here, we propose a generic framework for evaluating quantum randomness of real-life QRNGs by min-entropy, and apply it to two different existing quantum random-number systems in the literature. Moreover, we provide a guideline of QRNG data postprocessing for which we implement two information-theoretically provable randomness extractors: Toeplitz-hashing extractor and Trevisan's extractor.
Random Number Generators (RNGs) are crucial for applications ranging from cryptography to simulations. Depending on the source of randomness, RNGs are classified into Pseudo-Random Number Generators (PRNGs), True Random Number Generators (TRNGs), and Quantum Random Number Generators (QRNGs). This work presents the end-to-end development of a high-speed, high-efficiency, phase-noise-based QRNG system that taps into the quantum phase noise of a single-frequency laser, with randomness originating from spontaneous emission. Using a self-heterodyne measurement with a semiconductor laser (linewidth ≈\approx≈ 5.23 GHzGHzGHz) operated near threshold and a $\sim$48 cmcmcm fiber delay line, a raw data generation rate of 2.0 GbpsGbpsGbps is achieved. To ensure uniform randomness in the QRNG output, robust extraction techniques developed in-house, such as the Toeplitz Strong Extractor (TSE), are used. Randomness validation using the NIST and Diehard test suites confirms that all statistical tests pass at standard confidence levels. The developed system achieves a post-processed generation rate of 1.0 GbpsGbpsGbps in operation and attains a Technology Readiness Level (TRL) of 7, approaching TRL 8, making it suitable for real-time secure applications such as cryptographic key generation and stochastic modeling.
As a universal-hashing function, Toeplitz hashing is migrated in QRNG from privacy amplification of QKD to execute information-theoretically provable true randomness extraction. Though random seed needed for constructing a Toeplitz matrix is longer than the output string, Toeplitz-hashing extractor is still much more favored in practical implementation of QRNG because its relative simple structure and parallel operation property compared to the other universal-hashing strong extractor, Trevisan's extractor, especially in the booming integration realization of randomness extractor via FPGA. But two origin issues have been put off for long in the random number post-processing in FPGA besides chasing speed: collision probability threaten owing to small matrix and security parameter growth due to seed reuse. In this work, seed update and collision probability are both paid close attention when realize real-time parallel post-processing of CV-QRNG, who has a pretty practical prospect as well as greatest demand on post-processing both because of whose wide detection bandwidth and multibit discretization. We propose a sub-seed generation scheme based on reading and writing between two levels of memories in FPGA, which effectively avoid the consumption of logic resources. One seeds pool is built in storage element of the FPGA and distinct random seed is chosen for each post-processing instance by a random selection process. And the seeds pool is swiftly updated via PCIe interface once security parameter reaches a pre-set threshold. Furthermore, by elaborate layout of Toeplitz matrixes and two-layer parallel pipeline algorithm with TDM designed delicately, four-channel parallel seed renewable Toeplitz post-processing with matrix of about1700 × 2500{\mathbf{1700}\mathbf {\, \times \, }\mathbf{2500}}1700×2500is realized with a real-time random number yield of 11.3 Gbps in one medium-configuration FPGA. In order to guarantee the robustness of the hardware-based parallel Toeplitz post-processing, timing is optimized by register replication, global clock buffers and data cache. This investigation fills an obvious hole in randomness extraction and provides a referential technique for privacy amplification.
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) universal2_22​ 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.