Pseudo Quantum Random Number Generator with Quantum Permutation Pad

• URL: http://arxiv.org/abs/2303.01315v1
• Date: Thu, 2 Mar 2023 14:42:23 GMT
• Title: Pseudo Quantum Random Number Generator with Quantum Permutation Pad
• Authors: Randy Kuang and Dafu Lou and Alex He and Chris McKenzie and Michael Redding
• Abstract summary: This paper proposes a pseudo quantum random number generator with a quantum algorithm called quantum permutation pad or QPP. Using a QPP pad 64 8-bit permuation, pQRNG holds 107,776 bits of entropy for the pseudo random number generation. It can be used as a deterministic PRNG or entropy booster of other PRNGs.
• Score: 1.2233362977312945
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Cryptographic random number generation is critical for any quantum safe encryption. Based on the natural uncertainty of some quantum processes, variety of quantum random number generators or QRNGs have been created with physical quantum processes. They generally generate random numbers with good unpredictable randomness. Of course, physical QRNGs are costic and require physical integrations with computing systems. This paper proposes a pseudo quantum random number generator with a quantum algorithm called quantum permutation pad or QPP, leveraging the high entropy of quantum permutation space its bijective transformation. Unlike the Boolean algebra where the size of information space is 2n for an n-bit system, an n-bit quantum permutation space consists of 2n! quantum permutation matrices, representing all quantum permutation gates over an n-bit computational basis. This permutation space holds an equivalent Shannon information entropy log_2(2^n!). A QPP can be used to create a pseudo QRNG or pQRNG capable integrated with any classical computing system or directly with any application for good quality deterministic random number generation. Using a QPP pad with 64 8-bit permuation matrices, pQRNG holds 107,776 bits of entropy for the pseudo random number generation, comparing with 4096 bits of entropy in Linux /dev/random. It can be used as a deterministic PRNG or entropy booster of other PRNGs. It can also be used as a whitening algorithm for any hardware random number generator including QRNG without discarding physical bias bits.

Related papers

• Efficient Quantum Pseudorandomness from Hamiltonian Phase States [41.94295877935867]
  We introduce a quantum hardness assumption called the Hamiltonian Phase State (HPS) problem. We show that our assumption is plausibly fully quantum; meaning, it cannot be used to construct one-way functions. We show that our assumption and its variants allow us to efficiently construct many pseudorandom quantum primitives.
  arXiv  Detail & Related papers  (2024-10-10T16:10:10Z)
• Data Analysis Methods Preliminaries for a Photon-based Hardware Random Number Generator [39.58317527488534]
  Minecraft is great for games, but not so great for cybersecurity encryption key generation. PRNGs generate random numbers by quantifying some unpredictable phenomena into a number or string and feeding it into an algorithm. By using a hardware random number generator (HRNG), random numbers that are not susceptible to the flaws found in PRNGs can be attained at a high rate.
  arXiv  Detail & Related papers  (2024-04-15T00:47:17Z)
• Generation of True Quantum Random Numbers with On-Demand Probability Distributions via Single-Photon Quantum Walks [5.201119608184586]
  We show that single-photon quantum walks can generate multi-bit random numbers with on-demand probability distributions. Our theoretical and experimental results exhibit high fidelity for various selected distributions.
  arXiv  Detail & Related papers  (2024-03-05T03:05:19Z)
• Quantum Random Number Generation with Partial Source Assumptions [26.983886835892363]
  Quantum random number generator harnesses the power of quantum mechanics to generate true random numbers. However, real-world devices often suffer from imperfections that can undermine the integrity and privacy of generated randomness. We present a novel quantum random number generator and experimentally demonstrate it.
  arXiv  Detail & Related papers  (2023-12-06T08:08:11Z)
• Non Deterministic Pseudorandom Generator for Quantum Key Distribution [0.0]
  Quantum Key Distribution thrives to achieve perfect secrecy of One time Pad (OTP) through quantum processes. One of the crucial components of QKD are Quantum Random Number Generators(QRNG) for generation of keys. This paper proposes a pseudorandom generator based on post quantum primitives.
  arXiv  Detail & Related papers  (2023-11-06T11:03:03Z)
• Indistinguishability between quantum randomness and pseudo-randomness under efficiently calculable randomness measures [6.201566048090889]
  We present a no-go theorem for the distinguishability between quantum random numbers (i.e., random numbers generated quantum mechanically) and pseudo-random numbers (i.e., random numbers generated algorithmically) The theorem states that one cannot distinguish these two types of random numbers if the quantum random numbers are efficiently classically simulatable and the randomness measure used for the distinction is efficiently computable.
  arXiv  Detail & Related papers  (2023-09-20T07:50:30Z)
• Monte Carlo Graph Search for Quantum Circuit Optimization [26.114550071165628]
  This work proposes a quantum architecture search algorithm based on a Monte Carlo graph search and measures of importance sampling. It is applicable to the optimization of gate order, both for discrete gates, as well as gates containing continuous variables.
  arXiv  Detail & Related papers  (2023-07-14T14:01:25Z)
• Pseudorandom Strings from Pseudorandom Quantum States [6.79244006793321]
  We study the relationship between notions of pseudorandomness in the quantum and classical worlds. We show that a natural variant of pseudorandom generators called quantum pseudorandom generators (QPRGs) can be based on the existence of logarithmic output length PRSGs. We also study the relationship between other notions, namely, pseudorandom function-like state generators and pseudorandom functions.
  arXiv  Detail & Related papers  (2023-06-09T01:16:58Z)
• Generation of 1 Gb full entropy random numbers with the enhanced-NRBG method [0.13124513975412253]
  Experimental demonstration of a non-deterministic random bit generator from a quantum entropy source and a deterministic random bit generator mechanism. The extracted raw random numbers are further post-processed to generate a high-entropy seed for the hash based deterministic random bit generator.
  arXiv  Detail & Related papers  (2021-08-09T20:06:43Z)
• Logical Abstractions for Noisy Variational Quantum Algorithm Simulation [25.515765956985188]
  Existing quantum circuit simulators do not address the common traits of variational algorithms. We present a quantum circuit simulation toolchain based on logical abstractions targeted for simulating variational algorithms.
  arXiv  Detail & Related papers  (2021-03-31T17:20:13Z)
• Quantum Random Number Generation using a Solid-State Single-Photon Source [89.24951036534168]
  Quantum random number generation (QRNG) harnesses the intrinsic randomness of quantum mechanical phenomena. We demonstrate QRNG with a quantum emitter in hexagonal boron nitride. Our results open a new avenue to the fabrication of on-chip deterministic random number generators.
  arXiv  Detail & Related papers  (2020-01-28T22:47:43Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.