To what extent are multiple pendulum systems viable in pseudo-random number generation?

• URL: http://arxiv.org/abs/2404.16860v1
• Date: Mon, 15 Apr 2024 00:28:51 GMT
• Title: To what extent are multiple pendulum systems viable in pseudo-random number generation?
• Authors: Matthew Sigit,
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: This paper explores the development and viability of an alternative pseudorandom number generator (PRNG) that leverages the chaotic dynamics of multiple pendulum systems. Some traditional PRNGs, notably the one implemented in the Java.Random class, suffer from predictability which gives rise to exploitability. This study identifies these vulnerabilities and proposes a novel PRNG designed using ordinary differential equations, physics modeling, and chaos theory. The performance of the new PRNG is then tested against Java's standard PRNGs using the NIST Statistical Test Suite, which evaluates randomness through comprehensive statistical testing. Results indicate that the multiple pendulum-based PRNG not only offers enhanced security by generating less predictable number sequences but also demonstrates potential for efficiency improvements in applications requiring high levels of entropy. The findings suggest that integrating chaotic physics-based systems into PRNGs, such as the double-pendulum system tested in this study, could strengthen cryptographic practices and security protocols for applications that do not require the level of security created by true random number generators, which is useful in fields such as gaming.

Related papers

• Conformal Generative Modeling with Improved Sample Efficiency through Sequential Greedy Filtering [55.15192437680943]
  Generative models lack rigorous statistical guarantees for their outputs. We propose a sequential conformal prediction method producing prediction sets that satisfy a rigorous statistical guarantee. 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)
• 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)
• Statistical testing of random number generators and their improvement using randomness extraction [0.0]
  We present and make available a comprehensive statistical testing environment (STE) based on existing statistical test suites. The STE can be parameterised to run lightweight (i.e. fast) all the way to intensive testing, which goes far beyond what is required by certification bodies. We then present and implement a variety of post-processing methods, in the form of randomness extractors, which improve the RNG's output quality under different sets of assumptions.
  arXiv  Detail & Related papers  (2024-03-27T16:05:02Z)
• Generalized Time-bin Quantum Random Number Generator with Uncharacterized Devices [0.0]
  This work analyzes evolutions in the extractable amount of randomness with increasing the Hilbert space dimension. We investigate the generic case of time-bin encoding scheme, define various input (state preparation) and outcome (measurement) subspaces. We demonstrate that this approach can boost the system entropy, resulting in more extractable randomness.
  arXiv  Detail & Related papers  (2023-05-05T15:53:22Z)
• 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)
• Fault-Aware Neural Code Rankers [64.41888054066861]
  We propose fault-aware neural code rankers that can predict the correctness of a sampled program without executing it. Our fault-aware rankers can significantly increase the pass@1 accuracy of various code generation models.
  arXiv  Detail & Related papers  (2022-06-04T22:01:05Z)
• Sequential Permutation Testing of Random Forest Variable Importance Measures [68.8204255655161]
  It is proposed here to use sequential permutation tests and sequential p-value estimation to reduce the high computational costs associated with conventional permutation tests. The results of simulation studies confirm that the theoretical properties of the sequential tests apply. The numerical stability of the methods is investigated in two additional application studies.
  arXiv  Detail & Related papers  (2022-06-02T20:16:50Z)
• Security Analysis and Improvement of Source Independent Quantum Random Number Generators with Imperfect Devices [21.524683492769526]
  A quantum random number generator (QRNG) is essential in many applications, such as number simulation and cryptography. Recently, a source-independent quantum random number generator (SI-QRNG), which can generate secure random numbers with untrusted sources, has been realized. Here, we point out and evaluate the security loopholes of practical imperfect measurement devices in SI-QRNGs.
  arXiv  Detail & Related papers  (2021-01-12T07:10:23Z)
• Searching for evidence of algorithmic randomness and incomputability in the output of quantum random number generators [0.0]
  Ideal quantum random number generators (QRNGs) can produce algorithmically random and thus incomputable sequences. We present the results of a search for algorithmic randomness and incomputability in the output from two different QRNGs.
  arXiv  Detail & Related papers  (2021-01-04T21:17:34Z)
• Open Set Recognition with Conditional Probabilistic Generative Models [51.40872765917125]
  We propose Conditional Probabilistic Generative Models (CPGM) for open set recognition. CPGM can detect unknown samples but also classify known classes by forcing different latent features to approximate conditional Gaussian distributions. Experiment results on multiple benchmark datasets reveal that the proposed method significantly outperforms the baselines.
  arXiv  Detail & Related papers  (2020-08-12T06:23:49Z)

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.