Skip to main content

Quantum Leap and Crash: Searching and Finding Bias in Quantum Random Number Generators

Hurley-Smith, Darren, Hernandez-Castro, Julio (2020) Quantum Leap and Crash: Searching and Finding Bias in Quantum Random Number Generators. ACM Transactions on Privacy and Security, 23 (3). pp. 1-25. ISSN 2471-2566. (doi:10.1145/3398726) (KAR id:81957)

PDF Author's Accepted Manuscript
Language: English
Download this file
(PDF/5MB)
[thumbnail of Quantum_Leap_TOPS_Submission_FINAL.pdf]
Request a format suitable for use with assistive technology e.g. a screenreader
PDF Publisher pdf
Language: English

Restricted to Repository staff only
Contact us about this Publication
[thumbnail of QLC.pdf]
Official URL:
https://doi.org/10.1145/3398726

Abstract

Random numbers are essential for cryptography and scientific simulation. Generating truly random numbers for cryptography can be a slow and expensive process. Quantum physics offers a variety of promising solutions to this challenge, proposing sources of entropy that may be genuinely unpredictable, based on the inherent randomness of certain physical phenomena. These properties have been employed to design Quantum Random Number Generators (QRNGs), some of which are commercially available. In this work, we present the first published analysis of the Quantis family of QRNGs (excluding AIS-31 models), designed and manufactured by ID Quantique (IDQ). Our study also includes Comscire’s PQ32MU QRNG, and two online services: the Australian National University’s (ANU) QRNG, and the Humboldt Physik generator. Each QRNG is analysed using five batteries of statistical tests: Dieharder, National Institute of Standards and Technology (NIST) SP800-22, Ent, Tuftests and TestU01, as part of our thorough examination of their output. Our analysis highlights issues with current certification schemes, which largely rely on NIST SP800-22 and Diehard tests of randomness. We find that more recent tests of randomness identify issues in the output of QRNG, highlighting the need for mandatory post-processing even for low-security usage of random numbers sourced from QRNGs.

Item Type: Article
DOI/Identification number: 10.1145/3398726
Uncontrolled keywords: Security and privacy; Security requirements; Mathematical foundations of cryptography; Quantum random number generation; entropy; cryptography; statistical analysis
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 75 Electronic computers. Computer science
Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Julio Hernandez Castro
Date Deposited: 02 Jul 2020 12:23 UTC
Last Modified: 04 Jul 2023 14:03 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/81957 (The current URI for this page, for reference purposes)

University of Kent Author Information

Hernandez-Castro, Julio.

Creator's ORCID: https://orcid.org/0000-0002-6432-5328
CReDIT Contributor Roles:
  • Depositors only (login required):

Total unique views for this document in KAR since July 2020. For more details click on the image.