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

Delegated verification of quantum randomness with linear optics

Rodrigo Piera, Jaideep Taggart Singh, Yury Kurochkin, James A. Grieve

Published Nov 29, 2024• 0 citations
arXivHTMLPDF

Abstract

Randomness is a critical resource of modern cryptosystems. Quantum mechanics offers the best properties of an entropy source in terms of unpredictability. However, these sources are often fragile and can fail silently. Therefore, statistical tests on their outputs should be performed continuously. Testing a sequence for randomness can be very resource-intensive, especially for longer sequences, and transferring this to other systems can put the secrecy at risk. In this paper, we present a method that allows a third party to publicly perform statistical testing without compromising the confidentiality of the random bits by connecting the quality of a public sequence to the private sequence generated using a quantum process. We implemented our protocol over two different optical systems and compared them.

DOI
10.48550/arxiv.2411.19677

Related papers

A privacy-preserving publicly verifiable quantum random number generator

Tanvirul Islam, Anindya Banerji, Chin Jia Boon +5 more

Verifying the quality of a random number generator involves performing computationally intensive statistical tests on large data sets commonly in the range of gigabytes. Limitations on computing power can restrict an end-user's ability to perform such verification. There are also random number-based applications where an honest user needs to publicly demonstrate that the random bits they are using pass the statistical tests without the bits being revealed. Here, we report the implementation of an entanglement-based protocol that allows a third party to publicly perform statistical tests without compromising the privacy of the random bits.

Scientific Reports•May 17, 2024•2 citations

A privacy-preserving publicly verifiable quantum random number generator

Tanvirul Islam, Banerji, Anindya, Chin Jia Boon +5 more

Verifying the quality of a random number generator involves performing computationally intensive statistical tests on large data sets commonly in the range of gigabytes. Limitations on computing power can restrict an end-user's ability to perform such verification. There are also applications where the user needs to publicly demonstrate that the random bits they are using pass the statistical tests without the bits being revealed. We report the implementation of an entanglement-based protocol that allows a third party to publicly perform statistical tests without compromising the privacy of the random bits.

arXiv:2305.10909•May 18, 2023•0 citations

A privacy-preserving publicly verifiable quantum random number generator

Tanvirul Islam, Anindya Banerji, Chin Jia Boon +5 more

Abstract Verifying the quality of a random number generator involves performing computationally intensive statistical tests on large data sets commonly in the range of gigabytes. Limitations on computing power can restrict an end-user's ability to perform such verification. There are also random number-based applications where the user needs to publicly demonstrate that the random bits they are using pass the statistical tests without the bits being revealed. Here, we report the implementation of an entanglement-based protocol that allows a third party to publicly perform statistical tests without compromising the privacy of the random bits.

•Dec 28, 2023•0 citations

Quantum random number generators with entanglement for public randomness testing

Janusz Edward Jacak, Witold Aleksander Jacak, Wojciech A. Donderowicz +1 more

We discuss a simple idealistic quantum entanglement based protocol for quantum random number generation allowing a trusted third party to publicly perform arbitrarily complex tests of randomness without any violation of the secrecy of the generated bit sequences. The protocol diminishes also an average time of the randomness testing (thus enabling arbitrary shortening of this time with increasing number of entangled qubits).

Scientific Reports•Jan 13, 2020•31 citations

Real-time Processing System for a Quantum Random Number Generator

Balázs Solymos, László Bacsárdi

Quantum random number generators (QRNG) provide quality random numbers, which are essential for cryptography by utilizing the unpredictable nature of quantum mechanics.Advancements in quantum optics made multiple different architectures for these possible.As part of a project aiming to realize a QRNG service, we developed a system capable of providing real-time monitoring and long term data collection while still fulfilling regular processing duties for these devices.In most cases, hardware validation is done by simply running a battery of statistical tests on the final output.Our goal, however, was to create a system allowing more flexible use of these tests, realizing a tool that can also prove useful during the construction of our entropy source for detecting and correcting unique imperfections.We tested this flexibility and the system's ability to adequately perform the required tasks with simulated sources while further examining the usability of available verification tools within this new custom framework.

Híradástechnika/Infocommunications journal•Jan 1, 2020•3 citations

Quantum generators of random numbers

Marcin M. Jacak, Piotr Paweł Jóźwiak, Jakub Niemczuk +1 more

