On the linear complexity profile of nonlinear congruential pseudorandom number generators of higher orders

Article

DOI: 10.1007/s00200-005-0181-0

Cite this article as:
Topuzoğlu, A. & Winterhof, A. AAECC (2005) 16: 219. doi:10.1007/s00200-005-0181-0

Abstract

Nonlinear congruential methods are attractive alternatives to the classical linear congruential method for pseudorandom number generation. Generators of higher orders are of interest since they admit longer periods. We obtain lower bounds on the linear complexity profile of nonlinear pseudorandom number generators of higher orders. The results have applications in cryptography and in quasi-Monte Carlo methods.

Keywords

Linear complexity profile Nonlinear pseudorandom number generators Inversive generators Sequences over finite fields Recurrences of higher order 

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  1. 1.Sabanci UniversityTuzlaTurkey
  2. 2.Johann Radon Institute for Computational and Applied MathematicsAustrian Academy of SciencesLinzAustria

Personalised recommendations