Lattice Structure and Linear Complexity of Nonlinear Pseudorandom Numbers |
| |
Authors: | Harald Niederreiter Arne Winterhof |
| |
Affiliation: | (1) Department of Mathematics, National University of Singapore, 2 Science Drive 2, Singapore 117543, Republic of Singapore (e-mail: nied@math.nus.edu.sg), SG;(2) Institute of Discrete Mathematics, Austrian Academy of Sciences, Sonnenfelsgasse 19, 1010 Vienna, Austria (e-mail: arne.winterhof@oeaw.ac.at), AT |
| |
Abstract: | It is shown that a q-periodic sequence over the finite field F
q
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.
Received: October 2, 2001
Keywords: Pseudorandom number generator, Nonlinear method, Inversive method, Linear complexity, Marsaglia's lattice test. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|