Certified Randomness from Untrusted Sources and Uncharacterized Measurements

Lin, Xing Ping; Wang, Rong; Wang, Shuang; Yin, Zhen‐Qiang; Chen, Wei; Guo, Guang-Can; Han, Zheng‐Fu

doi:10.1103/physrevlett.129.050506

Cited by 16 publications

(9 citation statements)

References 43 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…chip-scale SPDs operating at room temperature 62,63 . Furthermore, an intriguing approach involves integrating our proposed SI-QRNGs with advanced security protocols 43 to enhance the overall system's security.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Source-independent quantum random number generators with integrated silicon photonics

Wei,

Du,

Hua

et al. 2024

Preprint

View full text Add to dashboard Cite

Random numbers play a crucial role in numerous scientific applications. Source-independent quantum random number generators (SI-QRNGs) can offer true randomness by leveraging the fundamental principles of quantum mechanics, eliminating the need for a trusted source. Silicon photonics shows great promise for QRNG due to its benefits in miniaturization, cost-effective device manufacturing, and compatibility with CMOS microelectronics. In this study, we experimentally demonstrate a silicon-based discrete variable SI-QRNG. Using a well-calibrated chip and an optimized parameter strategy, we have achieved the highest quantum random number generation rate of 7.9 Mbits/s. Our research paves the way for integrated SI-QRNGs.

show abstract

Section: Discussionmentioning

confidence: 99%

“…Ref. 42,43 take into account more comprehensive imperfection factors related to measurement devices.…”

Section: /9mentioning

confidence: 99%

Source-independent quantum random number generators with integrated silicon photonics

Wei,

Du,

Hua

et al. 2024

Preprint

View full text Add to dashboard Cite

show abstract

“…However, statistical randomness testing cannot discern whether the tested strings originate from a genuine quantum process and have not been generated algorithmically [16]. Various self-testing and semi-self-testing protocols have been formulated [37][38][39] to address this issue.…”

Section: Device Independencementioning

confidence: 99%

Photonic ternary quantum random number generators

Trejo

Calude

2023

Proc. R. Soc. A.

View full text Add to dashboard Cite

We construct a class of three-dimensional photonic quantum random number generators (QRNGs) and prove that each of them generates maximally unpredictable digits via measurements that are robust to errors. This shows that every sequence generated is strongly incomputable; hence its quality is provably better than that of every pseudo-random sequence. These results suggest that incomputability in physics is real and practically applicable. Finally, we present photonic implementations of three-dimensional QRNGs and discuss device independence.

show abstract

“…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

Certified Randomness from Untrusted Sources and Uncharacterized Measurements

Cited by 16 publications

References 43 publications

Source-independent quantum random number generators with integrated silicon photonics

Source-independent quantum random number generators with integrated silicon photonics

Photonic ternary quantum random number generators

High-Speed Variable Polynomial Toeplitz Hash Algorithm Based on FPGA

Contact Info

Product

Resources

About