English
Related papers

Related papers: Improving random number generators by chaotic iter…

200 papers

Langevin Dynamics, Monte Carlo, and all-atom Molecular Dynamics simulations in implicit solvent, widely used to access the microscopic transitions in biomolecules, require a reliable source of random numbers. Here we present the two main…

Chemical Physics · Physics 2010-03-05 A. Zhmurov , K. Rybnikov , Y. Kholodov , V. Barsegov

We study the relationship between notions of pseudorandomness in the quantum and classical worlds. Pseudorandom quantum state generator (PRSG), a pseudorandomness notion in the quantum world, is an efficient circuit that produces states…

Quantum Physics · Physics 2023-09-15 Prabhanjan Ananth , Yao-Ting Lin , Henry Yuen

We present results of extensive statistical and bit level tests on three implementations of a pseudorandom number generator algorithm using the lagged Fibonacci method with an occasional addition of an extra bit. First implementation is the…

High Energy Physics - Lattice · Physics 2008-02-03 I. Vattulainen , K. Kankaala , J. Saarinen , T. Ala-Nissila

We analyze the thermodynamic costs of the three main approaches to generating random numbers via the recently introduced Information Processing Second Law. Given access to a specified source of randomness, a random number generator (RNG)…

Statistical Mechanics · Physics 2017-07-05 C. Aghamohammadi , J. P. Crutchfield

In this paper, we consider a pseudo-random generator based on the difficulty of the syndrome decoding problem for rank metric codes. We also study the resistance of this problem against a quantum computer. Our results show that with rank…

Cryptography and Security · Computer Science 2016-03-17 Philippe Gaborit , Adrien Hauteville , Jean-Pierre Tillich

We present a new secret sharing algorithm that provides the storage efficiency of an Information Dispersal Algorithm (IDA) while providing perfect secret sharing. We achieve this by mixing the input message with random bytes generated using…

Cryptography and Security · Computer Science 2021-02-23 Arvind Srinivasan , Chien-Chung Chan

Xorshift128+ are pseudo random number generators with eight sets of parameters. Some of them are standard generators in many platforms, such as JavaScript V8 Engine. We show that in the 3D plots generated by this method, points concentrate…

Cryptography and Security · Computer Science 2019-08-28 Hiroshi Haramoto , Makoto Matsumoto

Pseudorandom quantum states (PRS) are efficiently constructible states that are computationally indistinguishable from being Haar-random, and have recently found cryptographic applications. We explore new definitions, new properties and…

Quantum Physics · Physics 2023-06-12 Prabhanjan Ananth , Aditya Gulati , Luowen Qian , Henry Yuen

With the advancement of quantum computing technologies, recent years have seen increasing efforts to identify cryptographic methods resistant to quantum attacks and to establish post-quantum cryptography (PQC) approaches. Among these,…

Cryptography and Security · Computer Science 2025-06-25 Abel C. H. Chen

Quantum random number generator (QRNG) utilizes the intrinsic randomness of quantum systems to generate completely unpredictable and genuine random numbers, finding wide applications across many fields. QRNGs relying on the phase noise of a…

Quantum Physics · Physics 2024-02-28 Jialiang Li , Zitao Huang , Chunlin Yu , Jiajie Wu , Tongge Zhao , Xiangwei Zhu , Shihai Sun

The logistic map is one of the simple systems exhibiting order to chaos transition. In this work we have investigated the possibility of using the logistic map in the chaotic regime ({\sc logmap}) for a pseudo random number generator. To…

Condensed Matter · Physics 2007-05-23 S. C. Phatak , S. Suresh Rao

We develop a method for generating pseudorandom binary sequences using the Bernoulli map on cubic algebraic integers. The distinguishing characteristic of our generator is that it generates chaotic true orbits of the Bernoulli map by exact…

Number Theory · Mathematics 2018-11-14 Asaki Saito , Akihiro Yamaguchi

In this work we present a model for computation of random processes in digital computers which solves the problem of periodic sequences and hidden errors produced by correlations. We show that systems with non-invertible non-linearities can…

Statistical Mechanics · Physics 2007-05-23 Monica A. Garcia-Nustes , Leonardo Trujillo , Jorge A. Gonzalez

True random number generators (TRNG) sample random physical processes to create large amounts of random numbers for various use cases, including security-critical cryptographic primitives, scientific simulations, machine learning…

A class of xorshift random number generators (RNGs) are introduced by Marsaglia. We have proposed an algorithm which constructs a full period xorshift RNG from a given primitive polynomial. It is shown there is a weakness present in those…

Cryptography and Security · Computer Science 2017-08-08 Susil Kumar Bishoi , Surya Narayan Maharana

One of the key requirement of many schemes is that of random numbers. Sequence of random numbers are used at several stages of a standard cryptographic protocol. A simple example is of a Vernam cipher, where a string of random numbers is…

Computational Physics · Physics 2015-10-06 Ram Soorat , Madhuri K. , Ashok Vudayagiri

Random beacons-information sources that broadcast a stream of random digits unknown by anyone beforehand-are useful for various cryptographic purposes. But such beacons can be easily and undetectably sabotaged, so that their output is known…

Cryptography and Security · Computer Science 2007-05-23 Charles H. Bennett , John A. Smolin

In this paper, we proposed an experimental implementation of quantum random number generator(QRNG) with inherent randomness of quantum tunneling effect of electrons. We exploited InGaAs/InP diodes, whose valance band and conduction band…

Quantum Physics · Physics 2018-05-29 Haihan Zhou , Junlin Li , Dong Pan , Weixing Zhang , Guilu Long

The problem of constructing effective statistical tests for random number generators (RNG) is considered. Currently, statistical tests for RNGs are a mandatory part of cryptographic information protection systems, but their effectiveness is…

Information Theory · Computer Science 2019-12-16 Boris Ryabko

We study the ability of Transformer models to learn sequences generated by Permuted Congruential Generators (PCGs), a widely used family of pseudo-random number generators (PRNGs). PCGs introduce substantial additional difficulty over…

Machine Learning · Computer Science 2026-02-18 Tao Tao , Maissam Barkeshli