Lattice Structure and Linear Complexity of Nonlinear Pseudorandom Numbers

It is shown that a q-periodic sequence over the finite field Fq passes an extended version of Marsaglia's lattice test for high dimensions if and only if its linear complexity is large. The consequences of this result for nonlinear and inversive pseudorandom number generators are worked out.

• Type: Journal
• Year: 2002
• Where: AAECC
• Authors: Harald Niederreiter, Arne Winterhof
• Keywords: AAECC 2002, Algorithms, Finite Field Fq, Inversive Pseudorandom Number, Lattice Test