IID-Based QPP-RNG: A Random Number Generator Utilizing Random Permutation Sorting Driven by System Jitter

• URL: http://arxiv.org/abs/2502.18609v2
• Date: Mon, 24 Mar 2025 15:52:46 GMT
• Title: IID-Based QPP-RNG: A Random Number Generator Utilizing Random Permutation Sorting Driven by System Jitter
• Authors: Randy Kuang, Dafu Lou,
• Abstract summary: We propose a cryptographic random number generator that achieves uniform, independent, and identically distributed (IID) randomness.<n>We use system jitter to generate ephemeral QPP pads and derives 8-bit outputs directly from permutation counts, eliminating the need for post-processing.<n>IID-based QPP-RNG achieves a min-entropy of 7.18 bits per byte, surpassing ID Quantique's QRNG (7.157042 bits per byte), which marks a breakthrough in randomness quality.
• Score: 0.8192907805418583
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We propose a groundbreaking random number generator that achieves truly uniform, independent, and identically distributed (IID) randomness by integrating Quantum Permutation Pads (QPP) with system jitter--derived entropy, herein called IID-based QPP-RNG. Unlike conventional RNGs that use raw timing variations, our design uses system jitter solely to generate ephemeral QPP pads and derives 8-bit outputs directly from permutation counts, eliminating the need for post-processing. This approach leverages the factorial complexity of permutation sorting to systematically accumulate entropy from dynamic hardware interactions, ensuring non-deterministic outputs even from fixed seeds. Notably, IID-based QPP-RNG achieves a min-entropy of 7.18 bits per byte, surpassing ID Quantique's QRNG (7.157042 bits per byte), which marks a breakthrough in randomness quality. Our implementation employs a dynamic seed evolution protocol that continuously refreshes the internal state with unpredictable system jitter, effectively decoupling the QPP sequence from the initial seed. Cross-platform validation on macOS (x86 and ARM) and Windows (x86) confirms uniformly distributed outputs, while evaluations compliant with NIST SP 800-90B show a Shannon entropy of 7.9999 bits per byte. Overall, IID-based QPP-RNG represents a significant advancement in random number generation, offering a scalable, system-based, software-only, post-quantum secure solution for a wide range of cryptographic applications.

Related papers

• A Pseudo-random Number Generator for Multi-Sequence Generation with Programmable Statistics [1.7243216387069678]
  This paper presents a hardware PRNG that can simultaneously generate multiple uncorrelated sequences with programmable statistics tailored to specific application needs. The PRNG occupies an area of approximately 0.0013mm2 and has an energy consumption of 0.57pJ/bit.
  arXiv  Detail & Related papers  (2024-12-31T00:06:09Z)
• Continuous-Variable Source-Independent Quantum Random Number Generator with a Single Phase-Insensitive Detector [0.5439020425819]
  Quantum random number generators (QRNGs) harness quantum mechanical unpredictability to produce true randomness. We propose a novel CV-SI-QRNG scheme with a single phase-insensitive detector, and provide security proof based on semi-definite programming (SDP) These results demonstrate the feasibility of our framework, paving the way for practical and simple SI-QRNG implementations.
  arXiv  Detail & Related papers  (2024-11-22T09:26:53Z)
• Parallel and real-time post-processing for quantum random number generators [5.864108266054829]
  This work explores the parallel and real-time implementation of multiple seed real-time updating toeplitz hash extractors in an FPGA to achieve parallel QRNGs. With the use of higher-performance ADCs, we attained a random number production rate exceeding 20Gbps. This marks a significant step toward chip-based parallel QRNGs, enhancing the practicality of CV QRNGs in trusted, device-independent, and semi-device-independent scenarios.
  arXiv  Detail & Related papers  (2024-03-28T15:05:39Z)
• 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)
• Distribution-Flexible Subset Quantization for Post-Quantizing Super-Resolution Networks [68.83451203841624]
  This paper introduces Distribution-Flexible Subset Quantization (DFSQ), a post-training quantization method for super-resolution networks. DFSQ conducts channel-wise normalization of the activations and applies distribution-flexible subset quantization (SQ) It achieves comparable performance to full-precision counterparts on 6- and 8-bit quantization, and incurs only a 0.1 dB PSNR drop on 4-bit quantization.
  arXiv  Detail & Related papers  (2023-05-10T04:19:11Z)
• Majorization-based benchmark of the complexity of quantum processors [105.54048699217668]
  We numerically simulate and characterize the operation of various quantum processors. We identify and assess quantum complexity by comparing the performance of each device against benchmark lines. We find that the majorization-based benchmark holds as long as the circuits' output states have, on average, high purity.
  arXiv  Detail & Related papers  (2023-04-10T23:01:10Z)
• A Programmable True Random Number Generator Using Commercial Quantum Computers [4.306143768014157]
  We demonstrate that a quantum computer can serve as a high-quality, weakly random source for a generalized user-defined probability mass function. We introduce an automated and flexible method for implementing a TRNG as a programmed quantum circuit that executes on commercially-available, gate-model quantum computers.
  arXiv  Detail & Related papers  (2023-04-07T20:12:18Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Testing randomness of series generated in Bell's experiment [62.997667081978825]
  We use a toy fiber optic based setup to generate binary series, and evaluate their level of randomness according to Ville principle. Series are tested with a battery of standard statistical indicators, Hurst, Kolmogorov complexity, minimum entropy, Takensarity dimension of embedding, and Augmented Dickey Fuller and Kwiatkowski Phillips Schmidt Shin to check station exponent. The level of randomness of series obtained by applying Toeplitz extractor to rejected series is found to be indistinguishable from the level of non-rejected raw ones.
  arXiv  Detail & Related papers  (2022-08-31T17:39:29Z)
• A tunable quantum random number generator based on a fiber-optical Sagnac interferometer [0.0]
  Quantum random number generators (QRNG) are based on the naturally random measurement results performed on individual quantum systems. We demonstrate a branching-path photonic QRNG implemented with a Sagnac interferometer with a tunable splitting ratio.
  arXiv  Detail & Related papers  (2022-05-09T18:00:08Z)
• A High-Quality Entropy Source Using van der Waals Heterojunction for True Random Number Generation [0.41998444721319217]
  Generators of random sequences used in high-end applications such as cryptography rely on entropy sources for their indeterminism. We present a compact device capable of detecting discrete charge fluctuations for extracting entropy from physical processes. We demonstrate an entropy generation rate tunable over multiple orders of magnitude and show the persistence of the underlying physical process for temperatures ranging from cryogenic to ambient conditions.
  arXiv  Detail & Related papers  (2022-04-13T17:25:08Z)
• Improved, Deterministic Smoothing for L1 Certified Robustness [119.86676998327864]
  We propose a non-additive and deterministic smoothing method, Deterministic Smoothing with Splitting Noise (DSSN) In contrast to uniform additive smoothing, the SSN certification does not require the random noise components used to be independent. This is the first work to provide deterministic "randomized smoothing" for a norm-based adversarial threat model.
  arXiv  Detail & Related papers  (2021-03-17T21:49:53Z)
• Coherent randomized benchmarking [68.8204255655161]
  We show that superpositions of different random sequences rather than independent samples are used. We show that this leads to a uniform and simple protocol with significant advantages with respect to gates that can be benchmarked.
  arXiv  Detail & Related papers  (2020-10-26T18:00:34Z)

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.