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:2102.02252

Source Independent Quantum Walk Random Number Generation

Minwoo Bae, Walter O. Krawec

Published Feb 3, 2021• 1 citation
arXivHTMLPDF

Abstract

Source independent quantum random number generators (SI-QRNG) are cryptographic protocols which attempt to extract random strings from quantum sources where the source is under the control of an adversary while the measurement devices are fully characterized. This represents a middle-ground between fully-trusted and full-device independence, allowing for fast bit-generation rates with current-day technology, while also providing a strong security guarantee. In this paper we analyze an SI-QRNG protocol based on quantum walks and develop a new proof technique to show security.

DOI
10.48550/arxiv.2102.02252

Related papers

Semi-Source Independent Quantum Walk Random Number Generation

Minwoo Bae, Walter O. Krawec

Semi-source independent quantum random number generators (SI-QRNG) are cryptographic protocols which attempt to extract random strings from quantum sources where the source is under the control of an adversary (but with known dimension) while the measurement devices are fully characterized. This represents a middle-ground between fully-trusted and full-device independence, allowing for fast bit-generation rates with current-day technology, while also providing a strong security guarantee. In this paper we analyze a SI-QRNG protocol based on quantum walks and develop a proof of security. We derive a novel entropic uncertainty relation for this application which is necessary since standard relations actually fail in this case.

IEEE Information Theory Workshop (ITW)•Oct 17, 2021•4 citations

Quantum Walk Random Number Generation: Memory-based Models

Minu J. Bae

The semi-source independent quantum walk random number generator (SI-QW-QRNG) is a cryptographic protocol that extracts a string of true random bits from a quantum random walk with an adversary controls a randomness source, but the dimension of the system is known. This paper analyzes SI-QW-QRNG protocols with a memory-based quantum walk state. The new protocol utilizes a generalized coin operator with various parameters to optimize the randomness of the quantum walk state. We focus on evaluations of the protocols in multiple scenarios and walk configurations. Moreover, we show some interesting behavior of the system depending on the size of the memory space and the number of quantum coins.

arXiv:2207.08973•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 1, 2022•3 citations

Security analysis and improvement of source independent quantum random number generators with imperfect devices

Xing Ping Lin, Shuang Wang, Zhen-Qiang Yin +7 more

Abstract A quantum random number generator (QRNG) as a genuine source of randomness is essential in many applications, such as number simulation and cryptography. Recently, a source-independent quantum random number generator (SI-QRNG), which can generate secure random numbers with untrusted sources, has been realized. However, the measurement loopholes of the trusted but imperfect devices used in SI-QRNGs have not yet been fully explored, which will cause security problems, especially in high-speed systems. Here, we point out and evaluate the security loopholes of practical imperfect measurement devices in SI-QRNGs. We also provide corresponding countermeasures to prevent these information leakages by recalculating the conditional minimum entropy and adding a monitor. Furthermore, by taking into account the finite-size effect, we show that the influence of the afterpulse can exceed that of the finite-size effect with the large number of sampled rounds. Our protocol is simple and effective, and it promotes the security of SI-QRNG in practice as well as the compatibility with high-speed measurement devices, thus paving the way for constructing ultrafast and security-certified commercial SI-QRNG systems.

arXiv:2101.04327•npj Quantum Information•Dec 10, 2020•23 citations

Security analysis and improvement of source independent quantum random number generators with imperfect devices

Xing Lin, Shuang Wang, Zhen−Qiang Yin +7 more

Recently, a source-independent quantum random number generator (SI-QRNG), which can generate secure random numbers with untrusted sources, has been realized. However, the measurement loopholes of the trusted but imperfect devices used in SI-QRNGs have not yet been fully explored. Here, we point out and evaluate the security loopholes of practical imperfect measurement devices in SI-QRNGs. We also provide corresponding countermeasures to prevent these information leakages by recalculating the conditional minimum entropy and adding a monitor. Furthermore, by taking into account the finite-size effect, we show that the influence of the afterpulse can exceed that of the finite-size effect with the large number of sampled rounds. Our protocol is simple and effective, and it promotes the security of SI-QRNG in practice as well as the compatibility with high-speed measurement evices, thus paving the way for constructing ultrafast and security-certified commercial SI-QRNG systems.

SPIE Conference on Quantum and Nonlinear Optics•Oct 8, 2021•1 citation

Imperfection-insensitivity quantum random number generator with untrusted daily illumination

Xing Ping Lin, Rong Wang, Shuang Wang +6 more

