Lattice computations for random numbers

We improve on a lattice algorithm of Tezuka for the computation of the k-distribution of a class of random number generators based on finite fields. We show how this is applied to the problem of constructing, for such generators, an output mapping yielding optimal k-distribution.

• Type: Journal
• Year: 2000
• Where: MOC
• Authors: Raymond Couture, Pierre L'Ecuyer
• Keywords: Finite Fields, Lattice Algorithm, MOC 2000, Random Number Generators