A Pseudo-random Number Generator for Multi-Sequence Generation with Programmable Statistics

• URL: http://arxiv.org/abs/2501.00193v1
• Date: Tue, 31 Dec 2024 00:06:09 GMT
• Title: A Pseudo-random Number Generator for Multi-Sequence Generation with Programmable Statistics
• Authors: Jianan Wu, Ahmet Yusuf Salim, Eslam Elmitwalli, Selçuk Köse, Zeljko Ignjatovic,
• Abstract summary: 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.
• Score: 1.7243216387069678
• License:
• Abstract: Pseudo-random number generators (PRNGs) are essential in a wide range of applications, from cryptography to statistical simulations and optimization algorithms. While uniform randomness is crucial for security-critical areas like cryptography, many domains, such as simulated annealing and CMOS-based Ising Machines, benefit from controlled or non-uniform randomness to enhance solution exploration and optimize performance. This paper presents a hardware PRNG that can simultaneously generate multiple uncorrelated sequences with programmable statistics tailored to specific application needs. Designed in 65nm process, the PRNG occupies an area of approximately 0.0013mm^2 and has an energy consumption of 0.57pJ/bit. Simulations confirm the PRNG's effectiveness in modulating the statistical distribution while demonstrating high-quality randomness properties.

Related papers

• Entropy Mixing Networks: Enhancing Pseudo-Random Number Generators with Lightweight Dynamic Entropy Injection [4.428931150564558]
  This paper presents the Entropy Mixing Network (EMN), a novel hybrid random number generator. It is designed to enhance randomness quality by combining deterministic pseudo-random generation with periodic entropy injection. EMN outperforms Python's SystemRandom and MersenneTwister in critical metrics.
  arXiv  Detail & Related papers  (2025-01-14T11:36:54Z)
• 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)
• To what extent are multiple pendulum systems viable in pseudo-random number generation? [0.0]
  This paper explores the development and viability of an alternative pseudorandom number generator (PRNG) Traditional PRNGs, notably the one implemented in the Java.Random class, suffer from predictability which gives rise to exploitability. This study proposes a novel PRNG designed using ordinary differential equations, physics modeling, and chaos theory.
  arXiv  Detail & Related papers  (2024-04-15T00:28:51Z)
• Random Aggregate Beamforming for Over-the-Air Federated Learning in Large-Scale Networks [66.18765335695414]
  We consider a joint device selection and aggregate beamforming design with the objectives of minimizing the aggregate error and maximizing the number of selected devices. To tackle the problems in a cost-effective manner, we propose a random aggregate beamforming-based scheme. We additionally use analysis to study the obtained aggregate error and the number of the selected devices when the number of devices becomes large.
  arXiv  Detail & Related papers  (2024-02-20T23:59:45Z)
• Source-independent quantum random number generators with integrated silicon photonics [12.813953462597603]
  Source-independent quantum random number generators (SI-QRNGs) can offer true randomness. Silicon photonics shows great promise for QRNG due to its benefits in miniaturization, cost-effective device manufacturing, and compatibility with CMOS microelectronics.
  arXiv  Detail & Related papers  (2023-12-28T13:25:33Z)
• Simplex Random Features [53.97976744884616]
  We present Simplex Random Features (SimRFs), a new random feature (RF) mechanism for unbiased approximation of the softmax and Gaussian kernels. We prove that SimRFs provide the smallest possible mean square error (MSE) on unbiased estimates of these kernels. We show consistent gains provided by SimRFs in settings including pointwise kernel estimation, nonparametric classification and scalable Transformers.
  arXiv  Detail & Related papers  (2023-01-31T18:53:39Z)
• 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 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)
• Photonic co-processors in HPC: using LightOn OPUs for Randomized Numerical Linear Algebra [53.13961454500934]
  We show that the randomization step for dimensionality reduction may itself become the computational bottleneck on traditional hardware. We show that randomization can be significantly accelerated, at negligible precision loss, in a wide range of important RandNLA algorithms.
  arXiv  Detail & Related papers  (2021-04-29T15:48:52Z)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

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.