The “x2 mod N” generator, also known as the BBS generator [2], has a strong theoretical foundation from the computational complexity theory and the number theory. Proofs were given that, under certain reasonable assumptions on which modern cryptography heavily relies, the BBS pseudo-random sequences would pass any feasible statistical test. Unfortunately, the algorithm was found to be too slow ...

Security protocols and encryption algorithms are basically based on random number generators. In this paper, a new random number generator architecture is introduced. The produced number word length is equal to 160 bits. The philosophy architecture relies on the usage of the SHA hash function. The offered security strength of this certain hash function ensures the unpredictability of the produc...

illustration, the prime reciprocal of 1/7 is , and the prime reciprocal sequence is considered to be 142857. The period of this sequence is 6. Since the maximum length of the period can be (p-1), this is an example of a maximum-length d-sequence. But a prime reciprocal sequence that is maximum length in one base need not be maximum length in another base. Thus the binary prime reciprocal sequen...

We propose a scheme of all-optical random number generator (RNG), which consists of an ultra-wide bandwidth (UWB) chaotic laser, an all-optical sampler and an all-optical comparator. Free from the electric-device bandwidth, it can generate 10Gbit/s random numbers in our simulation. The high-speed bit sequences can pass standard statistical tests for randomness after all-optical exclusive-or (XO...

In this report one explicates the new method to generate random numbers whose the randomness is proved. One transforms data resulting from electronic files or provided by machines or software methods. This method can be applied directly in computers in the same way that the function " random ". It can be also applied with the machines and the chips or software methods. In this report, one shows...

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 (logmap) for a pseudo random number generator. To this end we have performed certain statistical tests on the series of numbers obtained from the logmap. We find that the logmap passes these tests satisfactorily and...

This paper presents an efficient filtering system for a metastable state-based true random number generator. To output a result with high randomness, we use loop-storage for storing the value of metastability. During the metastable state, the output value is accumulated to the storage. When the non-metastable state arises, the stored metastable value will be used for output instead of the resul...

In random event generator (REG) experiments yielding anomalous results, any evolution of effect sizes over extended runs of data collection could, in principle, give some insight into the fundamental mechanism of the binary probability distortions. Retrospective examination of large individual and collective databases acquired over many years of previous study proves only marginally capable of ...

Pseudo random number generators (PRNGs) are the basic input to the stochastic selection, recombination, and mutation operations of genetic algorithms (GAs). Although it does not seem like a crucial decision, recent studies suggest that the choice of PRNG can affect the performance of GAs. The objective of this paper is to study the effect of PRNGs on a simple GA, and to identify the components ...

We propose a new approach to nondeterministic random number generation. In theory, the randomness originated from the uncorrelated nature of consecutive laser pulses with Poissonian photon number distribution and that of the consecutive single photon detections is used to generate random bit. In experiment, von Neumann correction method is applied to extract the final random bit. This method is...