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

arXiv:1802.07368 · International Journal of Numerical Modelling Electronic Networks Devices and Fields

Gaussian random number generator: Implemented in FPGA for quantum key distribution

Yue Hu, Yan Wu, Yi Chen, Guo Chun Wan, Mei Song Tong

Published Jan 31, 2019• 12 citations
arXivHTMLPDF

Abstract

Abstract Quantum key distribution is the process of using quantum communication to establish a shared key between two parties. It has been demonstrated the unconditional security and effective communication of quantum communication system can be guaranteed by an excellent Gaussian random number (GRN) generator with high speed and an extended random period. In this paper, we propose to construct the Gaussian random number generator by using field‐programmable gate array (FPGA), which is able to process large data in high speed. We also compare three algorithms of GRN generation: Box‐Muller algorithm, polarization decision algorithm, and central limit algorithm. We demonstrate that the polarization decision algorithm implemented in FPGA requires less computing resources and also produces a high‐quality GRN through the null hypothesis test.

DOI
10.1002/jnm.2554

Related papers

Gaussian Random Number Generator Based on FPGA

Yue Hu, Yan Xiang Wu, Y. Chen +1 more

Based on the research of the current situation of continuous variables quantum cryptographic key QCK and in order to guarantee the effect of communication, we aim to build a quantum communication system based on Reverse Reconciliation Protocol. Thus, a good Gaussian Random Number Generator based on FPGA (Field Programmable Gate Array) is proposed in this paper which can run fast and acquire a high throughput per slice. In this paper, Gaussian random number generator is based on the analysis of Box-Muller algorithm. Besides, seeds for Gaussian random number are input by mechanical keyboard which joggles randomly. Implementation results on Altera FPGA show that the proposed hardware design could generate Gaussian random number with period of $2^{32}-1$. Finally, we get the mean values, variances, maximum deviations and distribution diagrams of the generated Gaussian random numbers(GRN) by importing these data into Matlab. To assess the quality of these generated GRN, we further compare them to these GRN generated by Matlab.

•Feb 20, 2018•2 citations

Design of Gaussian modulator for continuous-variable quantum key distribution

Xiunan Sun, Hao Liang

The continuous-variable quantum key distribution experimental system requires the randomness and speed of a Gaussian modulator. We present the hardware design for a Gaussian random number (GRN) generator based on the Box–Muller method, which can be implemented on a field-programmable gate array (FPGA). An external high-speed true random number generator application-specific integrated circuit (ASIC) is used to this end. The ASIC operates faster and more independently compared with other Gaussian algorithms based on a linear feedback shift register. The trigonometric and logarithmic functions are calculated using the nonuniform piecewise linear approximation. The calculation of the Gaussian random modulus and phase value is realized using this hardware. Compared with an arbitrary waveform generator, the GRN can be uploaded to a computer to estimate the security key rate. Furthermore, the GRN generator accurately provides a Gaussian probability density function that passes the Jarque–Bera inspection and Lilliefors tests. The proposed FPGA-based system is demonstrated to convert eight-channel 320-Mbps uniform random numbers to 40-MHz 16-bit GRN in real time. Finally, the control of the optical module and Gaussian modulation is realized via the FPGA-based outputs of four dual-channel, 16-bit, 1-giga samples per second digital-to-analog converters.

Optical Engineering•Dec 29, 2021•1 citation

Efficient Hardware Implementation for Quantum key Distribution Protocol using FPGA

Yasir Amer Abbas, Alharith A. Abdullah

Abstract This paper presents a new hardware implementation of the quantum key distributed cryptography protocol using Field Programmable Gate Array (FPGA). In many security applications, the software implementations of key distribution algorithms are slow and inefficient. In order to solve this problems, new hardware architecture was proposed to speed up the performance and flexibility of key distribution algorithms. The concurrent computing designs quantum key distribution protocol with reducing the hardware area, producing a high throughput and low latency. It also showed high speed processing and consumed low power. An efficient hardware architectural model for quantum key distribution protocol was developed using very high-speed integrated circuit hardware description language (VHDL). This hardware designed to be used with any quantum key distribution protocol to distribution the secret key securely. The hardware implemented and test with Spartan-3 FPGA board and the results show a throughput of 8 Mbps and efficiency of 1.6 Mbps/slice.

IOP Conference Series Materials Science and Engineering•Feb 1, 2021•5 citations

Quantum Random Number Generation for 1.25-GHz Quantum Key Distribution Systems

Anthony Martin, Bruno Sanguinetti, Charles Ci Wen Lim +2 more

Security proofs of quantum key distribution (QKD) systems usually assume that the users have access to source of perfect randomness. State-of-the-art QKD systems run at frequencies in the gigahertz range, requiring a sustained gigahertz rate of generation and acquisition of quantum random numbers. In this paper, we demonstrate such a high-speed random number generator. The entropy source is based on an amplified spontaneous emission from an erbium-doped fibre, which is directly acquired using a standard small form-factor pluggable module. The module connects to the field programmable gate array (FPGA) of a QKD system. A real-time randomness extractor is implemented in the FPGA, and achieves a sustained rate of 1.25 Gb/s of provably random bits.

