On the linear complexity profile of nonlinear congruential pseudorandom number generators with Rédei functions

Authors:
Wilfried Meidl;Arne Winterhof
Affiliations:
Sabanci University, Orhanli, Tuzla, 34956 Istanbul, Turkey and Johann Radon Institute for Computational and Applied Mathematics, Austrian Academy of Sciences, Altenbergerstraße 69, A-4040 Lin ...;Johann Radon Institute for Computational and Applied Mathematics, Austrian Academy of Sciences, Altenbergerstraße 69, A-4040 Linz, Austria
Venue:
Finite Fields and Their Applications
Year:
2007

Citing 4
Cited 1

On the Linear Complexity of the Power Generator

Designs, Codes and Cryptography
On the Linear Complexity Profile of Nonlinear Congruential Pseudorandom Number Generators with Dickson Polynomials

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

Recent results on recursive nonlinear pseudorandom number generators

SETA'10 Proceedings of the 6th international conference on Sequences 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 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 Redei functions which are much stronger than bounds known for general nonlinear congruential pseudorandom number generators.