Please use this identifier to cite or link to this item: https://doi.org/10.1007/s00200-003-0116-6
Title: Lattice structure and linear complexity profile of nonlinear pseudorandom number generators
Authors: Dorfer, G.
Winterhof, A. 
Keywords: Linear complexity profile
Marsaglia's lattice test
Nonlinear method
Pseudorandom number generator
Issue Date: Apr-2003
Citation: Dorfer, G., Winterhof, A. (2003-04). Lattice structure and linear complexity profile of nonlinear pseudorandom number generators. Applicable Algebra in Engineering, Communications and Computing 13 (6) : 499-508. ScholarBank@NUS Repository. https://doi.org/10.1007/s00200-003-0116-6
Abstract: The lattice structure and linear complexity profile of nonlinear pseudorandom number generators were analyzed. The generalized version of Marsaglia's lattice test for sequences over finite fields was extended to segments of sequences over an arbitrary field. The analysis showed that linear complexity profile and the lattice test provide equivalent quality measures for randomness.
Source Title: Applicable Algebra in Engineering, Communications and Computing
URI: http://scholarbank.nus.edu.sg/handle/10635/132770
ISSN: 09381279
DOI: 10.1007/s00200-003-0116-6
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 Nov 9, 2018

WEB OF SCIENCETM
Citations

25
checked on Oct 31, 2018

Page view(s)

10
checked on Oct 25, 2018

Google ScholarTM

Check

Altmetric


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