“A gaming machine of the type utilizing rotating reels which carry on the periphery a plurality of indicia, a brake to stop the reels at a selected position and a random number generator for selecting the reel stopping position. Numbers are assigned to the reel stopping positions and entered into the random number generator with each number being entered one or more times to control the payout ...

We consider the problem of determining when a given source can be used to approximate the output due to any input to a given channel. We provide achievability and converse results for a general source and channel. For the special case of a full-rank discrete memoryless channel we give a stronger converse result than we can give for a general channel.

In encryption schemes, the sender may not generate randomness properly if generating randomness is costly, and the sender is not concerned about the security of a message. The problem was studied by the first author (2016), and was formalized in a game-theoretic framework. In this work, we construct an encryption scheme with an optimal round complexity on the basis of the mechanism of repeated ...

A corrector is used to reduce or eliminate statistical weakness of a physical random number generator. A description of linear corrector generalizing post-processing described by M. Dichtl at FSE’07 [4] is introduced. A general formula for non linear corrector, determining the bias and the minimal entropy of the output of a function is given. Finally, a concrete and efficient construction of po...

Phase-type (PH) distributions are proven to be very powerful tools in modelling and analysis of a wide range of phenomena in computer systems. The use of these distributions in simulation studies requires efficient methods for generating PH-distributed random numbers. In this work, we consider the cost of PH-distributed random-number generation.

We study the cutoff phenomenon for generalized riffle shuffles where, at each step, the deck of cards is cut into a random number of packs of multinomial sizes which are then riffled together.

Random numbers are needed in a variety of applications, yet nding good random number generators is a diicult task. In the last decade cellular automata (CA) have been used to generate random numbers. In this paper non-uniform CAs are studied, where each cell may contain a diierent rule, in contrast to the original, uniform model. We present the cellular programming algorithm for co-evolving non...

Statistical tests of random sequences are often used in cryptography in order to perform some routine checks for random and pseudo-random number generators. Most of the test suites available are based on the theory of hypothesis testing which allows one to decide whether a sample has been drawn following a certain distribution. In this article, we develop a theoretical foundation of statistical...

This manuscript presents a new free Modelica library, named DESLib and composed of four packages: RandomLib, DEVSLib, SIMANLib and ARENALib. DESLib has been designed and implemented to facilitate the description of discrete-event models using the Parallel DEVS formalism (using DEVSLib), and to facilitate the process-oriented modeling of logistic systems (using SIMANLib and ARENALib). SIMANLib a...

In this article, we propose a new implementation of John von Neumann’s middle square random number generator (RNG). A Weyl sequence is utilized to keep the generator running through a long period.