Generation of random numbers is a central problem for many applications in the field of information processing, including, e.g., cryptography, in classical and quantum regime, but also mathematical modeling, Monte Carlo methods, gambling and many others. Both, the quality of the randomness and efficiency of the random numbers generation process are crucial for the most of these applications. Software produced pseudorandom bit sequences, though sufficiently quick, do not fulfill required randomness quality demands. Hence, the physical hardware methods are intensively developed to generate truly random number sequences for information processing and electronic security application. In the present paper we discuss the idea of the quantum random number generators. We also present a variety of tests utilized to assess the quality of randomness of generated bit sequences. In the experimental part we apply such tests to assess and compare two quantum random number generators, PQ4000KSI (of company ComScire US) and JUR01 (constructed in Wroclaw University of Science and Technology upon the project of The National Center for Research and Development) as well as a pseudorandom generator from the Mathematica Wolfram package. Finally, we present our new prototype of fully operative miniaturized quantum random generator JUR02 producing a random bit sequence with velocity of 1 Mb/s, which successfully passed standard tests of randomness quality (like NIST and Dieharder tests). We also shortly discuss our former concept of an entanglement-based quantum random number generator protocol with unconditionally secure public randomness verification.

Scientific Reports•Aug 9, 2021•85 citations
Randomness is a critical resource of modern cryptosystems. Quantum mechanics offers the best properties of an entropy source in terms of unpredictability. However, these sources are often fragile and can fail silently. Therefore, statistical tests on their outputs should be performed continuously. Testing a sequence for randomness can be very resource-intensive, especially for longer sequences, and transferring this to other systems can put the secrecy at risk. In this paper, we present a method that allows a third party to publicly perform statistical testing without compromising the confidentiality of the random bits by connecting the quality of a public sequence to the private sequence generated using a quantum process. We implemented our protocol over two different optical systems and compared them.
Verifying the quality of a random number generator involves performing computationally intensive statistical tests on large data sets commonly in the range of gigabytes. Limitations on computing power can restrict an end-user's ability to perform such verification. There are also random number-based applications where an honest user needs to publicly demonstrate that the random bits they are using pass the statistical tests without the bits being revealed. Here, we report the implementation of an entanglement-based protocol that allows a third party to publicly perform statistical tests without compromising the privacy of the random bits.
Verifying the quality of a random number generator involves performing computationally intensive statistical tests on large data sets commonly in the range of gigabytes. Limitations on computing power can restrict an end-user's ability to perform such verification. There are also applications where the user needs to publicly demonstrate that the random bits they are using pass the statistical tests without the bits being revealed. We report the implementation of an entanglement-based protocol that allows a third party to publicly perform statistical tests without compromising the privacy of the random bits.
Abstract Verifying the quality of a random number generator involves performing computationally intensive statistical tests on large data sets commonly in the range of gigabytes. Limitations on computing power can restrict an end-user's ability to perform such verification. There are also random number-based applications where the user needs to publicly demonstrate that the random bits they are using pass the statistical tests without the bits being revealed. Here, we report the implementation of an entanglement-based protocol that allows a third party to publicly perform statistical tests without compromising the privacy of the random bits.
Quantum random number generators (QRNG) provide quality random numbers, which are essential for cryptography by utilizing the unpredictable nature of quantum mechanics.Advancements in quantum optics made multiple different architectures for these possible.As part of a project aiming to realize a QRNG service, we developed a system capable of providing real-time monitoring and long term data collection while still fulfilling regular processing duties for these devices.In most cases, hardware validation is done by simply running a battery of statistical tests on the final output.Our goal, however, was to create a system allowing more flexible use of these tests, realizing a tool that can also prove useful during the construction of our entropy source for detecting and correcting unique imperfections.We tested this flexibility and the system's ability to adequately perform the required tasks with simulated sources while further examining the usability of available verification tools within this new custom framework.
Generation of random numbers is a central problem for many applications in the field of information processing, including, e.g., cryptography, in classical and quantum regime, but also mathematical modeling, Monte Carlo methods, gambling and many others. Both, the quality of the randomness and efficiency of the random numbers generation process are crucial for the most of these applications. Software produced pseudorandom bit sequences, though sufficiently quick, do not fulfill required randomness quality demands. Hence, the physical hardware methods are intensively developed to generate truly random number sequences for information processing and electronic security application. In the present paper we discuss the idea of the quantum random number generators. We also present a variety of tests utilized to assess the quality of randomness of generated bit sequences. In the experimental part we apply such tests to assess and compare two quantum random number generators, PQ4000KSI (of company ComScire US) and JUR01 (constructed in Wroclaw University of Science and Technology upon the project of The National Center for Research and Development) as well as a pseudorandom generator from the Mathematica Wolfram package. Finally, we present our new prototype of fully operative miniaturized quantum random generator JUR02 producing a random bit sequence with velocity of 1 Mb/s, which successfully passed standard tests of randomness quality (like NIST and Dieharder tests). We also shortly discuss our former concept of an entanglement-based quantum random number generator protocol with unconditionally secure public randomness verification.