In this paper, we present a family of novel Pseudorandom Number Generators (PRNGs) based on Controllable Cellular Automata (CCA) ─ CCA0, CCA1, CCA2 (NCA), CCA3 (BCA), CCA4 (asymmetric NCA), CCA5, CCA6 and CCA7 PRNGs. The ENT and DIEHARD test suites are used to evaluate the randomness of these CCA PRNGs. The results show that their randomness is better than that of conventional CA and PCA PRNGs ...

The ordinary notion of algorithmic randomness of reals can be characterised as MartinLöf randomness with respect to the Lebesgue measure or as Kolmogorov randomness with respect to the binary representation. In this paper we study the question how the notion of algorithmic randomness induced by the signed-digit representation of the real numbers is related to the ordinary notion of algorithmic ...

Various processes are often classified as both deterministic and random or chaotic. The main difficulty in analysing the randomness of such processes is the apparent tension between the notions of randomness and determinism: what type of randomness could exist in a deterministic process? Ergodic theory seems to offer a particularly promising theoretical tool for tackling this problem by positin...

Bias-resistant public randomness is a critical component required in many (distributed) protocols. Tor hidden services depend on a fresh random value generated each day for protection against popularity estimations and DoS attacks. Anytrustbased systems such as Herbivore, Dissent, and Vuvuzela use bias-resistant public randomness for scalability by sharding participants into smaller groups. Tor...

Generating sequences of random numbers or bits is a necessity in many situations (cryptography, modeling, simulations, etc. . .). Those sequences must be random in the sense that their behavior should be unpredictable. For example, the security of many cryptographic systems depends on the generation of unpredictable values to be used as keys. Since randomness is related to the unpredictable pro...