Please use this identifier to cite or link to this item: https://doi.org/10.1007/s002000200105
Title: Lattice structure and linear complexity of nonlinear pseudorandom numbers
Authors: Niederreiter, H. 
Winterhof, A.
Keywords: Inversive method
Linear complexity
Marsaglia's lattice test
Nonlinear method
Pseudorandom number generator
Issue Date: Dec-2002
Citation: Niederreiter, H., Winterhof, A. (2002-12). Lattice structure and linear complexity of nonlinear pseudorandom numbers. Applicable Algebra in Engineering, Communications and Computing 13 (4) : 319-326. ScholarBank@NUS Repository. https://doi.org/10.1007/s002000200105
Abstract: 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.
Source Title: Applicable Algebra in Engineering, Communications and Computing
URI: http://scholarbank.nus.edu.sg/handle/10635/103481
ISSN: 09381279
DOI: 10.1007/s002000200105
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

25
checked on May 20, 2018

WEB OF SCIENCETM
Citations

22
checked on Apr 16, 2018

Page view(s)

18
checked on Apr 20, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.