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

Topuzoğlu, Alev and Winterhof, Arne (2005) On the linear complexity profile of nonlinear congruential pseudorandom number generators of higher orders. Applicable Algebra in Engineering, Communication and Computing, 16 (4). pp. 219-228. ISSN 0938-1279 (Print) 1432-0622 (Online)

Full text not available from this repository.

Official URL: http://dx.doi.org/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.

Item Type:	Article
Uncontrolled Keywords:	linear complexity profile; nonlinear pseudorandom number generators; inversive generators; sequences over finite fields; recurrences of higher order
Subjects:	Q Science > QA Mathematics
ID Code:	688
Deposited By:	Alev Topuzoğlu
Deposited On:	28 Dec 2005 02:00
Last Modified:	25 May 2011 14:07

Repository Staff Only: item control page