Tausworthe random number generators based on a primitive trinomial all
ow an easy and fast implementation when their parameters obey certain
restrictions. However, such generators, with those restrictions, have
bad statistical properties unless we combine them. A generator is call
ed maximally equidistributed if its vectors of successive values have
the best possible equidistribution in all dimensions. This paper shows
how to find maximally equidistributed combinations in an efficient ma
nner, and gives a list of generators with that property. Such generato
rs have a strong theoretical support and lend themselves to very fast
software implementations.