Design and implementation of a novel cryptographically secure pseudorandom number generator

• URL: http://arxiv.org/abs/2503.17767v1
• Date: Sat, 22 Mar 2025 13:15:00 GMT
• Title: Design and implementation of a novel cryptographically secure pseudorandom number generator
• Authors: Juan Di Mauro, Eduardo Salazar, Hugo D. Scolnik,
• Abstract summary: We present a new design for a pseudorandom number generator (PRNG) that is cryptographically secure.<n>Our procedure achieves those objectives through the use of a sequence of modular exponentiations followed by the application of Feistel-like boxes.<n>The results of extensive statistical tests on sequences of about 240 bits in size generated by our algorithm are also presented.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: The aim of this paper is to present a new design for a pseudorandom number generator (PRNG) that is cryptographically secure, passes all of the usual statistical tests referenced in the literature and hence generates high quality random sequences, that is compact and easy to implement in practice, of portable design and offering reasonable execution times. Our procedure achieves those objectives through the use of a sequence of modular exponentiations followed by the application of Feistel-like boxes that mix up bits using a nonlinear function. The results of extensive statistical tests on sequences of about 2^40 bits in size generated by our algorithm are also presented.

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.<n>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)
• Conformal Generative Modeling with Improved Sample Efficiency through Sequential Greedy Filtering [55.15192437680943]
  Generative models lack rigorous statistical guarantees for their outputs.<n>We propose a sequential conformal prediction method producing prediction sets that satisfy a rigorous statistical guarantee.<n>This guarantee states that with high probability, the prediction sets contain at least one admissible (or valid) example.
  arXiv  Detail & Related papers  (2024-10-02T15:26:52Z)
• Efficient Quality Estimation of True Random Bit-streams [5.441027708840589]
  This paper reports the implementation and characterization of an on-line procedure for the detection of anomalies in a true random bit stream. The experimental validation of the approach is performed upon the bit streams generated by a quantum, silicon-based entropy source.
  arXiv  Detail & Related papers  (2024-09-09T12:09:17Z)
• Graph-Structured Speculative Decoding [52.94367724136063]
  Speculative decoding has emerged as a promising technique to accelerate the inference of Large Language Models. We introduce an innovative approach utilizing a directed acyclic graph (DAG) to manage the drafted hypotheses. We observe a remarkable speedup of 1.73$times$ to 1.96$times$, significantly surpassing standard speculative decoding.
  arXiv  Detail & Related papers  (2024-07-23T06:21:24Z)
• 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)
• Pseudorandom unitaries with non-adaptive security [43.15464425520681]
  We present a PRU construction that is a concatenation of a random Clifford unitary, a pseudorandom binary phase operator, and a pseudorandom permutation operator. We prove that this PRU construction is secure against non-adaptive distinguishers assuming the existence of quantum-secure one-way functions.
  arXiv  Detail & Related papers  (2024-02-22T18:56:37Z)
• A privacy-preserving publicly verifiable quantum random number generator [48.7576911714538]
  We report the implementation of an entanglement-based protocol that allows a third party to publicly perform statistical tests without compromising the privacy of the random bits. limitations on computing power can restrict an end-user's ability to perform such verification.
  arXiv  Detail & Related papers  (2023-05-18T12:13:48Z)
• 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)
• 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 Well-Composed Text is Half Done! Composition Sampling for Diverse Conditional Generation [79.98319703471596]
  We propose Composition Sampling, a simple but effective method to generate diverse outputs for conditional generation of higher quality. It builds on recently proposed plan-based neural generation models that are trained to first create a composition of the output and then generate by conditioning on it and the input.
  arXiv  Detail & Related papers  (2022-03-28T21:24:03Z)
• 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)

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.