Skip to main content
Log in

Lattice Structure and Linear Complexity Profile of Nonlinear Pseudorandom Number Generators

  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

Abstract.

 We extend a generalized version of Marsaglia's lattice test for sequences over finite fields to segments of sequences over an arbitrary field and show that linear complexity profile and this lattice test provide essentially equivalent quality measures for randomness.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: October 4, 2002; revised version: January 10, 2003

Keywords: Pseudorandom number generator, Nonlinear method, Linear complexity profile, Marsaglia's lattice test.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dorfer, G., Winterhof, A. Lattice Structure and Linear Complexity Profile of Nonlinear Pseudorandom Number Generators. AAECC 13, 499–508 (2003). https://doi.org/10.1007/s00200-003-0116-6

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00200-003-0116-6

Keywords

Navigation