Mutually testing source-device-independent quantum random number generator

Cheng, Jialin; Qin, Jiliang; Liang, Shaocong; Li, Jiatong; Yan, Zhihui; Jia, Xiaojun; Peng, Kunchi

doi:10.1364/prj.444853

Cited by 12 publications

(6 citation statements)

References 51 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To improve the security, an irreducible polynomial will be randomly generated as the characteristic polynomial in this study. If there is one entry in the higher 64 bits of the generated characteristic polynomial, the Toeplitz matrix will not be able to complete all the operations in a single cycle, which will considerably slow down the hash operation [ 20 , 21 , 22 , 23 ].…”

Section: Implementation Flow Of Hashing Algorithm Based On Variable C...mentioning

confidence: 99%

High-Speed Variable Polynomial Toeplitz Hash Algorithm Based on FPGA

Huang

Yin

et al. 2023

Entropy

View full text Add to dashboard Cite

In the Quantum Key Distribution (QKD) network, authentication protocols play a critical role in safeguarding data interactions among users. To keep pace with the rapid advancement of QKD technology, authentication protocols must be capable of processing data at faster speeds. The Secure Hash Algorithm (SHA), which functions as a cryptographic hash function, is a key technology in digital authentication. Irreducible polynomials can serve as characteristic functions of the Linear Feedback Shift Register (LFSR) to rapidly generate pseudo-random sequences, which in turn form the foundation of the hash algorithm. Currently, the most prevalent approach to hardware implementation involves performing block computations and pipeline data processing of the Toeplitz matrix in the Field-Programmable Gate Array (FPGA) to reach a maximum computing rate of 1 Gbps. However, this approach employs a fixed irreducible polynomial as the characteristic polynomial of the LFSR, which results in computational inefficiency as the highest bit of the polynomial restricts the width of parallel processing. Moreover, an attacker could deduce the irreducible polynomials utilized by an algorithm based on the output results, creating a serious concealed security risk. This paper proposes a method to use FPGA to implement variational irreducible polynomials based on a hashing algorithm. Our method achieves an operational rate of 6.8 Gbps by computing equivalent polynomials and updating the Toeplitz matrix with pipeline operations in real-time, which accelerates the authentication protocol while also significantly enhancing its security. Moreover, the optimization of this algorithm can be extended to quantum randomness extraction, leading to a considerable increase in the generation rate of random numbers.

show abstract

Section: Implementation Flow Of Hashing Algorithm Based On Variable C...mentioning

confidence: 99%

High-Speed Variable Polynomial Toeplitz Hash Algorithm Based on FPGA

Huang

Yin

et al. 2023

Entropy

View full text Add to dashboard Cite

show abstract

“…The device-independent QRNG (DI QRNG) 4 , 12 , 13 is able to access true randomness without any assumptions on the source and measurement devices, but it requires a loophole-free Bell test, resulting in great challenges in implementation and low efficiency. An alternative technique is semi-DI QRNG, where high speed and low-cost information-provable randomness can be generated based on a few justifiable assumptions on the system operation and its critical components, such as trusted sources, 14 – 17 the characterized measurement settings, 18 – 24 assumptions on the indistinguishability, or dimension of the input states 25 – 28 …”

Section: Introductionmentioning

confidence: 99%

“…One kind of approach is based on measurement of the vacuum noise via homodyne detection 23 , 29 – 31 Benefiting from the fast detection speed, such a technique has achieved a random number generation rate as high as gigabits per second (Gbps); however, the homodyne detection requires a well modeled and calibrated local oscillator.…”

Section: Introductionmentioning

confidence: 99%

“…One kind of approach is based on measurement of the vacuum noise via homodyne detection. 23,[29][30][31] Benefiting from the fast detection speed, such a technique has achieved a random number generation rate as high as gigabits per second (Gbps); however, the homodyne detection requires a well modeled and calibrated local oscillator. In contrast, the single-photon detection technique, despite the drawback on detection speed, has the merit of easy operation and simple structure.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Realization of a source-device-independent quantum random number generator secured by nonlocal dispersion cancellation

Zhang

Sun

et al. 2023

Adv. Photon.

View full text Add to dashboard Cite

Quantum random number generators (QRNGs) can provide genuine randomness by exploiting the intrinsic probabilistic nature of quantum mechanics, which play important roles in many applications. However, the true randomness acquisition could be subjected to attacks from untrusted devices involved or their deviations from the theoretical modeling in real-life implementation. We propose and experimentally demonstrate a source-device-independent QRNG, which enables one to access true random bits with an untrusted source device. The random bits are generated by measuring the arrival time of either photon of the time-energy entangled photon pairs produced from spontaneous parametric downconversion, where the entanglement is testified through the observation of nonlocal dispersion cancellation. In experiment, we extract a generation rate of 4 Mbps by a modified entropic uncertainty relation, which can be improved to gigabits per second by using advanced single-photon detectors. Our approach provides a promising candidate for QRNGs with no characterization or error-prone source devices in practice.

show abstract

“…Thus, we unavoidably consider the tradeoff between the security and the generation rate [22][23][24]. An adoptable choice is the source-independent QRNG (SI-QRNG) [25][26][27][28][29][30], in which the detection devices are assumed to be trusted, unlike in device-independent QRNGs.…”

mentioning

confidence: 99%

Source-independent quantum random number generator against detector blinding attacks

Liu

et al. 2022

Preprint

View full text Add to dashboard Cite

Randomness, mainly in the form of random numbers, is the fundamental prerequisite for the security of many cryptographic tasks. Quantum randomness can be extracted even if adversaries are fully aware of the protocol and even control the randomness source. However, an adversary can further manipulate the randomness via detector blinding attacks, which are a hacking attack suffered by protocols with trusted detectors. Here, by treating no-click events as valid error events, we propose a quantum random number generation protocol that can simultaneously address source vulnerability and ferocious detector blinding attacks. The method can be extended to high-dimensional random number generation. We experimentally demonstrate the ability of our protocol to generate random numbers for two-dimensional measurement with a generation speed of 0.515 Mbps, which is two orders of magnitude higher than that of device-independent protocols that can address both issues of imperfect sources and imperfect detectors.

show abstract

Mutually testing source-device-independent quantum random number generator

Cited by 12 publications

References 51 publications

High-Speed Variable Polynomial Toeplitz Hash Algorithm Based on FPGA

High-Speed Variable Polynomial Toeplitz Hash Algorithm Based on FPGA

Realization of a source-device-independent quantum random number generator secured by nonlocal dispersion cancellation

Source-independent quantum random number generator against detector blinding attacks

Contact Info

Product

Resources

About