Lattice Structure of Nonlinear Pseudorandom Number Generators in Parts of the Period

Gerhard Dorfer () and Arne Winterhof ()
Additional contact information
Gerhard Dorfer: Vienna University of Technology, Department of Algebra and Computational Mathematics
Arne Winterhof: National University of Singapore, Temasek Laboratories

A chapter in Monte Carlo and Quasi-Monte Carlo Methods 2002, 2004, pp 199-211 from Springer

Abstract: Summary Recently, we showed that an extension of Marsaglia’s lattice test for segments of sequences over arbitrary fields and the linear complexity profile provide essentially equivalent quality measures for the intrinsic structure of pseudorandom number sequences. More precisely, the knowledge of the linear complexity profile yields a value S such that the largest dimension for passing the above lattice test is either S or S — 1. In the present paper for periodic sequences over finite fields and sufficiently long parts of the period we determine the exact value S or S —1. As an application we deduce from recently obtained lower bounds on the linear complexity profile of certain nonlinear pseudorandom number generators new results on their lattice structure.

Date: 2004
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-18743-8_11

Ordering information: This item can be ordered from
http://www.springer.com/9783642187438

DOI: 10.1007/978-3-642-18743-8_11

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().