arXiv:1504.07769•Journal of Lightwave Technology•Apr 7, 2015•47 citations

Simulation of the BB84 quantum key distribution algorithm on FPGA

Artem M. Sherstobitov

The paper presents a new method for simulating physical layer of the BB84 quantum key distribution protocol and its implementation on a field programmable gate array (FPGA). The p5hoton polarization state is set using two clock signals generated in the internal FPGA generator. The process of measuring the polarization state of a photon is modeled using a detector based on an «XOR» logic gate. The results of testing the implementation of this method on FPGA are in a good agreement with the theory.

Journal of Radio Electronics•Feb 1, 2025•0 citations

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
Abstract Quantum key distribution is the process of using quantum communication to establish a shared key between two parties. It has been demonstrated the unconditional security and effective communication of quantum communication system can be guaranteed by an excellent Gaussian random number (GRN) generator with high speed and an extended random period. In this paper, we propose to construct the Gaussian random number generator by using field‐programmable gate array (FPGA), which is able to process large data in high speed. We also compare three algorithms of GRN generation: Box‐Muller algorithm, polarization decision algorithm, and central limit algorithm. We demonstrate that the polarization decision algorithm implemented in FPGA requires less computing resources and also produces a high‐quality GRN through the null hypothesis test.
Based on the research of the current situation of continuous variables quantum cryptographic key QCK and in order to guarantee the effect of communication, we aim to build a quantum communication system based on Reverse Reconciliation Protocol. Thus, a good Gaussian Random Number Generator based on FPGA (Field Programmable Gate Array) is proposed in this paper which can run fast and acquire a high throughput per slice. In this paper, Gaussian random number generator is based on the analysis of Box-Muller algorithm. Besides, seeds for Gaussian random number are input by mechanical keyboard which joggles randomly. Implementation results on Altera FPGA show that the proposed hardware design could generate Gaussian random number with period of 232−12^{32}-1232−1. Finally, we get the mean values, variances, maximum deviations and distribution diagrams of the generated Gaussian random numbers(GRN) by importing these data into Matlab. To assess the quality of these generated GRN, we further compare them to these GRN generated by Matlab.
The continuous-variable quantum key distribution experimental system requires the randomness and speed of a Gaussian modulator. We present the hardware design for a Gaussian random number (GRN) generator based on the Box–Muller method, which can be implemented on a field-programmable gate array (FPGA). An external high-speed true random number generator application-specific integrated circuit (ASIC) is used to this end. The ASIC operates faster and more independently compared with other Gaussian algorithms based on a linear feedback shift register. The trigonometric and logarithmic functions are calculated using the nonuniform piecewise linear approximation. The calculation of the Gaussian random modulus and phase value is realized using this hardware. Compared with an arbitrary waveform generator, the GRN can be uploaded to a computer to estimate the security key rate. Furthermore, the GRN generator accurately provides a Gaussian probability density function that passes the Jarque–Bera inspection and Lilliefors tests. The proposed FPGA-based system is demonstrated to convert eight-channel 320-Mbps uniform random numbers to 40-MHz 16-bit GRN in real time. Finally, the control of the optical module and Gaussian modulation is realized via the FPGA-based outputs of four dual-channel, 16-bit, 1-giga samples per second digital-to-analog converters.
Abstract This paper presents a new hardware implementation of the quantum key distributed cryptography protocol using Field Programmable Gate Array (FPGA). In many security applications, the software implementations of key distribution algorithms are slow and inefficient. In order to solve this problems, new hardware architecture was proposed to speed up the performance and flexibility of key distribution algorithms. The concurrent computing designs quantum key distribution protocol with reducing the hardware area, producing a high throughput and low latency. It also showed high speed processing and consumed low power. An efficient hardware architectural model for quantum key distribution protocol was developed using very high-speed integrated circuit hardware description language (VHDL). This hardware designed to be used with any quantum key distribution protocol to distribution the secret key securely. The hardware implemented and test with Spartan-3 FPGA board and the results show a throughput of 8 Mbps and efficiency of 1.6 Mbps/slice.
Security proofs of quantum key distribution (QKD) systems usually assume that the users have access to source of perfect randomness. State-of-the-art QKD systems run at frequencies in the gigahertz range, requiring a sustained gigahertz rate of generation and acquisition of quantum random numbers. In this paper, we demonstrate such a high-speed random number generator. The entropy source is based on an amplified spontaneous emission from an erbium-doped fibre, which is directly acquired using a standard small form-factor pluggable module. The module connects to the field programmable gate array (FPGA) of a QKD system. A real-time randomness extractor is implemented in the FPGA, and achieves a sustained rate of 1.25 Gb/s of provably random bits.
The paper presents a new method for simulating physical layer of the BB84 quantum key distribution protocol and its implementation on a field programmable gate array (FPGA). The p5hoton polarization state is set using two clock signals generated in the internal FPGA generator. The process of measuring the polarization state of a photon is modeled using a detector based on an «XOR» logic gate. The results of testing the implementation of this method on FPGA are in a good agreement with the theory.
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.