Lattice Structure and Linear Complexity of Nonlinear Pseudorandom Numbers | Applicable Algebra in Engineering, Communication and Computing Skip to main content
Springer Nature Link
Log in

Lattice Structure and Linear Complexity of Nonlinear Pseudorandom Numbers

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

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.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Author information

Authors and Affiliations

  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

    Harald Niederreiter

  2. Institute of Discrete Mathematics, Austrian Academy of Sciences, Sonnenfelsgasse 19, 1010 Vienna, Austria (e-mail: arne.winterhof@oeaw.ac.at), , , , , , AT

    Arne Winterhof

Authors
  1. Harald Niederreiter
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arne Winterhof
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: October 2, 2001

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

Rights and permissions

Reprints and permissions

About this article

Cite this article

Niederreiter, H., Winterhof, A. Lattice Structure and Linear Complexity of Nonlinear Pseudorandom Numbers. AAECC 13, 319–326 (2002). https://doi.org/10.1007/s002000200105

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002000200105

Keywords

Search

Navigation