On the Linear Complexity Profile of Nonlinear Congruential Pseudorandom Number Generators with Dickson Polynomials

Authors:
Hassan Aly;Arne Winterhof
Affiliations:
Department of Mathematics, Faculty of Science, Cairo University, Giza, Egypt;Johann Radon Institute of Computational and Applied Mathematics (RICAM), Austrian Academy of Sciences, Linz, Austria 4040
Venue:
Designs, Codes and Cryptography
Year:
2006

Citing 4
Cited 2

On the Linear Complexity of the Power Generator

Designs, Codes and Cryptography
On the linear complexity profile of the power generator

IEEE Transactions on Information Theory
On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators

IEEE Transactions on Information Theory
Exponential sums with Dickson polynomials

Finite Fields and Their Applications

Recent results on recursive nonlinear pseudorandom number generators

SETA'10 Proceedings of the 6th international conference on Sequences and their applications
On the linear complexity profile of nonlinear congruential pseudorandom number generators with Rédei functions

Finite Fields and Their Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Linear complexity and linear complexity profile are important characteristics of a sequence for applications in cryptography and Monte-Carlo methods.The nonlinear congruential method is an attractive alternative to the classical linear congruential method for pseudorandom number generation.Recently, a weak lower bound on the linear complexity profile of a general nonlinear congruential pseudorandom number generator was proven by Gutierrez, Shparlinski and the first author. For most nonlinear generators a much stronger lower bound is expected.Here, we obtain a much stronger lower bound on the linear complexity profile of nonlinear congruential pseudorandom number generators with Dickson polynomials.