On the multidimensional distribution of the subset sum generator of pseudorandom numbers

We show that for a random choice of the parameters, the subset sum pseudorandom number generator produces a sequence of uniformly and independently distributed pseudorandom numbers. The result can be useful for both cryptographic and quasi-Monte Carlo applications and relies on bounds of exponential sums.

     

Permutation graphs, fast forward permutations, and sampling the cycle structure of a permutation

PS_N is a fast forward permutation if for each m the computational complexity of evaluating P^m(x) is small independently of m and x. Naor and Reingold constructed fast forward pseudorandom cycluses and involutions. By studying the evolution of permutation graphs, we prove that the number of queries needed to distinguish a random cyclus from a random permutation in S_N is Θ(N) if one does not use queries of the form P^m(x), but is only Θ(1) if one is allowed to make such queries. We construct fast forward permutations which are indistinguishable from random permutations even when queries of the form P^m(x) are allowed. This is done by introducing an efficient method to sample the cycle structure of a random permutation, which in turn solves an open problem of Naor and Reingold.     

Generalized explicit inversive generators of small p-weight degree

Using rational functions to generate pseudorandom number sequences is a popular research topic. In this paper, we study bounds on additive character sums of a new explicit generator based on rational functions with small p-weight degree. This extends the class of functions where a nontrivial character sum bound is known.     

Cryptographic properties of nonlinear pseudorandom number generators

The cryptographic properties of keystreams generated by stream ciphers based on t-functions are studied. These constructions are of great interest as they allow building highly efficient and secure cryptographic primitives. The randomness of the coordinate sequences generated by such mappings is analyzed in terms of the autocorrelation function. The results derived are valid for all t-functions regardless the type of construction and indicate the existence of nonrandomness. As the problem of the efficient implementation of secure s-boxes is open, the nonlinearity of t-functions is also analyzed. It is shown how some cryptographically undesirable properties, can be solved by application of similarity transformations.      

Construction of inversive congruential pseudorandom number generators with maximal period length

The inversive congruential method for generating uniform pseudorandom numbers is a particularly attractive alternative to linear congruential generators with their well-known inherent deficiencies like the unfavourable coarse lattice structure in higher dimensions. In the present paper the modulus in the inversive congruential method is chosen as a power of an arbitrary odd prime. The existence of inversive congruential generators with maximal period length is proved by a new constructive characterization of these generators.     

Simulation methodology — An introduction for queueing theorists

Simulation is a widely used methodology for queueing systems. Its superficial simplicity hides a number of pitfalls which are not all as well known as they should be. In particular simulation experiments need careful design and analysis as well as good presentations of the results. Even the elements of simulation such as the generation of arrival and service times have a chequered history with major problems lying undiscovered for 20 years. On the other hand, good simulation practice can offer much more than is commonly realized.     

The serial test for a nonlinear pseudorandom number generator

Let and A sequence is obtained by the formula The sequence is a sequence of pseudorandom numbers of the maximal period length if and only if (mod 4), (mod 4). In this note, the uniformity is investigated by the 2-dimensional serial test for the sequence. We follow closely the method of papers by Eichenauer-Herrmann and Niederreiter.

     

On a nonlinear congruential pseudorandom number generator

A nonlinear congruential pseudorandom number generator with modulus is proposed, which may be viewed to comprise both linear as well as inversive congruential generators. The condition for it to generate sequences of maximal period length is obtained. It is akin to the inversive one and bears a remarkable resemblance to the latter.

     

More constructions of pseudorandom sequences of k symbols

We present some new constructions of families of pseudorandom sequences of k symbols, which generalize several previous constructions for the binary case.