Lattice structure and linear complexity profile of nonlinear pseudorandom number generators
G Dorfer, A Winterhof - Applicable Algebra in Engineering, Communication …, 2003 - Springer
G Dorfer, A Winterhof
Applicable Algebra in Engineering, Communication and Computing, 2003•Springer… We extend a generalized version of Marsaglia’s lattice test for sequences over finite
fields to segments of sequences over an arbitrary field and show that linear complexity
profile and this lattice test provide essentially equivalent quality measures for randomness. …
There is no formal definition for a good pseudorandom number generator, but there are
certain characteristic features that we have in mind when we talk about such a generator. In
particular, we do not want to have an imbedded low dimensional lattice structure, we …
fields to segments of sequences over an arbitrary field and show that linear complexity
profile and this lattice test provide essentially equivalent quality measures for randomness. …
There is no formal definition for a good pseudorandom number generator, but there are
certain characteristic features that we have in mind when we talk about such a generator. In
particular, we do not want to have an imbedded low dimensional lattice structure, we …
Abstract
We extend a generalized version of Marsaglia's lattice test for sequences over finite fields to segments of sequences over an arbitrary field and show that linear complexity profile and this lattice test provide essentially equivalent quality measures for randomness.
Springer