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
- 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) - Towards multiqudit quantum processor based on a $^{171}$Yb$^{+}$ ion
string: Realizing basic quantum algorithms [30.243813713554655]
We demonstrate a quantum processor based on a 3D linear Paul trap that uses $171$Yb$+$ ions with 8 individually controllable four-level qudits (ququarts)
The design of the developed ion trap provides high secular, low heating rate, which together with individual addressing and readout optical systems allows executing quantum algorithms.
Our results pave the way to scalable qudit-based quantum processors using trapped ions.
arXiv Detail & Related papers (2024-02-05T15:48:43Z) - 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) - 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) - Depth-efficient proofs of quantumness [77.34726150561087]
A proof of quantumness is a type of challenge-response protocol in which a classical verifier can efficiently certify quantum advantage of an untrusted prover.
In this paper, we give two proof of quantumness constructions in which the prover need only perform constant-depth quantum circuits.
arXiv Detail & Related papers (2021-07-05T17:45:41Z) - Preparing random states and benchmarking with many-body quantum chaos [48.044162981804526]
We show how to predict and experimentally observe the emergence of random state ensembles naturally under time-independent Hamiltonian dynamics.
The observed random ensembles emerge from projective measurements and are intimately linked to universal correlations built up between subsystems of a larger quantum system.
Our work has implications for understanding randomness in quantum dynamics, and enables applications of this concept in a wider context.
arXiv Detail & Related papers (2021-03-05T08:32:43Z) - 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.