Quantum random number generators (QRNGs) promise secure randomness generation based on the foundational unpredictability of quantum mechanics. However, the unavoidable gaps between theoretical models and practical devices could lead to security invalidation. Recently, a source-independent quantum random number generator (SI-QRNG) has been proposed to solve the issue of uncharacteristic sources. However, in most current analyses of SI-QRNG protocols, the security proofs with imperfect measurements are individual for different factors and very sensitive to small deviations from theoretical models. Here, we establish a unified model for imperfect measurements in the SI-QRNG and provide a tight rate bound based on the uncertainty relation for smooth entropies. Then the performance with large device imperfections is evaluated and the randomness rate in our model can approach a similar order of magnitude of the rate upper bound in common discrete variable QRNGs. In addition, by utilizing the daily illumination and measurement devices with large imperfections, we experimentally demonstrate our scheme at the rate of the order of magnitude of Mbps.

Optics Express•Jun 22, 2022•14 citations

Source-independent quantum random number generator against detector blinding attacks

Wen‐Bo Liu, Yu-Shuo Lu, Yao Fu +5 more

Abstract 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.

•May 10, 2022•1 citation
Source independent quantum random number generators (SI-QRNG) are cryptographic protocols which attempt to extract random strings from quantum sources where the source is under the control of an adversary while the measurement devices are fully characterized. This represents a middle-ground between fully-trusted and full-device independence, allowing for fast bit-generation rates with current-day technology, while also providing a strong security guarantee. In this paper we analyze an SI-QRNG protocol based on quantum walks and develop a new proof technique to show security.
Semi-source independent quantum random number generators (SI-QRNG) are cryptographic protocols which attempt to extract random strings from quantum sources where the source is under the control of an adversary (but with known dimension) while the measurement devices are fully characterized. This represents a middle-ground between fully-trusted and full-device independence, allowing for fast bit-generation rates with current-day technology, while also providing a strong security guarantee. In this paper we analyze a SI-QRNG protocol based on quantum walks and develop a proof of security. We derive a novel entropic uncertainty relation for this application which is necessary since standard relations actually fail in this case.
The semi-source independent quantum walk random number generator (SI-QW-QRNG) is a cryptographic protocol that extracts a string of true random bits from a quantum random walk with an adversary controls a randomness source, but the dimension of the system is known. This paper analyzes SI-QW-QRNG protocols with a memory-based quantum walk state. The new protocol utilizes a generalized coin operator with various parameters to optimize the randomness of the quantum walk state. We focus on evaluations of the protocols in multiple scenarios and walk configurations. Moreover, we show some interesting behavior of the system depending on the size of the memory space and the number of quantum coins.
Abstract A quantum random number generator (QRNG) as a genuine source of randomness is essential in many applications, such as number simulation and cryptography. Recently, a source-independent quantum random number generator (SI-QRNG), which can generate secure random numbers with untrusted sources, has been realized. However, the measurement loopholes of the trusted but imperfect devices used in SI-QRNGs have not yet been fully explored, which will cause security problems, especially in high-speed systems. Here, we point out and evaluate the security loopholes of practical imperfect measurement devices in SI-QRNGs. We also provide corresponding countermeasures to prevent these information leakages by recalculating the conditional minimum entropy and adding a monitor. Furthermore, by taking into account the finite-size effect, we show that the influence of the afterpulse can exceed that of the finite-size effect with the large number of sampled rounds. Our protocol is simple and effective, and it promotes the security of SI-QRNG in practice as well as the compatibility with high-speed measurement devices, thus paving the way for constructing ultrafast and security-certified commercial SI-QRNG systems.
Recently, a source-independent quantum random number generator (SI-QRNG), which can generate secure random numbers with untrusted sources, has been realized. However, the measurement loopholes of the trusted but imperfect devices used in SI-QRNGs have not yet been fully explored. Here, we point out and evaluate the security loopholes of practical imperfect measurement devices in SI-QRNGs. We also provide corresponding countermeasures to prevent these information leakages by recalculating the conditional minimum entropy and adding a monitor. Furthermore, by taking into account the finite-size effect, we show that the influence of the afterpulse can exceed that of the finite-size effect with the large number of sampled rounds. Our protocol is simple and effective, and it promotes the security of SI-QRNG in practice as well as the compatibility with high-speed measurement evices, thus paving the way for constructing ultrafast and security-certified commercial SI-QRNG systems.
Quantum random number generators (QRNGs) promise secure randomness generation based on the foundational unpredictability of quantum mechanics. However, the unavoidable gaps between theoretical models and practical devices could lead to security invalidation. Recently, a source-independent quantum random number generator (SI-QRNG) has been proposed to solve the issue of uncharacteristic sources. However, in most current analyses of SI-QRNG protocols, the security proofs with imperfect measurements are individual for different factors and very sensitive to small deviations from theoretical models. Here, we establish a unified model for imperfect measurements in the SI-QRNG and provide a tight rate bound based on the uncertainty relation for smooth entropies. Then the performance with large device imperfections is evaluated and the randomness rate in our model can approach a similar order of magnitude of the rate upper bound in common discrete variable QRNGs. In addition, by utilizing the daily illumination and measurement devices with large imperfections, we experimentally demonstrate our scheme at the rate of the order of magnitude of Mbps.
Abstract 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.