" The state of the art for generating uniform deviates has advanced considerably in the last decade and now begins to resemble a mature field. " Press et al. [46]

Abstract Nearly all the evolution equations of physics are time-reversible, in the sense that a movie of the solution, played backwards, would obey exactly the same differential equations as the original forward solution. By way of contrast, stochastic approaches are typically not time-reversible, though they could be made so by the simple expedient of storing their underlying pseudorandom numb...

In this paper we present experiments in order to show how some pseudo random number generators can improve the effectiveness of a statistical cryptanalysis algorithm. We deduce mainly that a better generator enhance the accuracy of the cryptanalysis algorithm.

In this paper, a new, patent pending, architecture for a jitterbased random bit source which is cost-effective and suitable for applications in cryptography, is presented. The source is designed to be robust against parameter variations and attacks aimed to force its output. It also features an auto-test which allows to detect faults and to estimate the source entropy. The proposed design is an...

Random residue sequences (RR) may be used in many random number applications including those related to multiple access in communications. This paper investigates variations on an algorithm to generate RR sequences that was proposed earlier by the author. This makes it possible to obtain many more random sequences than was possible to do by the previous algorithm. Experimental results are prese...

Simulations of many people’s decisions are used in public health and safety as well as to support policymaking. These simulations rely on creditable models of individual decision-making. An obvious approach is to develop a list of plausible actions and to then evaluate the benefits of each in the current situation to make the decision. However, such evaluations can be implausible, e.g., zero-in...

The following three propositions are true: (1) For all binary relations a, b holds a · b = a b. (2) Let X be a set, L be a non empty relational structure, S be a non empty relational substructure of L, f , g be functions from X into the carrier of S, and f , g be functions from X into the carrier of L. If f ′ = f and g = g and f ¬ g, then f ′ ¬ g. (3) Let X be a set, L be a non empty relational...

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...

In this section we survey recombination operators that can apply more than two parents to create oospring. Some multi-parent recombination operators are deened for a xed number of parents, e.g. have arity three, in some operators the number of parents is a random number that might be greater than two, and in yet other operators the arity is a parameter that can be set to an arbitrary integer nu...

The Microsoft version of the game Minesweeper has a known bug that makes sequences of boards appear again after generating thousands of boards, in a cycle, disturbing the random nature of the game. This article exposes the results of a research made in 2004, as well as the subsequent secondary discoveries, like the existence of boards made of combinations of mines from two consecutive boards of...