Title :
On the linear and nonlinear complexity profile of nonlinear pseudorandom number generators
Author :
Gutierrez, Jaime ; Shparlinski, Igor E. ; Winterhof, Arne
Author_Institution :
Fac. of Sci., Univ. of Cantabria, Santander, Spain
fDate :
1/1/2003 12:00:00 AM
Abstract :
We obtain lower bounds on the linear and nonlinear complexity profile of a general nonlinear pseudorandom number generator, of the inversive generator, and of a new nonlinear generator called quadratic exponential generator. The results are interesting for applications to cryptography and Monte Carlo methods.
Keywords :
Monte Carlo methods; computational complexity; cryptography; random number generation; Monte Carlo methods; cryptography; inversive generator; linear complexity profile; lower bounds; nonlinear complexity profile; nonlinear pseudorandom number generators; quadratic exponential generator; Australia Council; Cryptography; Galois fields; H infinity control; Lattices; Mathematics; Polynomials; Power generation; Terrorism;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2002.806144
