On the linear complexity profile of nonlinear congruential pseudorandom number generators with Redei functions

Meidl, Wilfried and Winterhof, Arne (2007) On the linear complexity profile of nonlinear congruential pseudorandom number generators with Redei functions. Finite Fields and Their Applications, 13 (3). pp. 628-634. ISSN 1071-5797

This is the latest version of this item.

PDF - Registered users only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
77Kb

Official URL: http://dx.doi.org/10.1016/j.ffa.2005.10.001

Abstract

Linear complexity and linear complexity profile are important characteristics of a sequence for applications in cryptography and quasi-Monte Carlo methods. The nonlinear congruential method is an attractive alternative to the classical linear congruential method for pseudorandom number generation. We prove lower bounds on the linear complexity profile of nonlinear congruential pseudorandom number generators with Rédei functions which are much stronger than bounds known for general nonlinear congruential pseudorandom number generators.

Item Type:	Article
Uncontrolled Keywords:	Linear complexity profile; Nonlinear congruential generator; Rédei functions; Cryptography
Subjects:	UNSPECIFIED
ID Code:	7317
Deposited By:	Wilfried Meidl
Deposited On:	22 Dec 2007 16:23
Last Modified:	25 May 2011 14:13

Available Versions of this Item

On the Linear Complexity Profile of Nonlinear Congruential Pseudorandom Number Generators with Redei Functions. (deposited 22 Dec 2005 02:00)
- On the linear complexity profile of nonlinear congruential pseudorandom number generators with Redei functions. (deposited 22 Dec 2007 16:23) [Currently Displayed]

Repository Staff Only: item control page