Number-theoretic pseudorandom generators work by iterating an algebraic map F (public or private) over a residue ring ZN on a secret random initial seed value v0 ∈ ZN to compute values vn+1 = F (vn) mod N for n ∈ N. They output some consecutive bits of the state value vn at each iteration and their efficiency and security are thus strongly related to the number of output bits. In 2005, Blackbur...

It is demonstrated that the one-dimensional random walk is sensitive both to short and long correlation of random numbers. In the case of correlated random numbers, the walker is trapped in the vicinity of the correlation. The result is a multipeak range distribution of the walker. Hence, the one-dimensional random walk can be used as a supplement to the standard tests for revealing long correl...

Introduction: Many applications require the realization of a random number generator featuring some desirable properties [1]; often such a device is at the very heart of a system. Examples of applications in the electronic field include cryptography, for which the period length serves as a minimum protection versus brute force attacks, and initialization of parameters for training of neural net...

We present a first random number generator (RNG) which simultaneously uses independent spatial and temporal quantum randomness contained in an optical system. Availability of the two independent sources of entropy makes the RNG resilient to hardware failure and signal injection attacks. We show that the deviation from randomness of the generated numbers can be estimated quickly from simple meas...

True random number generators (TRNGs) are extensively used in cryptography, simulations and statistics. In this work, we introduce, extend and analyse the concept of the randomised bit cell (RBC), introducing a second meta-level of randomisation, being able to simultaneously produce random numbers and detect active non-intrusive attacks. The concept is extended by using a corrector. Meta-stabil...